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/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:58:52,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:58:52,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:58:52,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:58:52,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:58:52,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:58:52,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:58:52,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:58:52,496 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:58:52,497 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:58:52,498 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:58:52,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:58:52,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:58:52,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:58:52,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:58:52,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:58:52,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:58:52,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:58:52,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:58:52,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:58:52,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:58:52,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:58:52,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:58:52,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:58:52,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:58:52,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:58:52,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:58:52,516 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:58:52,516 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:58:52,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:58:52,517 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:58:52,517 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:58:52,527 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:58:52,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:58:52,528 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:58:52,528 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:58:52,528 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:58:52,528 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:58:52,529 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:58:52,529 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:58:52,529 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:58:52,530 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:58:52,530 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:58:52,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:58:52,530 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:58:52,530 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:58:52,530 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:58:52,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:58:52,531 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:58:52,531 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:58:52,531 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:58:52,531 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:58:52,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:58:52,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:58:52,532 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:58:52,532 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:58:52,532 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:58:52,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:58:52,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:58:52,533 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:58:52,533 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:58:52,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:58:52,533 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:58:52,534 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:58:52,534 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:58:52,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:58:52,534 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:58:52,535 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:58:52,535 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:58:52,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:58:52,575 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:58:52,579 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:58:52,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:58:52,581 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:58:52,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-01-23 14:58:52,738 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:58:52,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:58:52,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:58:52,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:58:52,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:58:52,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@860cd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52, skipping insertion in model container [2018-01-23 14:58:52,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,769 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:58:52,811 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:58:52,924 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:58:52,945 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:58:52,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52 WrapperNode [2018-01-23 14:58:52,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:58:52,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:58:52,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:58:52,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:58:52,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (1/1) ... [2018-01-23 14:58:52,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:58:52,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:58:52,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:58:52,993 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:58:52,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (1/1) ... No working directory specified, using /storage/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-01-23 14:58:53,036 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:58:53,037 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:58:53,037 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:58:53,037 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:58:53,037 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:58:53,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:58:53,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:58:53,037 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:58:53,037 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:58:53,038 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:58:53,038 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:58:53,038 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:58:53,038 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:58:53,038 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:58:53,038 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:58:53,476 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:58:53,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:58:53 BoogieIcfgContainer [2018-01-23 14:58:53,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:58:53,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:58:53,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:58:53,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:58:53,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:58:52" (1/3) ... [2018-01-23 14:58:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a74436a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:58:53, skipping insertion in model container [2018-01-23 14:58:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:58:52" (2/3) ... [2018-01-23 14:58:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a74436a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:58:53, skipping insertion in model container [2018-01-23 14:58:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:58:53" (3/3) ... [2018-01-23 14:58:53,483 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-01-23 14:58:53,489 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:58:53,494 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:58:53,530 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:58:53,530 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:58:53,530 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:58:53,531 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:58:53,531 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:58:53,531 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:58:53,531 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:58:53,531 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:58:53,532 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:58:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-23 14:58:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:58:53,559 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:53,560 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:58:53,560 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:58:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash 400739, now seen corresponding path program 1 times [2018-01-23 14:58:53,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:53,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:53,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:53,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:53,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:58:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:58:53,653 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:58:53,659 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:58:53,667 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:58:53,667 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:58:53,667 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:58:53,667 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:58:53,667 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:58:53,667 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:58:53,668 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:58:53,668 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:58:53,668 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:58:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-23 14:58:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:58:53,674 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:53,674 INFO L322 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] [2018-01-23 14:58:53,675 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:58:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -63616992, now seen corresponding path program 1 times [2018-01-23 14:58:53,675 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:53,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:53,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:53,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:53,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:53,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:53,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:53,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:58:53,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:58:53,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:58:53,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:58:53,834 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-01-23 14:58:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:53,866 INFO L93 Difference]: Finished difference Result 243 states and 349 transitions. [2018-01-23 14:58:53,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:58:53,867 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-23 14:58:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:53,877 INFO L225 Difference]: With dead ends: 243 [2018-01-23 14:58:53,878 INFO L226 Difference]: Without dead ends: 123 [2018-01-23 14:58:53,881 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:58:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-23 14:58:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-23 14:58:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-23 14:58:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-01-23 14:58:53,919 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 23 [2018-01-23 14:58:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:53,919 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-01-23 14:58:53,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:58:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-01-23 14:58:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-23 14:58:53,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:53,921 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:58:53,921 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:58:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash -980023246, now seen corresponding path program 1 times [2018-01-23 14:58:53,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:53,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:53,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:53,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:53,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:53,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:54,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:54,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:58:54,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:58:54,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:58:54,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:58:54,085 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 5 states. [2018-01-23 14:58:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:54,338 INFO L93 Difference]: Finished difference Result 289 states and 315 transitions. [2018-01-23 14:58:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:58:54,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-23 14:58:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:54,391 INFO L225 Difference]: With dead ends: 289 [2018-01-23 14:58:54,391 INFO L226 Difference]: Without dead ends: 194 [2018-01-23 14:58:54,392 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:58:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-23 14:58:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 127. [2018-01-23 14:58:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-23 14:58:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-01-23 14:58:54,406 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 36 [2018-01-23 14:58:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:54,406 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-01-23 14:58:54,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:58:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-01-23 14:58:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-23 14:58:54,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:54,408 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:58:54,408 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:58:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash -465624459, now seen corresponding path program 1 times [2018-01-23 14:58:54,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:54,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:54,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:54,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:54,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:54,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:54,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:58:54,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:58:54,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:58:54,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:58:54,485 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 5 states. [2018-01-23 14:58:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:54,600 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2018-01-23 14:58:54,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:58:54,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-23 14:58:54,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:54,602 INFO L225 Difference]: With dead ends: 212 [2018-01-23 14:58:54,602 INFO L226 Difference]: Without dead ends: 185 [2018-01-23 14:58:54,603 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:58:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-23 14:58:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2018-01-23 14:58:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-23 14:58:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-01-23 14:58:54,615 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 38 [2018-01-23 14:58:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:54,615 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-01-23 14:58:54,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:58:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-01-23 14:58:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:58:54,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:54,618 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 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, 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-01-23 14:58:54,618 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:58:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 700231337, now seen corresponding path program 1 times [2018-01-23 14:58:54,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:54,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:54,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:54,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:58:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:58:54,675 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:58:54,686 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:58:54,696 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:58:54,696 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:58:54,714 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:58:54,714 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:58:54,714 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:58:54,714 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:58:54,714 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:58:54,715 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:58:54,715 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:58:54,715 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:58:54,715 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:58:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-23 14:58:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-23 14:58:54,718 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:54,718 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:58:54,718 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1135260480, now seen corresponding path program 1 times [2018-01-23 14:58:54,718 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:54,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:54,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:54,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:54,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:54,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:54,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:58:54,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:58:54,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:58:54,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:58:54,734 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-01-23 14:58:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:54,741 INFO L93 Difference]: Finished difference Result 243 states and 349 transitions. [2018-01-23 14:58:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:58:54,741 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-23 14:58:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:54,743 INFO L225 Difference]: With dead ends: 243 [2018-01-23 14:58:54,743 INFO L226 Difference]: Without dead ends: 121 [2018-01-23 14:58:54,744 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:58:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-23 14:58:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-23 14:58:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-23 14:58:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-01-23 14:58:54,752 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 21 [2018-01-23 14:58:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:54,753 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-01-23 14:58:54,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:58:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-01-23 14:58:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:58:54,754 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:54,754 INFO L322 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:58:54,754 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1152051538, now seen corresponding path program 1 times [2018-01-23 14:58:54,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:54,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:54,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:54,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:54,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:54,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:54,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:58:54,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:58:54,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:58:54,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:58:54,836 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 5 states. [2018-01-23 14:58:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:54,956 INFO L93 Difference]: Finished difference Result 285 states and 310 transitions. [2018-01-23 14:58:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:58:54,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-23 14:58:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:54,958 INFO L225 Difference]: With dead ends: 285 [2018-01-23 14:58:54,958 INFO L226 Difference]: Without dead ends: 192 [2018-01-23 14:58:54,959 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:58:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-23 14:58:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 125. [2018-01-23 14:58:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-23 14:58:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-01-23 14:58:54,969 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 34 [2018-01-23 14:58:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:54,969 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-01-23 14:58:54,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:58:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-01-23 14:58:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-23 14:58:54,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:54,972 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:58:54,973 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:54,973 INFO L82 PathProgramCache]: Analyzing trace with hash -934561707, now seen corresponding path program 1 times [2018-01-23 14:58:54,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:54,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:54,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:54,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:54,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:55,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:55,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:58:55,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:58:55,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:58:55,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:58:55,031 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 5 states. [2018-01-23 14:58:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:55,151 INFO L93 Difference]: Finished difference Result 208 states and 226 transitions. [2018-01-23 14:58:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:58:55,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-23 14:58:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:55,155 INFO L225 Difference]: With dead ends: 208 [2018-01-23 14:58:55,155 INFO L226 Difference]: Without dead ends: 183 [2018-01-23 14:58:55,156 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:58:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-23 14:58:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 129. [2018-01-23 14:58:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-23 14:58:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-01-23 14:58:55,164 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 36 [2018-01-23 14:58:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:55,165 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-01-23 14:58:55,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:58:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-01-23 14:58:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:58:55,167 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:55,167 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 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, 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-01-23 14:58:55,168 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1469660791, now seen corresponding path program 1 times [2018-01-23 14:58:55,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:55,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:55,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:55,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:55,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:55,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:58:55,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:58:55,355 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:58:55,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:55,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:58:55,514 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (and (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store |c_old(#valid)| main_~list~5.base 0)) (not (= 0 main_~list~5.base)))) is different from true [2018-01-23 14:58:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-23 14:58:55,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:58:55,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-01-23 14:58:55,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:58:55,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:58:55,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-01-23 14:58:55,584 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 9 states. [2018-01-23 14:58:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:55,903 INFO L93 Difference]: Finished difference Result 216 states and 233 transitions. [2018-01-23 14:58:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:58:55,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-01-23 14:58:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:55,906 INFO L225 Difference]: With dead ends: 216 [2018-01-23 14:58:55,906 INFO L226 Difference]: Without dead ends: 213 [2018-01-23 14:58:55,906 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=114, Unknown=1, NotChecked=22, Total=182 [2018-01-23 14:58:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-23 14:58:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 180. [2018-01-23 14:58:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-23 14:58:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2018-01-23 14:58:55,917 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 56 [2018-01-23 14:58:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:55,918 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2018-01-23 14:58:55,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:58:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2018-01-23 14:58:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-23 14:58:55,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:55,920 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 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, 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, 1, 1, 1] [2018-01-23 14:58:55,920 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1423084331, now seen corresponding path program 1 times [2018-01-23 14:58:55,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:55,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:55,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:55,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:55,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:55,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:58:56,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:56,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:58:56,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:58:56,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:58:56,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:58:56,161 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand 7 states. [2018-01-23 14:58:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:56,693 INFO L93 Difference]: Finished difference Result 277 states and 301 transitions. [2018-01-23 14:58:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:58:56,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-01-23 14:58:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:56,694 INFO L225 Difference]: With dead ends: 277 [2018-01-23 14:58:56,694 INFO L226 Difference]: Without dead ends: 252 [2018-01-23 14:58:56,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:58:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-23 14:58:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 225. [2018-01-23 14:58:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-23 14:58:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 246 transitions. [2018-01-23 14:58:56,704 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 246 transitions. Word has length 61 [2018-01-23 14:58:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:56,704 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 246 transitions. [2018-01-23 14:58:56,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:58:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 246 transitions. [2018-01-23 14:58:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-23 14:58:56,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:56,705 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 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, 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, 1, 1, 1, 1, 1] [2018-01-23 14:58:56,705 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash -299432594, now seen corresponding path program 1 times [2018-01-23 14:58:56,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:56,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:56,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:56,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:56,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:56,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:58:56,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:56,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-23 14:58:56,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:58:56,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:58:56,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:58:56,953 INFO L87 Difference]: Start difference. First operand 225 states and 246 transitions. Second operand 11 states. [2018-01-23 14:58:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:57,409 INFO L93 Difference]: Finished difference Result 450 states and 488 transitions. [2018-01-23 14:58:57,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:58:57,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-01-23 14:58:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:57,411 INFO L225 Difference]: With dead ends: 450 [2018-01-23 14:58:57,411 INFO L226 Difference]: Without dead ends: 351 [2018-01-23 14:58:57,412 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:58:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-01-23 14:58:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 220. [2018-01-23 14:58:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-23 14:58:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-01-23 14:58:57,420 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 63 [2018-01-23 14:58:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:57,420 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-01-23 14:58:57,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:58:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-01-23 14:58:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-23 14:58:57,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:57,421 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:58:57,421 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1131620500, now seen corresponding path program 2 times [2018-01-23 14:58:57,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:57,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:57,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:57,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:57,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:57,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:57,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:58:57,606 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:58:57,612 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:58:57,629 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:58:57,641 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:58:57,643 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:58:57,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:58:57,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-01-23 14:58:57,718 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:58:57,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:57,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:57,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:57,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-23 14:58:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:57,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:58:57,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-23 14:58:57,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-23 14:58:57,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-23 14:58:57,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-23 14:58:57,794 INFO L87 Difference]: Start difference. First operand 220 states and 240 transitions. Second operand 17 states. [2018-01-23 14:58:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:58,100 INFO L93 Difference]: Finished difference Result 403 states and 442 transitions. [2018-01-23 14:58:58,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:58:58,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-01-23 14:58:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:58,102 INFO L225 Difference]: With dead ends: 403 [2018-01-23 14:58:58,102 INFO L226 Difference]: Without dead ends: 300 [2018-01-23 14:58:58,103 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:58:58,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-01-23 14:58:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 223. [2018-01-23 14:58:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-23 14:58:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 241 transitions. [2018-01-23 14:58:58,118 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 241 transitions. Word has length 65 [2018-01-23 14:58:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:58,119 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 241 transitions. [2018-01-23 14:58:58,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-23 14:58:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 241 transitions. [2018-01-23 14:58:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-23 14:58:58,120 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:58,120 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:58:58,120 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:58,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2083551600, now seen corresponding path program 1 times [2018-01-23 14:58:58,120 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:58,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:58,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:58,122 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:58:58,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:58,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:58:58,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:58:58,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:58:58,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:58:58,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:58:58,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:58:58,238 INFO L87 Difference]: Start difference. First operand 223 states and 241 transitions. Second operand 7 states. [2018-01-23 14:58:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:58:58,379 INFO L93 Difference]: Finished difference Result 294 states and 315 transitions. [2018-01-23 14:58:58,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:58:58,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-01-23 14:58:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:58:58,380 INFO L225 Difference]: With dead ends: 294 [2018-01-23 14:58:58,380 INFO L226 Difference]: Without dead ends: 233 [2018-01-23 14:58:58,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:58:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-23 14:58:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2018-01-23 14:58:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-23 14:58:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 247 transitions. [2018-01-23 14:58:58,391 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 247 transitions. Word has length 69 [2018-01-23 14:58:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:58:58,392 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 247 transitions. [2018-01-23 14:58:58,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:58:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 247 transitions. [2018-01-23 14:58:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-23 14:58:58,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:58:58,393 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:58:58,393 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:58:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1488132338, now seen corresponding path program 1 times [2018-01-23 14:58:58,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:58:58,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:58:58,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:58,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:58,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:58:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:58,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:58:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:58:58,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:58:58,946 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:58:58,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:58:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:58:58,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:58:59,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2018-01-23 14:58:59,055 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:58:59,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:58:59,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:59,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:58:59,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-01-23 14:58:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:58:59,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:58:59,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-01-23 14:58:59,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:58:59,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:58:59,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:58:59,122 INFO L87 Difference]: Start difference. First operand 229 states and 247 transitions. Second operand 20 states. [2018-01-23 14:59:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:59:00,493 INFO L93 Difference]: Finished difference Result 493 states and 531 transitions. [2018-01-23 14:59:00,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-23 14:59:00,494 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-01-23 14:59:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:59:00,496 INFO L225 Difference]: With dead ends: 493 [2018-01-23 14:59:00,496 INFO L226 Difference]: Without dead ends: 337 [2018-01-23 14:59:00,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=2554, Unknown=0, NotChecked=0, Total=2862 [2018-01-23 14:59:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-01-23 14:59:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 289. [2018-01-23 14:59:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-01-23 14:59:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 315 transitions. [2018-01-23 14:59:00,514 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 315 transitions. Word has length 74 [2018-01-23 14:59:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:59:00,515 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 315 transitions. [2018-01-23 14:59:00,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:59:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 315 transitions. [2018-01-23 14:59:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-23 14:59:00,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:59:00,516 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:59:00,516 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:59:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1328388303, now seen corresponding path program 1 times [2018-01-23 14:59:00,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:59:00,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:59:00,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:00,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:59:00,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:59:00,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:59:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:59:00,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:59:00,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:59:00,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:59:00,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:59:00,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:59:00,591 INFO L87 Difference]: Start difference. First operand 289 states and 315 transitions. Second operand 5 states. [2018-01-23 14:59:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:59:00,695 INFO L93 Difference]: Finished difference Result 530 states and 581 transitions. [2018-01-23 14:59:00,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:59:00,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-01-23 14:59:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:59:00,697 INFO L225 Difference]: With dead ends: 530 [2018-01-23 14:59:00,697 INFO L226 Difference]: Without dead ends: 305 [2018-01-23 14:59:00,698 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:59:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-23 14:59:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 293. [2018-01-23 14:59:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-23 14:59:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 318 transitions. [2018-01-23 14:59:00,714 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 318 transitions. Word has length 79 [2018-01-23 14:59:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:59:00,714 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 318 transitions. [2018-01-23 14:59:00,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:59:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 318 transitions. [2018-01-23 14:59:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-23 14:59:00,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:59:00,716 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:59:00,716 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:59:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 764698094, now seen corresponding path program 1 times [2018-01-23 14:59:00,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:59:00,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:59:00,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:00,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:59:00,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:59:00,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:59:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:59:00,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:59:00,895 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:59:00,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:59:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:59:00,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:59:00,943 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-01-23 14:59:00,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:00,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:00,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:59:00,975 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:00,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:00,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-01-23 14:59:00,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:00,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:00,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-23 14:59:01,000 INFO L477 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 11 treesize of output 8 [2018-01-23 14:59:01,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-23 14:59:01,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-23 14:59:01,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:01,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-01-23 14:59:01,103 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-01-23 14:59:01,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-23 14:59:01,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-01-23 14:59:01,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:01,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 31 [2018-01-23 14:59:01,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,214 INFO L267 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. [2018-01-23 14:59:01,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-01-23 14:59:01,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-01-23 14:59:01,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-23 14:59:01,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:01,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-23 14:59:01,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:01,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:4 [2018-01-23 14:59:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:59:01,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:59:01,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-23 14:59:01,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-23 14:59:01,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-23 14:59:01,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-01-23 14:59:01,382 INFO L87 Difference]: Start difference. First operand 293 states and 318 transitions. Second operand 21 states. [2018-01-23 14:59:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:59:02,284 INFO L93 Difference]: Finished difference Result 603 states and 656 transitions. [2018-01-23 14:59:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-23 14:59:02,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-01-23 14:59:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:59:02,287 INFO L225 Difference]: With dead ends: 603 [2018-01-23 14:59:02,287 INFO L226 Difference]: Without dead ends: 571 [2018-01-23 14:59:02,288 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:59:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-01-23 14:59:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 444. [2018-01-23 14:59:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-01-23 14:59:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 484 transitions. [2018-01-23 14:59:02,312 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 484 transitions. Word has length 81 [2018-01-23 14:59:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:59:02,312 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 484 transitions. [2018-01-23 14:59:02,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-23 14:59:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 484 transitions. [2018-01-23 14:59:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-23 14:59:02,314 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:59:02,314 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 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-01-23 14:59:02,314 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:59:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash -917967199, now seen corresponding path program 1 times [2018-01-23 14:59:02,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:59:02,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:59:02,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:02,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:59:02,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:59:02,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:59:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:59:02,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:59:02,673 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:59:02,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:59:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:59:02,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:59:02,705 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-01-23 14:59:02,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:59:02,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,718 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 17 treesize of output 21 [2018-01-23 14:59:02,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-23 14:59:02,732 INFO L477 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 11 treesize of output 8 [2018-01-23 14:59:02,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-23 14:59:02,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-23 14:59:02,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-23 14:59:02,815 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-01-23 14:59:02,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-23 14:59:02,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:59:02,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-01-23 14:59:02,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-23 14:59:02,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-23 14:59:02,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2018-01-23 14:59:02,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:02,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 86 [2018-01-23 14:59:02,975 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 14 treesize of output 13 [2018-01-23 14:59:02,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:02,994 INFO L267 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. [2018-01-23 14:59:02,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:64 [2018-01-23 14:59:03,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 79 [2018-01-23 14:59:03,070 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 26 treesize of output 37 [2018-01-23 14:59:03,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:03,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:03,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:59:03,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:96 [2018-01-23 14:59:07,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 60 [2018-01-23 14:59:07,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-23 14:59:07,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:07,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-01-23 14:59:07,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:07,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:07,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-01-23 14:59:07,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:07,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:07,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:07,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:4 [2018-01-23 14:59:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:59:07,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:59:07,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2018-01-23 14:59:07,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-23 14:59:07,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-23 14:59:07,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=758, Unknown=2, NotChecked=0, Total=870 [2018-01-23 14:59:07,327 INFO L87 Difference]: Start difference. First operand 444 states and 484 transitions. Second operand 30 states. [2018-01-23 14:59:23,944 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-23 14:59:31,998 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-23 14:59:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:59:51,170 INFO L93 Difference]: Finished difference Result 785 states and 857 transitions. [2018-01-23 14:59:51,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-23 14:59:51,170 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2018-01-23 14:59:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:59:51,173 INFO L225 Difference]: With dead ends: 785 [2018-01-23 14:59:51,173 INFO L226 Difference]: Without dead ends: 753 [2018-01-23 14:59:51,174 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=557, Invalid=3085, Unknown=18, NotChecked=0, Total=3660 [2018-01-23 14:59:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-01-23 14:59:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 456. [2018-01-23 14:59:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-01-23 14:59:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 497 transitions. [2018-01-23 14:59:51,191 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 497 transitions. Word has length 86 [2018-01-23 14:59:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:59:51,191 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 497 transitions. [2018-01-23 14:59:51,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-23 14:59:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 497 transitions. [2018-01-23 14:59:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-23 14:59:51,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:59:51,192 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1] [2018-01-23 14:59:51,192 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:59:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1519296570, now seen corresponding path program 2 times [2018-01-23 14:59:51,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:59:51,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:59:51,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:51,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:59:51,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:59:51,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:59:51,717 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 29 DAG size of output 17 [2018-01-23 14:59:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:59:52,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:59:52,057 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:59:52,062 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:59:52,074 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:59:52,086 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:59:52,089 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:59:52,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:59:52,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 44 treesize of output 41 [2018-01-23 14:59:52,221 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-01-23 14:59:52,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 44 treesize of output 41 [2018-01-23 14:59:52,234 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-01-23 14:59:52,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:59:52,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:83 [2018-01-23 14:59:52,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-01-23 14:59:52,399 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-01-23 14:59:52,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-01-23 14:59:52,433 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-01-23 14:59:52,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:59:52,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2018-01-23 14:59:52,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-01-23 14:59:52,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 31 [2018-01-23 14:59:52,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-01-23 14:59:52,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 31 [2018-01-23 14:59:52,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:59:52,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:135, output treesize:119 [2018-01-23 14:59:52,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-01-23 14:59:52,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 22 [2018-01-23 14:59:52,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-23 14:59:52,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:52,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:52,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-01-23 14:59:52,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-01-23 14:59:52,938 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:53,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:59:53,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-23 14:59:53,013 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:59:53,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:59:53,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:59:53,126 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:133, output treesize:55 [2018-01-23 14:59:53,306 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~list~5.base 1))) (and (= (select .cse0 c_main_~end~5.base) 0) (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store (store .cse0 c_main_~end~5.base 1) main_~list~5.base 0)) (not (= 0 main_~list~5.base))))) is different from true [2018-01-23 14:59:53,309 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store .cse0 c_main_~list~5.base 1) v_subst_1 0)) (= (select .cse0 c_main_~list~5.base) 0)))) is different from true [2018-01-23 14:59:53,643 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= c_main_~list~5.offset 0)) (exists ((v_prenex_8 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_8 1))) (and (not (= 0 v_prenex_8)) (= 0 (select |c_old(#valid)| v_prenex_8)) (= (select .cse0 c_main_~list~5.base) 0) (= |c_#valid| (store (store .cse0 c_main_~list~5.base 1) v_prenex_8 0)))))) (and (exists ((v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store .cse1 c_main_~list~5.base 1) v_subst_1 0)) (= (select .cse1 c_main_~list~5.base) 0)))) (not (= 0 c_main_~list~5.base)))) is different from true [2018-01-23 14:59:53,648 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store (store .cse0 main_~list~5.base 1) v_subst_1 0) main_~list~5.base 0)) (= (select .cse0 main_~list~5.base) 0) (not (= 0 main_~list~5.base))))) is different from true [2018-01-23 14:59:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 9 not checked. [2018-01-23 14:59:53,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:59:53,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2018-01-23 14:59:53,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-23 14:59:53,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-23 14:59:53,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=822, Unknown=21, NotChecked=244, Total=1190 [2018-01-23 14:59:53,743 INFO L87 Difference]: Start difference. First operand 456 states and 497 transitions. Second operand 35 states. [2018-01-23 14:59:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:59:55,624 INFO L93 Difference]: Finished difference Result 546 states and 593 transitions. [2018-01-23 14:59:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-23 14:59:55,625 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 101 [2018-01-23 14:59:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:59:55,626 INFO L225 Difference]: With dead ends: 546 [2018-01-23 14:59:55,626 INFO L226 Difference]: Without dead ends: 543 [2018-01-23 14:59:55,627 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=257, Invalid=2089, Unknown=22, NotChecked=388, Total=2756 [2018-01-23 14:59:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-01-23 14:59:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 505. [2018-01-23 14:59:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-01-23 14:59:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 551 transitions. [2018-01-23 14:59:55,643 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 551 transitions. Word has length 101 [2018-01-23 14:59:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:59:55,644 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 551 transitions. [2018-01-23 14:59:55,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-23 14:59:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 551 transitions. [2018-01-23 14:59:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-23 14:59:55,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:59:55,645 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1] [2018-01-23 14:59:55,645 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:59:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1680009768, now seen corresponding path program 1 times [2018-01-23 14:59:55,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:59:55,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:59:55,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:55,646 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:59:55,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:59:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:59:55,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:59:56,252 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 27 DAG size of output 17 Received shutdown request... [2018-01-23 14:59:56,550 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:59:56,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:59:56 BoogieIcfgContainer [2018-01-23 14:59:56,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:59:56,553 INFO L168 Benchmark]: Toolchain (without parser) took 63814.30 ms. Allocated memory was 304.6 MB in the beginning and 644.3 MB in the end (delta: 339.7 MB). Free memory was 262.9 MB in the beginning and 398.8 MB in the end (delta: -135.9 MB). Peak memory consumption was 203.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:59:56,554 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:59:56,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.58 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 249.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:59:56,554 INFO L168 Benchmark]: Boogie Preprocessor took 36.91 ms. Allocated memory is still 304.6 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:59:56,554 INFO L168 Benchmark]: RCFGBuilder took 484.49 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 214.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:59:56,555 INFO L168 Benchmark]: TraceAbstraction took 63074.22 ms. Allocated memory was 304.6 MB in the beginning and 644.3 MB in the end (delta: 339.7 MB). Free memory was 214.2 MB in the beginning and 398.8 MB in the end (delta: -184.6 MB). Peak memory consumption was 155.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:59:56,556 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.11 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.58 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 249.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.91 ms. Allocated memory is still 304.6 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 484.49 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 214.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63074.22 ms. Allocated memory was 304.6 MB in the beginning and 644.3 MB in the end (delta: 339.7 MB). Free memory was 214.2 MB in the beginning and 398.8 MB in the end (delta: -184.6 MB). Peak memory consumption was 155.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 126 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={10:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] FCALL list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND TRUE __VERIFIER_nondet_int() [L993] FCALL list->inner = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR, FCALL end->inner VAL [end={10:0}, end->inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND FALSE !(((void*)0) != inner) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] COND FALSE !(!(len <= 1)) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] COND FALSE !(0) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1033] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1033] end = end->next [L1014] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1037] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1039] EXPR, FCALL list->inner VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L1039] end = list->inner [L1041] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1049] EXPR, FCALL list->next VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->next={0:0}, malloc(sizeof(SLL))={10:0}] [L1049] end = list->next [L1050] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1051] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1037] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1054] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 126 locations, 3 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 441 SDslu, 441 SDs, 0 SdLazy, 165 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=3, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 121 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 7469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 30. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 126 locations, 3 error locations. TIMEOUT Result, 61.8s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 50.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1816 SDtfs, 4864 SDslu, 12260 SDs, 0 SdLazy, 7148 SolverSat, 341 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 732 GetRequests, 432 SyntacticMatches, 19 SemanticMatches, 281 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 46.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=13, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 915 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1270 ConstructedInterpolants, 134 QuantifiedInterpolants, 2088053 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1209 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 69/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-59-56-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-59-56-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-59-56-564.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-59-56-564.csv Completed graceful shutdown