java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:16:45,385 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:16:45,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:16:45,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:16:45,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:16:45,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:16:45,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:16:45,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:16:45,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:16:45,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:16:45,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:16:45,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:16:45,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:16:45,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:16:45,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:16:45,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:16:45,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:16:45,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:16:45,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:16:45,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:16:45,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:16:45,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:16:45,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:16:45,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:16:45,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:16:45,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:16:45,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:16:45,420 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:16:45,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:16:45,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:16:45,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:16:45,421 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:16:45,430 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:16:45,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:16:45,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:16:45,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:16:45,432 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:16:45,432 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:16:45,432 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:16:45,432 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:16:45,432 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:16:45,432 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:16:45,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:16:45,433 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:16:45,433 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:16:45,433 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:16:45,433 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:16:45,433 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:16:45,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:16:45,434 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:16:45,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:16:45,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:16:45,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:16:45,434 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:16:45,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:16:45,434 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:16:45,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:16:45,472 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:16:45,475 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:16:45,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:16:45,477 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:16:45,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i [2018-02-04 17:16:45,597 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:16:45,598 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:16:45,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:16:45,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:16:45,602 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:16:45,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ec44b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45, skipping insertion in model container [2018-02-04 17:16:45,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,613 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:16:45,639 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:16:45,723 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:16:45,737 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:16:45,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45 WrapperNode [2018-02-04 17:16:45,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:16:45,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:16:45,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:16:45,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:16:45,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (1/1) ... [2018-02-04 17:16:45,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:16:45,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:16:45,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:16:45,775 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:16:45,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:16:45,815 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:16:45,815 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:16:45,816 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-04 17:16:45,816 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:16:45,816 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:16:45,816 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:16:45,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:16:45,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:16:45,816 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:16:45,816 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:16:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:16:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:16:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-04 17:16:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:16:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:16:45,817 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:16:46,051 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:16:46,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:16:46 BoogieIcfgContainer [2018-02-04 17:16:46,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:16:46,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:16:46,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:16:46,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:16:46,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:16:45" (1/3) ... [2018-02-04 17:16:46,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f38521e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:16:46, skipping insertion in model container [2018-02-04 17:16:46,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:45" (2/3) ... [2018-02-04 17:16:46,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f38521e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:16:46, skipping insertion in model container [2018-02-04 17:16:46,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:16:46" (3/3) ... [2018-02-04 17:16:46,056 INFO L107 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-02-04 17:16:46,062 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:16:46,067 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-02-04 17:16:46,099 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:16:46,099 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:16:46,099 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:16:46,099 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:16:46,099 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:16:46,099 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:16:46,099 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:16:46,100 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:16:46,100 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:16:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-02-04 17:16:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:16:46,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:46,120 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:46,121 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash -40654889, now seen corresponding path program 1 times [2018-02-04 17:16:46,126 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:46,127 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:46,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:46,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:46,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:46,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:46,245 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:16:46,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:46,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:46,247 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:46,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:46,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-02-04 17:16:46,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:46,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:46,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:16:46,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:46,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:46,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 17:16:46,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:46,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:16:46,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:16:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:46,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:46,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:16:46,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:16:46,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:16:46,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:16:46,469 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 5 states. [2018-02-04 17:16:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:46,593 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-04 17:16:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:16:46,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 17:16:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:46,602 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:16:46,602 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 17:16:46,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:16:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 17:16:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 17:16:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:16:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 17:16:46,638 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2018-02-04 17:16:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:46,639 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 17:16:46,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:16:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 17:16:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:16:46,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:46,640 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:46,640 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:46,640 INFO L82 PathProgramCache]: Analyzing trace with hash -40654888, now seen corresponding path program 1 times [2018-02-04 17:16:46,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:46,640 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:46,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:46,642 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:46,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:46,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:46,664 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:16:46,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:46,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:46,666 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:46,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:46,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-04 17:16:46,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:46,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:46,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:16:46,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2018-02-04 17:16:46,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:46,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:16:46,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-02-04 17:16:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:46,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:46,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:16:46,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:16:46,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:16:46,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:16:46,784 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 6 states. [2018-02-04 17:16:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:46,914 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-02-04 17:16:46,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:16:46,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 17:16:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:46,915 INFO L225 Difference]: With dead ends: 64 [2018-02-04 17:16:46,916 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 17:16:46,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:16:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 17:16:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 17:16:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 17:16:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 17:16:46,921 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2018-02-04 17:16:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:46,921 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 17:16:46,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:16:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 17:16:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:16:46,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:46,922 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:46,922 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:46,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301570, now seen corresponding path program 1 times [2018-02-04 17:16:46,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:46,923 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:46,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:46,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:46,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:46,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:46,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:46,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:16:46,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:16:46,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:16:46,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:16:46,963 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 4 states. [2018-02-04 17:16:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:47,001 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-04 17:16:47,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:16:47,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:16:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:47,002 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:16:47,002 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 17:16:47,002 INFO L554 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 [2018-02-04 17:16:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 17:16:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 17:16:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 17:16:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 17:16:47,007 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2018-02-04 17:16:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:47,007 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 17:16:47,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:16:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 17:16:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:16:47,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:47,008 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:47,008 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301569, now seen corresponding path program 1 times [2018-02-04 17:16:47,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:47,008 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:47,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,009 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:47,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:47,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:47,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:16:47,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:16:47,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:16:47,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:16:47,118 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 8 states. [2018-02-04 17:16:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:47,290 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-02-04 17:16:47,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:16:47,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 17:16:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:47,291 INFO L225 Difference]: With dead ends: 76 [2018-02-04 17:16:47,291 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 17:16:47,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:16:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 17:16:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-02-04 17:16:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 17:16:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-02-04 17:16:47,294 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 16 [2018-02-04 17:16:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:47,294 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-02-04 17:16:47,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:16:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-02-04 17:16:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:16:47,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:47,295 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:47,295 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1752664061, now seen corresponding path program 1 times [2018-02-04 17:16:47,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:47,295 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:47,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,296 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:47,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:47,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:47,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:16:47,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:16:47,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:16:47,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:16:47,340 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 5 states. [2018-02-04 17:16:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:47,384 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-04 17:16:47,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:16:47,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 17:16:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:47,387 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:16:47,387 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:16:47,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:16:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:16:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-02-04 17:16:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 17:16:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-02-04 17:16:47,392 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 20 [2018-02-04 17:16:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:47,392 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-02-04 17:16:47,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:16:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-02-04 17:16:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:16:47,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:47,393 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:47,393 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash -692554244, now seen corresponding path program 1 times [2018-02-04 17:16:47,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:47,393 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:47,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:47,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:47,403 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:16:47,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:47,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:47,404 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:47,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:47,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-02-04 17:16:47,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:47,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:47,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:16:47,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:47,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:47,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 17:16:47,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:47,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:47,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 17:16:47,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:16:47,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 17:16:47,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:47,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:16:47,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-02-04 17:16:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:47,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:47,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:16:47,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:16:47,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:16:47,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:16:47,511 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 7 states. [2018-02-04 17:16:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:47,595 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-02-04 17:16:47,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:16:47,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 17:16:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:47,596 INFO L225 Difference]: With dead ends: 66 [2018-02-04 17:16:47,596 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 17:16:47,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:16:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 17:16:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 17:16:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 17:16:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-04 17:16:47,600 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 22 [2018-02-04 17:16:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:47,600 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-04 17:16:47,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:16:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-04 17:16:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:16:47,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:47,601 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:47,601 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1804279880, now seen corresponding path program 1 times [2018-02-04 17:16:47,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:47,602 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:47,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,603 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:47,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:47,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:47,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:47,648 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:47,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:47,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:16:47,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 17:16:47,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:16:47,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:16:47,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:16:47,678 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 8 states. [2018-02-04 17:16:47,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:47,748 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2018-02-04 17:16:47,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:16:47,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 17:16:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:47,749 INFO L225 Difference]: With dead ends: 141 [2018-02-04 17:16:47,749 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 17:16:47,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:16:47,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 17:16:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2018-02-04 17:16:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 17:16:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-02-04 17:16:47,754 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 25 [2018-02-04 17:16:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:47,755 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-02-04 17:16:47,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:16:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-02-04 17:16:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:16:47,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:47,755 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:47,755 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash -186387055, now seen corresponding path program 1 times [2018-02-04 17:16:47,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:47,755 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:47,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:47,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:47,763 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:16:47,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:47,763 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:47,763 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:47,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:47,815 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= 0 c_lis_~prev~0.base)) (exists ((lis_~best~0.base Int)) (let ((.cse0 (store |c_old(#valid)| lis_~best~0.base 1))) (and (= (select .cse0 c_lis_~prev~0.base) 0) (not (= 0 lis_~best~0.base)) (= |c_#valid| (store (store .cse0 c_lis_~prev~0.base 1) lis_~best~0.base 0)) (= 0 (select |c_old(#valid)| lis_~best~0.base)))))) is different from true [2018-02-04 17:16:47,819 WARN L1033 $PredicateComparison]: unable to prove that (exists ((lis_~best~0.base Int) (lis_~prev~0.base Int)) (let ((.cse0 (store |c_old(#valid)| lis_~best~0.base 1))) (and (= (select .cse0 lis_~prev~0.base) 0) (not (= 0 lis_~prev~0.base)) (not (= 0 lis_~best~0.base)) (= |c_#valid| (store (store (store .cse0 lis_~prev~0.base 1) lis_~best~0.base 0) lis_~prev~0.base 0)) (= 0 (select |c_old(#valid)| lis_~best~0.base))))) is different from true [2018-02-04 17:16:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:47,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:47,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:16:47,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:16:47,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:16:47,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=33, Unknown=2, NotChecked=22, Total=72 [2018-02-04 17:16:47,827 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 9 states. [2018-02-04 17:16:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:47,902 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-02-04 17:16:47,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:16:47,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 17:16:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:47,903 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:16:47,903 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 17:16:47,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=55, Unknown=2, NotChecked=30, Total=110 [2018-02-04 17:16:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 17:16:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-04 17:16:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:16:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 17:16:47,906 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 27 [2018-02-04 17:16:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:47,907 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 17:16:47,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:16:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 17:16:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:16:47,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:47,907 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:47,907 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -324019421, now seen corresponding path program 2 times [2018-02-04 17:16:47,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:47,907 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:47,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,908 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:47,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:16:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:16:47,946 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 17:16:47,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:16:47 BoogieIcfgContainer [2018-02-04 17:16:47,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:16:47,977 INFO L168 Benchmark]: Toolchain (without parser) took 2379.18 ms. Allocated memory was 400.6 MB in the beginning and 627.0 MB in the end (delta: 226.5 MB). Free memory was 354.6 MB in the beginning and 498.2 MB in the end (delta: -143.6 MB). Peak memory consumption was 82.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:47,978 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 400.6 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:16:47,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.73 ms. Allocated memory is still 400.6 MB. Free memory was 354.6 MB in the beginning and 344.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:47,978 INFO L168 Benchmark]: Boogie Preprocessor took 29.99 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:47,978 INFO L168 Benchmark]: RCFGBuilder took 277.19 ms. Allocated memory is still 400.6 MB. Free memory was 342.7 MB in the beginning and 316.2 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:47,978 INFO L168 Benchmark]: TraceAbstraction took 1923.84 ms. Allocated memory was 400.6 MB in the beginning and 627.0 MB in the end (delta: 226.5 MB). Free memory was 316.2 MB in the beginning and 498.2 MB in the end (delta: -182.0 MB). Peak memory consumption was 44.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:47,979 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 400.6 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.73 ms. Allocated memory is still 400.6 MB. Free memory was 354.6 MB in the beginning and 344.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.99 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 277.19 ms. Allocated memory is still 400.6 MB. Free memory was 342.7 MB in the beginning and 316.2 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1923.84 ms. Allocated memory was 400.6 MB in the beginning and 627.0 MB in the end (delta: 226.5 MB). Free memory was 316.2 MB in the beginning and 498.2 MB in the end (delta: -182.0 MB). Peak memory consumption was 44.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) VAL [\old(N)=2, a={10:-5}] [L542] int *best, *prev, i, j, max = 0; VAL [\old(N)=2, a={10:-5}, a={10:-5}, max=0, N=2] [L543] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L543] best = (int*) malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L544] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2] [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L546] FCALL prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=2, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=2, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L547] i = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L547] COND TRUE i < N [L548] j = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L548] COND TRUE j < i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] [L549] FCALL a[i] VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={12:0}, i=1, j=0, malloc(sizeof(int) * N)={13:0}, malloc(sizeof(int) * N)={12:0}, max=0, N=2, prev={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 27 error locations. UNSAFE Result, 1.8s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 375 SDtfs, 1101 SDslu, 590 SDs, 0 SdLazy, 559 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 92 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 172 ConstructedInterpolants, 12 QuantifiedInterpolants, 26885 SizeOfPredicates, 16 NumberOfNonLiveVariables, 453 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-16-47-985.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-16-47-985.csv Received shutdown request...