/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:07:37,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:07:37,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:07:37,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:07:37,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:07:37,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:07:37,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:07:37,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:07:37,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:07:37,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:07:37,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:07:37,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:07:37,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:07:37,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:07:37,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:07:37,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:07:37,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:07:37,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:07:37,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:07:37,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:07:37,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:07:37,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:07:37,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:07:37,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:07:37,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:07:37,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:07:37,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:07:37,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:07:37,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:07:37,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:07:37,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:07:37,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:07:37,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:07:37,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:07:37,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:07:37,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:07:37,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:07:37,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:07:37,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:07:37,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:07:37,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:07:37,182 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:07:37,196 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:07:37,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:07:37,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:07:37,198 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:07:37,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:07:37,198 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:07:37,198 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:07:37,199 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:07:37,199 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:07:37,199 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:07:37,199 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:07:37,199 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:07:37,200 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:07:37,200 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:07:37,200 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:07:37,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:07:37,200 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:07:37,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:07:37,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:07:37,201 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:07:37,201 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:07:37,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:07:37,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:07:37,202 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:07:37,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:07:37,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:07:37,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:07:37,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:07:37,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:07:37,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:07:37,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:07:37,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:07:37,384 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:07:37,384 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:07:37,385 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:07:37,485 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_NmctAE/tmp/53ca0238677f4fe2ad1aba8796305d20/FLAGcc581728e [2020-07-01 13:07:37,829 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:07:37,830 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:07:37,830 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:07:37,836 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_NmctAE/tmp/53ca0238677f4fe2ad1aba8796305d20/FLAGcc581728e [2020-07-01 13:07:38,232 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_NmctAE/tmp/53ca0238677f4fe2ad1aba8796305d20 [2020-07-01 13:07:38,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:07:38,245 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:07:38,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:07:38,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:07:38,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:07:38,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774b6771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38, skipping insertion in model container [2020-07-01 13:07:38,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:07:38,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:07:38,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:07:38,533 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:07:38,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:07:38,568 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:07:38,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38 WrapperNode [2020-07-01 13:07:38,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:07:38,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:07:38,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:07:38,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:07:38,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:07:38,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:07:38,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:07:38,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:07:38,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:07:38,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:07:38,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:07:38,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:07:38,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:07:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:07:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:07:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:07:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:07:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:07:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:07:38,952 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:07:38,953 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:07:38,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:07:38 BoogieIcfgContainer [2020-07-01 13:07:38,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:07:38,957 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:07:38,957 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:07:38,959 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:07:38,960 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:07:38" (1/1) ... [2020-07-01 13:07:38,973 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges [2020-07-01 13:07:38,975 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:07:38,975 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:07:38,976 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:07:38,976 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:07:38,978 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:07:38,979 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:07:38,980 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:07:38,999 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:07:39,024 INFO L200 BlockEncoder]: SBE split 8 edges [2020-07-01 13:07:39,029 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:07:39,031 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:07:39,058 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 13:07:39,061 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 13:07:39,062 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:07:39,063 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:07:39,063 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:07:39,064 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:07:39,064 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges [2020-07-01 13:07:39,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:07:39 BasicIcfg [2020-07-01 13:07:39,065 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:07:39,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:07:39,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:07:39,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:07:39,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:07:38" (1/4) ... [2020-07-01 13:07:39,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32718cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:07:39, skipping insertion in model container [2020-07-01 13:07:39,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (2/4) ... [2020-07-01 13:07:39,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32718cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:07:39, skipping insertion in model container [2020-07-01 13:07:39,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:07:38" (3/4) ... [2020-07-01 13:07:39,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32718cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:07:39, skipping insertion in model container [2020-07-01 13:07:39,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:07:39" (4/4) ... [2020-07-01 13:07:39,073 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:07:39,084 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:07:39,091 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-01 13:07:39,105 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-01 13:07:39,128 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:07:39,128 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:07:39,128 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:07:39,129 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:07:39,129 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:07:39,129 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:07:39,129 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:07:39,129 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:07:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-07-01 13:07:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:07:39,150 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:39,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:07:39,151 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash 125559296, now seen corresponding path program 1 times [2020-07-01 13:07:39,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:39,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335968618] [2020-07-01 13:07:39,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:39,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335968618] [2020-07-01 13:07:39,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:39,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:39,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662412298] [2020-07-01 13:07:39,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:39,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:39,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:39,351 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-07-01 13:07:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:39,419 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. [2020-07-01 13:07:39,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:39,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:07:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:39,433 INFO L225 Difference]: With dead ends: 26 [2020-07-01 13:07:39,433 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 13:07:39,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 13:07:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-01 13:07:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 13:07:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2020-07-01 13:07:39,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 5 [2020-07-01 13:07:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:39,472 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-07-01 13:07:39,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2020-07-01 13:07:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:07:39,473 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:39,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:07:39,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:07:39,475 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 125559327, now seen corresponding path program 1 times [2020-07-01 13:07:39,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:39,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711017969] [2020-07-01 13:07:39,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:39,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711017969] [2020-07-01 13:07:39,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:39,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:39,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996177489] [2020-07-01 13:07:39,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:39,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:39,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:39,519 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. Second operand 3 states. [2020-07-01 13:07:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:39,565 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2020-07-01 13:07:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:39,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:07:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:39,566 INFO L225 Difference]: With dead ends: 15 [2020-07-01 13:07:39,566 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:07:39,567 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:07:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 13:07:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:07:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2020-07-01 13:07:39,571 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 5 [2020-07-01 13:07:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:39,571 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 22 transitions. [2020-07-01 13:07:39,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 22 transitions. [2020-07-01 13:07:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:07:39,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:39,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:07:39,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:07:39,572 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:39,573 INFO L82 PathProgramCache]: Analyzing trace with hash 125559329, now seen corresponding path program 1 times [2020-07-01 13:07:39,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:39,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124448529] [2020-07-01 13:07:39,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:39,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124448529] [2020-07-01 13:07:39,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:39,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:07:39,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983464484] [2020-07-01 13:07:39,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:07:39,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:39,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:07:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:07:39,618 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. Second operand 4 states. [2020-07-01 13:07:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:39,670 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-07-01 13:07:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:07:39,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 13:07:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:39,671 INFO L225 Difference]: With dead ends: 15 [2020-07-01 13:07:39,671 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:07:39,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:07:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:07:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 13:07:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:07:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2020-07-01 13:07:39,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 5 [2020-07-01 13:07:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:39,693 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-07-01 13:07:39,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:07:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. [2020-07-01 13:07:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:07:39,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:39,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:07:39,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:07:39,694 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 125559330, now seen corresponding path program 1 times [2020-07-01 13:07:39,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:39,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383811708] [2020-07-01 13:07:39,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:39,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383811708] [2020-07-01 13:07:39,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:39,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:39,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856557975] [2020-07-01 13:07:39,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:39,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:39,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:39,731 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. Second operand 3 states. [2020-07-01 13:07:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:39,776 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-07-01 13:07:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:39,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:07:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:39,778 INFO L225 Difference]: With dead ends: 14 [2020-07-01 13:07:39,778 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:07:39,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:07:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 13:07:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:07:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-07-01 13:07:39,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 5 [2020-07-01 13:07:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:39,781 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-07-01 13:07:39,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. [2020-07-01 13:07:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:07:39,782 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:39,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:07:39,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:07:39,783 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:39,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:39,783 INFO L82 PathProgramCache]: Analyzing trace with hash -402627567, now seen corresponding path program 1 times [2020-07-01 13:07:39,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:39,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790593504] [2020-07-01 13:07:39,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:39,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790593504] [2020-07-01 13:07:39,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:39,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:07:39,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67309680] [2020-07-01 13:07:39,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:07:39,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:39,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:07:39,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:07:39,826 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 4 states. [2020-07-01 13:07:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:39,882 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-07-01 13:07:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:07:39,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 13:07:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:39,883 INFO L225 Difference]: With dead ends: 22 [2020-07-01 13:07:39,883 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 13:07:39,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:07:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 13:07:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2020-07-01 13:07:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:07:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2020-07-01 13:07:39,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 6 [2020-07-01 13:07:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:39,889 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. [2020-07-01 13:07:39,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:07:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. [2020-07-01 13:07:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:07:39,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:39,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:07:39,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:07:39,890 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -402627570, now seen corresponding path program 1 times [2020-07-01 13:07:39,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:39,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841017337] [2020-07-01 13:07:39,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:39,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841017337] [2020-07-01 13:07:39,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:39,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:39,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717847387] [2020-07-01 13:07:39,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:39,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:39,926 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 3 states. [2020-07-01 13:07:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:39,966 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. [2020-07-01 13:07:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:39,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:07:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:39,967 INFO L225 Difference]: With dead ends: 14 [2020-07-01 13:07:39,968 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:07:39,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:07:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 13:07:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:07:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-07-01 13:07:39,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 6 [2020-07-01 13:07:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:39,972 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-07-01 13:07:39,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. [2020-07-01 13:07:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:07:39,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:39,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:07:39,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:07:39,973 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:39,973 INFO L82 PathProgramCache]: Analyzing trace with hash -402627568, now seen corresponding path program 1 times [2020-07-01 13:07:39,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:39,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405502550] [2020-07-01 13:07:39,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405502550] [2020-07-01 13:07:40,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:07:40,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290017475] [2020-07-01 13:07:40,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:07:40,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:07:40,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:07:40,036 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 5 states. [2020-07-01 13:07:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,102 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2020-07-01 13:07:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:07:40,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-07-01 13:07:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,103 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:07:40,103 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 13:07:40,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:07:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 13:07:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2020-07-01 13:07:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:07:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-01 13:07:40,107 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 6 [2020-07-01 13:07:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,107 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-01 13:07:40,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:07:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-01 13:07:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:07:40,108 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:40,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:07:40,109 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 403446106, now seen corresponding path program 1 times [2020-07-01 13:07:40,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259398964] [2020-07-01 13:07:40,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259398964] [2020-07-01 13:07:40,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:07:40,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577776467] [2020-07-01 13:07:40,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:07:40,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:07:40,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:07:40,165 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 4 states. [2020-07-01 13:07:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,210 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-01 13:07:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:07:40,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:07:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,211 INFO L225 Difference]: With dead ends: 13 [2020-07-01 13:07:40,211 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 13:07:40,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:07:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 13:07:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 13:07:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 13:07:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-07-01 13:07:40,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 7 [2020-07-01 13:07:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,216 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-01 13:07:40,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:07:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-01 13:07:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:07:40,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:40,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:07:40,217 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 403446108, now seen corresponding path program 1 times [2020-07-01 13:07:40,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194490424] [2020-07-01 13:07:40,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194490424] [2020-07-01 13:07:40,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:07:40,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950235044] [2020-07-01 13:07:40,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:07:40,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:07:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:07:40,261 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 4 states. [2020-07-01 13:07:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,316 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-01 13:07:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:07:40,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:07:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,317 INFO L225 Difference]: With dead ends: 17 [2020-07-01 13:07:40,317 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:07:40,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:07:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:07:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2020-07-01 13:07:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:07:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-01 13:07:40,321 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 7 [2020-07-01 13:07:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,321 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-01 13:07:40,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:07:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-01 13:07:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:07:40,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:40,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:07:40,323 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,323 INFO L82 PathProgramCache]: Analyzing trace with hash 403446109, now seen corresponding path program 1 times [2020-07-01 13:07:40,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119499981] [2020-07-01 13:07:40,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119499981] [2020-07-01 13:07:40,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:07:40,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968171461] [2020-07-01 13:07:40,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:07:40,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:07:40,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:07:40,387 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 5 states. [2020-07-01 13:07:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,473 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-01 13:07:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:07:40,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 13:07:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,475 INFO L225 Difference]: With dead ends: 16 [2020-07-01 13:07:40,475 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 13:07:40,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:07:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 13:07:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-07-01 13:07:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:07:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-07-01 13:07:40,479 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 7 [2020-07-01 13:07:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,479 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-01 13:07:40,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:07:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-01 13:07:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:07:40,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:40,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:07:40,481 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1743625072, now seen corresponding path program 1 times [2020-07-01 13:07:40,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42334282] [2020-07-01 13:07:40,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42334282] [2020-07-01 13:07:40,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351860109] [2020-07-01 13:07:40,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:07:40,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:07:40,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:07:40,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987214318] [2020-07-01 13:07:40,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:07:40,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:07:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:07:40,610 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 4 states. [2020-07-01 13:07:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:40,645 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-01 13:07:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:07:40,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 13:07:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:40,646 INFO L225 Difference]: With dead ends: 16 [2020-07-01 13:07:40,646 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 13:07:40,646 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:07:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 13:07:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-07-01 13:07:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:07:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-01 13:07:40,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2020-07-01 13:07:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:40,650 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-01 13:07:40,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:07:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-01 13:07:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:07:40,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:40,651 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:40,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-01 13:07:40,852 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1743625071, now seen corresponding path program 1 times [2020-07-01 13:07:40,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:40,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367224724] [2020-07-01 13:07:40,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:40,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367224724] [2020-07-01 13:07:40,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:40,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 13:07:40,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342510201] [2020-07-01 13:07:40,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:07:40,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:40,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:07:40,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:07:40,947 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 6 states. [2020-07-01 13:07:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:41,023 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-07-01 13:07:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:07:41,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 13:07:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:41,024 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:07:41,024 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:07:41,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:07:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:07:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 13:07:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:07:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2020-07-01 13:07:41,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2020-07-01 13:07:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:41,028 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-01 13:07:41,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:07:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-01 13:07:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:07:41,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:41,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:41,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 13:07:41,030 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:41,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1554863860, now seen corresponding path program 1 times [2020-07-01 13:07:41,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:41,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655793823] [2020-07-01 13:07:41,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:41,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655793823] [2020-07-01 13:07:41,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:41,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 13:07:41,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792306130] [2020-07-01 13:07:41,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 13:07:41,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:41,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 13:07:41,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:07:41,144 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 7 states. [2020-07-01 13:07:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:41,303 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-07-01 13:07:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 13:07:41,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-01 13:07:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:41,304 INFO L225 Difference]: With dead ends: 25 [2020-07-01 13:07:41,305 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:07:41,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-01 13:07:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:07:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 13:07:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:07:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-07-01 13:07:41,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2020-07-01 13:07:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:41,308 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-07-01 13:07:41,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 13:07:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-07-01 13:07:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:07:41,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:41,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:41,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 13:07:41,309 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1594603772, now seen corresponding path program 1 times [2020-07-01 13:07:41,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:41,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194701364] [2020-07-01 13:07:41,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:41,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194701364] [2020-07-01 13:07:41,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564003326] [2020-07-01 13:07:41,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:41,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-01 13:07:41,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:41,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 13:07:41,594 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:41,603 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:41,605 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 13:07:41,606 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 13:07:41,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:41,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 13:07:41,654 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:41,657 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:07:41,668 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:41,671 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:07:41,674 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:07:41,676 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 13:07:41,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 13:07:41,705 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:41,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:07:41,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-07-01 13:07:41,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881726001] [2020-07-01 13:07:41,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 13:07:41,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:41,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 13:07:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-01 13:07:41,738 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 12 states. [2020-07-01 13:07:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:42,087 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-07-01 13:07:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 13:07:42,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2020-07-01 13:07:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:42,088 INFO L225 Difference]: With dead ends: 21 [2020-07-01 13:07:42,088 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 13:07:42,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2020-07-01 13:07:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 13:07:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2020-07-01 13:07:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:07:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-07-01 13:07:42,092 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2020-07-01 13:07:42,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:42,092 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-01 13:07:42,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 13:07:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-01 13:07:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:07:42,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:42,093 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:42,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 13:07:42,294 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:42,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:42,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2106889448, now seen corresponding path program 1 times [2020-07-01 13:07:42,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:42,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565087291] [2020-07-01 13:07:42,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:42,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565087291] [2020-07-01 13:07:42,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859587452] [2020-07-01 13:07:42,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:42,374 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:07:42,375 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:42,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:07:42,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:07:42,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462183527] [2020-07-01 13:07:42,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:07:42,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:42,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:07:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:07:42,387 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2020-07-01 13:07:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:42,416 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-01 13:07:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:07:42,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 13:07:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:42,417 INFO L225 Difference]: With dead ends: 17 [2020-07-01 13:07:42,417 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:07:42,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:07:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:07:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:07:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:07:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-01 13:07:42,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2020-07-01 13:07:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:42,421 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-01 13:07:42,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:07:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-01 13:07:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:07:42,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:42,422 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:42,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-01 13:07:42,623 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2106889449, now seen corresponding path program 1 times [2020-07-01 13:07:42,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:42,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832749733] [2020-07-01 13:07:42,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:42,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832749733] [2020-07-01 13:07:42,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403692527] [2020-07-01 13:07:42,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:42,732 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 13:07:42,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:42,741 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_11|], 1=[|v_#valid_20|]} [2020-07-01 13:07:42,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:07:42,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:07:42,750 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:42,763 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:42,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:07:42,771 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:42,782 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:42,783 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:42,784 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 [2020-07-01 13:07:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:42,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:07:42,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-07-01 13:07:42,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866168580] [2020-07-01 13:07:42,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 13:07:42,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:42,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 13:07:42,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-01 13:07:42,887 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 11 states. [2020-07-01 13:07:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:48,744 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-07-01 13:07:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 13:07:48,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-07-01 13:07:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:48,746 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:07:48,746 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 13:07:48,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-01 13:07:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 13:07:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-07-01 13:07:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 13:07:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-01 13:07:48,750 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2020-07-01 13:07:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:48,750 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-01 13:07:48,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 13:07:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-01 13:07:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 13:07:48,751 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:48,751 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:48,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:48,952 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash -309402525, now seen corresponding path program 2 times [2020-07-01 13:07:48,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:48,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579237247] [2020-07-01 13:07:48,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:49,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579237247] [2020-07-01 13:07:49,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270106788] [2020-07-01 13:07:49,180 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:49,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:07:49,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:07:49,228 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 13:07:49,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:49,238 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_21|]} [2020-07-01 13:07:49,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:07:49,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:07:49,246 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:49,254 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:49,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:07:49,259 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:49,267 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:49,268 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:49,268 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 13:07:49,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 13:07:49,294 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:49,303 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:49,304 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:07:49,304 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-07-01 13:07:49,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 13:07:49,353 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:49,367 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:49,368 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:07:49,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:19 [2020-07-01 13:07:49,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:49,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 13:07:49,428 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:49,429 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:07:49,441 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:49,443 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:07:49,444 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:49,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-07-01 13:07:49,481 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:49,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:07:49,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-07-01 13:07:49,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216687213] [2020-07-01 13:07:49,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 13:07:49,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:49,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 13:07:49,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-07-01 13:07:49,497 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 14 states. [2020-07-01 13:07:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:50,190 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-01 13:07:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 13:07:50,190 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2020-07-01 13:07:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:50,191 INFO L225 Difference]: With dead ends: 22 [2020-07-01 13:07:50,191 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 13:07:50,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2020-07-01 13:07:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 13:07:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-01 13:07:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:07:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-07-01 13:07:50,196 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2020-07-01 13:07:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:50,196 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-01 13:07:50,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 13:07:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-01 13:07:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 13:07:50,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:50,197 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:50,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 13:07:50,398 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:07:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash 114146819, now seen corresponding path program 1 times [2020-07-01 13:07:50,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:50,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460062089] [2020-07-01 13:07:50,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:07:50,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460062089] [2020-07-01 13:07:50,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068709851] [2020-07-01 13:07:50,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:50,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-01 13:07:50,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:50,586 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_13|], 1=[|v_#valid_22|]} [2020-07-01 13:07:50,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:07:50,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:07:50,591 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,599 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:50,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:07:50,604 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,611 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:50,612 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,612 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 13:07:50,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 13:07:50,619 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,625 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:50,625 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,625 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-01 13:07:50,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 13:07:50,643 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,650 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:50,651 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,651 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-07-01 13:07:50,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 13:07:50,670 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,680 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:50,681 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-07-01 13:07:50,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:50,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 13:07:50,713 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:50,713 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:07:50,722 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:50,722 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:50,723 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 13:07:50,743 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:07:50,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:07:50,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-01 13:07:50,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556166669] [2020-07-01 13:07:50,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 13:07:50,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:50,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 13:07:50,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:07:50,758 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 10 states. [2020-07-01 13:07:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:50,887 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-01 13:07:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:07:50,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-01 13:07:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:50,888 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:07:50,888 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:07:50,889 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:07:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:07:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:07:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:07:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:07:50,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-01 13:07:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:50,890 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:07:50,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 13:07:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:07:50,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:07:51,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 13:07:51,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:07:51,633 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2020-07-01 13:07:51,636 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:07:51,637 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-01 13:07:51,637 INFO L268 CegarLoopResult]: For program point L20-1(lines 14 29) no Hoare annotation was computed. [2020-07-01 13:07:51,637 INFO L268 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-07-01 13:07:51,637 INFO L268 CegarLoopResult]: For program point L17-2(lines 14 29) no Hoare annotation was computed. [2020-07-01 13:07:51,637 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:07:51,637 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:07:51,637 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:07:51,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 13:07:51,638 INFO L268 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-07-01 13:07:51,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:07:51,638 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:07:51,638 INFO L268 CegarLoopResult]: For program point L10-4(line 10) no Hoare annotation was computed. [2020-07-01 13:07:51,639 INFO L264 CegarLoopResult]: At program point L10-5(line 10) the Hoare annotation is: (let ((.cse17 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (.cse19 (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (let ((.cse0 (not .cse19)) (.cse1 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse3 (select |#length| ULTIMATE.start_cstrcpy_~from.base)) (.cse4 (select |#length| ULTIMATE.start_cstrcpy_~to.base)) (.cse16 (= 0 ULTIMATE.start_cstrcpy_~to.offset)) (.cse2 (not (= ULTIMATE.start_cstrcpy_~to.base ULTIMATE.start_cstrcpy_~from.base))) (.cse5 (<= 1 |#StackHeapBarrier|)) (.cse6 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse7 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base))) (.cse8 (or .cse19 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1))) (.cse9 (<= ULTIMATE.start_main_~length2~0 .cse17)) (.cse18 (= 0 ULTIMATE.start_cstrcpy_~from.offset)) (.cse10 (= 0 ULTIMATE.start_main_~nondetArea~0.offset)) (.cse11 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~from.base) (+ (select |#length| ULTIMATE.start_cstrcpy_~from.base) ULTIMATE.start_main_~nondetString~0.offset (- 1))))))) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~from.base))) (.cse13 (= 0 ULTIMATE.start_main_~nondetString~0.offset)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~to.base))) (.cse14 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (or (and (<= 1 ULTIMATE.start_cstrcpy_~from.offset) .cse0 .cse1 .cse2 (<= (+ .cse3 ULTIMATE.start_cstrcpy_~to.offset) (+ ULTIMATE.start_cstrcpy_~from.offset .cse4)) .cse5 (<= (+ ULTIMATE.start_cstrcpy_~from.offset 1) .cse3) (<= 1 ULTIMATE.start_cstrcpy_~to.offset) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= 1 .cse3) .cse16 .cse5 .cse6 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~from.base) ULTIMATE.start_cstrcpy_~from.offset)) .cse7 .cse8 (<= 1 .cse17) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset)) (<= 1 .cse4) .cse18 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (<= .cse3 .cse4) .cse16 .cse2 .cse5 .cse6 .cse7 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrcpy_~from.base)) (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_cstrcpy_~from.offset ULTIMATE.start_main_~nondetString~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~from.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))))) .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14)))) [2020-07-01 13:07:51,639 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 13:07:51,641 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:07:51,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:07:51 BasicIcfg [2020-07-01 13:07:51,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:07:51,694 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:07:51,694 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:07:51,697 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:07:51,698 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:51,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:07:38" (1/5) ... [2020-07-01 13:07:51,699 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7555476b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:07:51, skipping insertion in model container [2020-07-01 13:07:51,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:51,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:07:38" (2/5) ... [2020-07-01 13:07:51,699 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7555476b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:07:51, skipping insertion in model container [2020-07-01 13:07:51,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:51,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:07:38" (3/5) ... [2020-07-01 13:07:51,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7555476b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:07:51, skipping insertion in model container [2020-07-01 13:07:51,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:51,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:07:39" (4/5) ... [2020-07-01 13:07:51,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7555476b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:07:51, skipping insertion in model container [2020-07-01 13:07:51,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:07:51,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:07:51" (5/5) ... [2020-07-01 13:07:51,702 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:07:51,722 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:07:51,723 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:07:51,723 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:07:51,723 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:07:51,723 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:07:51,723 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:07:51,723 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:07:51,723 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:07:51,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-01 13:07:51,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 13:07:51,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:07:51,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:07:51,737 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:07:51,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 13:07:51,737 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:07:51,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-01 13:07:51,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 13:07:51,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:07:51,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:07:51,738 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:07:51,739 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 13:07:51,744 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L17: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_15| (store |v_#valid_16| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 9#L17true [75] L17-->L17-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 3#L17-2true [76] L17-2-->L20-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 12#L20-1true [88] L20-1-->L26: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1)) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 4#L26true [105] L26-->L10-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrcpy_#in~to.offset_2|) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrcpy_~save~0.base_4 v_ULTIMATE.start_cstrcpy_~to.base_8) (= v_ULTIMATE.start_cstrcpy_~from.base_8 |v_ULTIMATE.start_cstrcpy_#in~from.base_2|) (= (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0)) |v_#memory_int_6|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcpy_#in~from.offset_2| v_ULTIMATE.start_cstrcpy_~from.offset_7) (= v_ULTIMATE.start_cstrcpy_~save~0.offset_4 v_ULTIMATE.start_cstrcpy_~to.offset_7) (= |v_ULTIMATE.start_cstrcpy_#in~to.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (= v_ULTIMATE.start_cstrcpy_~to.offset_7 |v_ULTIMATE.start_cstrcpy_#in~to.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrcpy_#in~from.base_2|) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrcpy_#in~from.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= |v_ULTIMATE.start_cstrcpy_#in~to.base_2| v_ULTIMATE.start_cstrcpy_~to.base_8))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrcpy_#t~pre1.base=|v_ULTIMATE.start_cstrcpy_#t~pre1.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_8, ULTIMATE.start_cstrcpy_#t~pre0.base=|v_ULTIMATE.start_cstrcpy_#t~pre0.base_4|, ULTIMATE.start_cstrcpy_#t~pre0.offset=|v_ULTIMATE.start_cstrcpy_#t~pre0.offset_4|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_8, ULTIMATE.start_cstrcpy_#in~to.base=|v_ULTIMATE.start_cstrcpy_#in~to.base_2|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstrcpy_~save~0.offset=v_ULTIMATE.start_cstrcpy_~save~0.offset_4, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_7, ULTIMATE.start_cstrcpy_#res.base=|v_ULTIMATE.start_cstrcpy_#res.base_4|, ULTIMATE.start_cstrcpy_#res.offset=|v_ULTIMATE.start_cstrcpy_#res.offset_4|, ULTIMATE.start_cstrcpy_#in~from.offset=|v_ULTIMATE.start_cstrcpy_#in~from.offset_2|, ULTIMATE.start_cstrcpy_#in~to.offset=|v_ULTIMATE.start_cstrcpy_#in~to.offset_2|, ULTIMATE.start_cstrcpy_#in~from.base=|v_ULTIMATE.start_cstrcpy_#in~from.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_cstrcpy_#t~pre1.offset=|v_ULTIMATE.start_cstrcpy_#t~pre1.offset_4|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcpy_~save~0.base=v_ULTIMATE.start_cstrcpy_~save~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_~save~0.offset, ULTIMATE.start_cstrcpy_~to.offset, ULTIMATE.start_cstrcpy_#t~pre1.base, ULTIMATE.start_cstrcpy_~from.base, ULTIMATE.start_cstrcpy_#res.base, ULTIMATE.start_cstrcpy_#t~pre0.base, ULTIMATE.start_cstrcpy_#res.offset, ULTIMATE.start_cstrcpy_#in~from.offset, ULTIMATE.start_cstrcpy_#t~pre0.offset, ULTIMATE.start_cstrcpy_~to.base, ULTIMATE.start_cstrcpy_#in~to.offset, ULTIMATE.start_cstrcpy_#in~from.base, ULTIMATE.start_cstrcpy_~from.offset, ULTIMATE.start_cstrcpy_#in~to.base, ULTIMATE.start_cstrcpy_#t~pre1.offset, #memory_int, ULTIMATE.start_cstrcpy_~save~0.base] 6#L10-5true [2020-07-01 13:07:51,744 INFO L796 eck$LassoCheckResult]: Loop: 6#L10-5true [54] L10-5-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrcpy_~from.offset_3 1) (select |v_#length_6| v_ULTIMATE.start_cstrcpy_~from.base_3)) (= |v_ULTIMATE.start_cstrcpy_#t~mem2_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrcpy_~from.base_3) v_ULTIMATE.start_cstrcpy_~from.offset_3)) (<= 0 v_ULTIMATE.start_cstrcpy_~from.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_cstrcpy_~from.base_3) 1)) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_3, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_2|, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_3, #length=|v_#length_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 14#L10-1true [66] L10-1-->L10-2: Formula: (and (= |v_#memory_int_4| (store |v_#memory_int_5| v_ULTIMATE.start_cstrcpy_~to.base_3 (store (select |v_#memory_int_5| v_ULTIMATE.start_cstrcpy_~to.base_3) v_ULTIMATE.start_cstrcpy_~to.offset_3 |v_ULTIMATE.start_cstrcpy_#t~mem2_3|))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrcpy_~to.base_3)) (<= 0 v_ULTIMATE.start_cstrcpy_~to.offset_3) (<= (+ v_ULTIMATE.start_cstrcpy_~to.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcpy_~to.base_3))) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_3, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_3, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 11#L10-2true [101] L10-2-->L10-4: Formula: (< 0 |v_ULTIMATE.start_cstrcpy_#t~mem2_7|) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 8#L10-4true [58] L10-4-->L10-5: Formula: (and (= v_ULTIMATE.start_cstrcpy_~from.offset_5 (+ v_ULTIMATE.start_cstrcpy_~from.offset_6 1)) (= v_ULTIMATE.start_cstrcpy_~to.offset_5 (+ v_ULTIMATE.start_cstrcpy_~to.offset_6 1)) (= v_ULTIMATE.start_cstrcpy_~to.base_6 v_ULTIMATE.start_cstrcpy_~to.base_7) (= v_ULTIMATE.start_cstrcpy_~from.base_6 v_ULTIMATE.start_cstrcpy_~from.base_7)) InVars {ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_7, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_7, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_6, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_6} OutVars{ULTIMATE.start_cstrcpy_#t~pre0.offset=|v_ULTIMATE.start_cstrcpy_#t~pre0.offset_2|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_6, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_5, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_5, ULTIMATE.start_cstrcpy_#t~pre1.base=|v_ULTIMATE.start_cstrcpy_#t~pre1.base_2|, ULTIMATE.start_cstrcpy_#t~pre1.offset=|v_ULTIMATE.start_cstrcpy_#t~pre1.offset_2|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_6, ULTIMATE.start_cstrcpy_#t~pre0.base=|v_ULTIMATE.start_cstrcpy_#t~pre0.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~pre0.offset, ULTIMATE.start_cstrcpy_~to.base, ULTIMATE.start_cstrcpy_~to.offset, ULTIMATE.start_cstrcpy_~from.offset, ULTIMATE.start_cstrcpy_#t~pre1.base, ULTIMATE.start_cstrcpy_#t~pre1.offset, ULTIMATE.start_cstrcpy_~from.base, ULTIMATE.start_cstrcpy_#t~pre0.base] 6#L10-5true [2020-07-01 13:07:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash 126062008, now seen corresponding path program 1 times [2020-07-01 13:07:51,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:51,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425628574] [2020-07-01 13:07:51,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:51,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425628574] [2020-07-01 13:07:51,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:51,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:07:51,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618892764] [2020-07-01 13:07:51,762 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:07:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:51,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2598850, now seen corresponding path program 1 times [2020-07-01 13:07:51,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:51,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540464885] [2020-07-01 13:07:51,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:07:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:07:51,787 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:07:51,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:51,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:51,859 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-07-01 13:07:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:51,903 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2020-07-01 13:07:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:51,906 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:07:51,910 INFO L168 Benchmark]: Toolchain (without parser) took 13665.99 ms. Allocated memory was 649.6 MB in the beginning and 836.2 MB in the end (delta: 186.6 MB). Free memory was 556.0 MB in the beginning and 798.5 MB in the end (delta: -242.5 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:07:51,911 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:07:51,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.19 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 556.0 MB in the beginning and 651.1 MB in the end (delta: -95.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:51,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.87 ms. Allocated memory is still 688.4 MB. Free memory was 651.1 MB in the beginning and 648.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:51,912 INFO L168 Benchmark]: Boogie Preprocessor took 26.46 ms. Allocated memory is still 688.4 MB. Free memory was 648.9 MB in the beginning and 647.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:51,912 INFO L168 Benchmark]: RCFGBuilder took 319.01 ms. Allocated memory is still 688.4 MB. Free memory was 647.8 MB in the beginning and 626.4 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:51,912 INFO L168 Benchmark]: BlockEncodingV2 took 107.71 ms. Allocated memory is still 688.4 MB. Free memory was 626.4 MB in the beginning and 618.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:51,913 INFO L168 Benchmark]: TraceAbstraction took 12627.16 ms. Allocated memory was 688.4 MB in the beginning and 778.0 MB in the end (delta: 89.7 MB). Free memory was 617.8 MB in the beginning and 409.9 MB in the end (delta: 207.9 MB). Peak memory consumption was 297.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:07:51,913 INFO L168 Benchmark]: BuchiAutomizer took 215.08 ms. Allocated memory was 778.0 MB in the beginning and 836.2 MB in the end (delta: 58.2 MB). Free memory was 409.9 MB in the beginning and 798.5 MB in the end (delta: -388.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:07:51,916 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 22 locations, 26 edges - StatisticsResult: Encoded RCFG 15 locations, 27 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 323.19 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 556.0 MB in the beginning and 651.1 MB in the end (delta: -95.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.87 ms. Allocated memory is still 688.4 MB. Free memory was 651.1 MB in the beginning and 648.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.46 ms. Allocated memory is still 688.4 MB. Free memory was 648.9 MB in the beginning and 647.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 319.01 ms. Allocated memory is still 688.4 MB. Free memory was 647.8 MB in the beginning and 626.4 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 107.71 ms. Allocated memory is still 688.4 MB. Free memory was 626.4 MB in the beginning and 618.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 12627.16 ms. Allocated memory was 688.4 MB in the beginning and 778.0 MB in the end (delta: 89.7 MB). Free memory was 617.8 MB in the beginning and 409.9 MB in the end (delta: 207.9 MB). Peak memory consumption was 297.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 215.08 ms. Allocated memory was 778.0 MB in the beginning and 836.2 MB in the end (delta: 58.2 MB). Free memory was 409.9 MB in the beginning and 798.5 MB in the end (delta: -388.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 13:07:51,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,930 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,932 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:07:51,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 13:07:51,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,943 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:07:51,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:07:51,944 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:07:51,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((1 <= from && !(nondetString == nondetArea)) && 1 <= length2) && !(to == from)) && unknown-#length-unknown[from] + to <= from + unknown-#length-unknown[to]) && 1 <= unknown-#StackHeapBarrier-unknown) && from + 1 <= unknown-#length-unknown[from]) && 1 <= to) && 1 <= length1) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && length2 <= unknown-#length-unknown[nondetArea]) && 0 == nondetArea) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && 1 == \valid[from]) && 0 == nondetString) && length2 == unknown-#length-unknown[nondetString]) && 1 == \valid[to]) || (((((((((((((((1 <= unknown-#length-unknown[from] && 0 == to) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= length1) && 0 == unknown-#memory_int-unknown[from][from]) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && 1 <= unknown-#length-unknown[nondetArea]) && 1 == length2 + nondetString) && 1 <= unknown-#length-unknown[to]) && 0 == from) && 0 == nondetArea) && 1 == \valid[from]) && 0 == nondetString) && length2 == unknown-#length-unknown[nondetString]) && 1 == \valid[to])) || (((((((((((((((((!(nondetString == nondetArea) && 1 <= length2) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && 0 == to) && !(to == from)) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= length1) && 1 == \valid[nondetString]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[from] && 1 <= ULTIMATE.start_main_~length2~0) && from <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[from][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset + -1])) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && length2 <= unknown-#length-unknown[nondetArea]) && 0 == from) && 0 == nondetArea) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && 1 == \valid[from]) && 0 == nondetString) && 1 == \valid[to]) && length2 == unknown-#length-unknown[nondetString]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.9s, OverallIterations: 18, TraceHistogramMax: 3, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 65 SDtfs, 420 SDslu, 248 SDs, 0 SdLazy, 629 SolverSat, 149 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 28 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 294 HoareAnnotationTreeSize, 1 FomulaSimplifications, 143 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 375 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 203 ConstructedInterpolants, 7 QuantifiedInterpolants, 17869 SizeOfPredicates, 50 NumberOfNonLiveVariables, 550 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 11/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:07:34.944 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_NmctAE/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:07:52.172 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check