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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:38:37,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:38:37,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:38:37,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:38:37,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:38:37,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:38:37,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:38:37,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:38:37,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:38:37,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:38:37,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:38:37,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:38:37,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:38:37,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:38:37,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:38:37,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:38:37,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:38:37,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:38:37,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:38:37,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:38:37,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:38:37,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:38:37,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:38:37,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:38:37,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:38:37,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:38:37,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:38:37,619 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:38:37,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:38:37,620 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:38:37,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:38:37,621 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:38:37,631 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:38:37,631 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:38:37,632 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:38:37,632 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:38:37,632 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:38:37,632 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:38:37,633 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:38:37,633 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:38:37,633 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:38:37,634 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:38:37,634 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:38:37,634 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:38:37,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:38:37,634 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:38:37,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:38:37,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:38:37,635 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:38:37,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:38:37,635 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:38:37,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:38:37,636 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:38:37,636 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:38:37,636 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:38:37,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:38:37,637 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:38:37,637 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:38:37,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:38:37,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:38:37,637 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:38:37,638 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:38:37,638 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:38:37,638 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:38:37,638 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:38:37,638 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:38:37,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:38:37,639 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:38:37,639 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:38:37,640 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:38:37,640 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:38:37,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:38:37,690 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:38:37,694 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:38:37,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:38:37,696 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:38:37,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-21 00:38:37,867 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:38:37,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:38:37,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:38:37,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:38:37,881 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:38:37,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:38:37" (1/1) ... [2018-01-21 00:38:37,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43302af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:37, skipping insertion in model container [2018-01-21 00:38:37,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:38:37" (1/1) ... [2018-01-21 00:38:37,905 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:38:37,947 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:38:38,070 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:38:38,087 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:38:38,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38 WrapperNode [2018-01-21 00:38:38,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:38:38,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:38:38,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:38:38,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:38:38,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (1/1) ... [2018-01-21 00:38:38,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (1/1) ... [2018-01-21 00:38:38,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (1/1) ... [2018-01-21 00:38:38,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (1/1) ... [2018-01-21 00:38:38,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (1/1) ... [2018-01-21 00:38:38,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (1/1) ... [2018-01-21 00:38:38,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (1/1) ... [2018-01-21 00:38:38,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:38:38,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:38:38,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:38:38,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:38:38,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (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-21 00:38:38,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:38:38,186 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:38:38,186 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:38:38,186 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:38:38,186 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:38:38,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:38:38,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:38:38,186 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:38:38,186 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:38:38,187 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:38:38,187 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:38:38,187 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:38:38,187 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:38:38,187 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:38:38,527 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:38:38,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:38:38 BoogieIcfgContainer [2018-01-21 00:38:38,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:38:38,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:38:38,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:38:38,532 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:38:38,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:38:37" (1/3) ... [2018-01-21 00:38:38,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9e5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:38:38, skipping insertion in model container [2018-01-21 00:38:38,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:38:38" (2/3) ... [2018-01-21 00:38:38,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9e5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:38:38, skipping insertion in model container [2018-01-21 00:38:38,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:38:38" (3/3) ... [2018-01-21 00:38:38,536 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-21 00:38:38,546 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:38:38,554 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:38:38,600 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:38,600 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:38,600 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:38,600 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:38,600 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:38,600 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:38,601 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:38,601 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:38:38,602 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-21 00:38:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:38:38,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:38,625 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:38:38,625 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:38:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash 192202, now seen corresponding path program 1 times [2018-01-21 00:38:38,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:38,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:38,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:38,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:38,673 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:38,724 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:38:38,730 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:38,737 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:38,737 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:38,738 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:38,738 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:38,738 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:38,738 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:38,738 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:38,738 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:38:38,739 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-21 00:38:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 00:38:38,743 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:38,744 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:38,744 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:38,744 INFO L82 PathProgramCache]: Analyzing trace with hash -40797007, now seen corresponding path program 1 times [2018-01-21 00:38:38,744 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:38,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:38,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:38,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:38,746 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:38,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:38,805 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-21 00:38:38,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:38,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:38,807 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:38,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:38:38,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:38:38,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:38,908 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-21 00:38:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:38,934 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2018-01-21 00:38:38,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:38:38,935 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-21 00:38:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:38,947 INFO L225 Difference]: With dead ends: 146 [2018-01-21 00:38:38,947 INFO L226 Difference]: Without dead ends: 75 [2018-01-21 00:38:38,950 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-21 00:38:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-21 00:38:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-21 00:38:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-21 00:38:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-01-21 00:38:38,987 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 16 [2018-01-21 00:38:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:38,988 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-01-21 00:38:38,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:38:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-01-21 00:38:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:38:38,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:38,989 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:38,989 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:38,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1434130336, now seen corresponding path program 1 times [2018-01-21 00:38:38,989 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:38,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:38,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:38,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:38,991 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:39,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:39,077 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-21 00:38:39,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:39,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:38:39,077 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:39,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:38:39,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:38:39,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:38:39,080 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 4 states. [2018-01-21 00:38:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:39,144 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-01-21 00:38:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:38:39,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-21 00:38:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:39,149 INFO L225 Difference]: With dead ends: 101 [2018-01-21 00:38:39,149 INFO L226 Difference]: Without dead ends: 96 [2018-01-21 00:38:39,150 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-21 00:38:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-21 00:38:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-21 00:38:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2018-01-21 00:38:39,163 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 19 [2018-01-21 00:38:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:39,163 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2018-01-21 00:38:39,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:38:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2018-01-21 00:38:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:38:39,165 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:39,165 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:39,165 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash 327687223, now seen corresponding path program 1 times [2018-01-21 00:38:39,166 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:39,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:39,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,167 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:39,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:39,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:39,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:38:39,217 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:39,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:38:39,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:38:39,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:39,219 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 3 states. [2018-01-21 00:38:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:39,239 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2018-01-21 00:38:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:38:39,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-21 00:38:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:39,241 INFO L225 Difference]: With dead ends: 145 [2018-01-21 00:38:39,241 INFO L226 Difference]: Without dead ends: 98 [2018-01-21 00:38:39,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-21 00:38:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-21 00:38:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-21 00:38:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-01-21 00:38:39,252 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 28 [2018-01-21 00:38:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:39,253 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-01-21 00:38:39,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:38:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-01-21 00:38:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 00:38:39,255 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:39,255 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:39,255 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:38:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1119090828, now seen corresponding path program 1 times [2018-01-21 00:38:39,255 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:39,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:39,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,257 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:38:39,305 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:38:39,312 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:39,317 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:39,318 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:38:39,333 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:38:39,333 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:38:39,333 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:38:39,333 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:38:39,333 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:38:39,333 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:38:39,334 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:38:39,334 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:38:39,334 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:38:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-21 00:38:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 00:38:39,337 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:39,337 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:39,337 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:39,338 INFO L82 PathProgramCache]: Analyzing trace with hash -911773288, now seen corresponding path program 1 times [2018-01-21 00:38:39,338 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:39,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:39,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,339 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:39,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:39,356 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-21 00:38:39,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:39,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:38:39,357 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:39,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:38:39,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:38:39,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:38:39,358 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-21 00:38:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:39,365 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2018-01-21 00:38:39,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:38:39,365 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-21 00:38:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:39,366 INFO L225 Difference]: With dead ends: 146 [2018-01-21 00:38:39,366 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 00:38:39,367 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-21 00:38:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 00:38:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-21 00:38:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-21 00:38:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-01-21 00:38:39,373 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 14 [2018-01-21 00:38:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:39,374 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-01-21 00:38:39,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:38:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-01-21 00:38:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 00:38:39,375 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:39,375 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:39,375 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash 244317447, now seen corresponding path program 1 times [2018-01-21 00:38:39,376 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:39,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:39,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,377 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:39,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:39,423 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-21 00:38:39,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:39,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:38:39,423 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:39,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:38:39,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:38:39,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:38:39,424 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 4 states. [2018-01-21 00:38:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:39,455 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-01-21 00:38:39,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:38:39,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-21 00:38:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:39,457 INFO L225 Difference]: With dead ends: 97 [2018-01-21 00:38:39,457 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 00:38:39,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:38:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 00:38:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-21 00:38:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 00:38:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-01-21 00:38:39,462 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 17 [2018-01-21 00:38:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:39,463 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-01-21 00:38:39,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:38:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-01-21 00:38:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:38:39,464 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:39,464 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:39,464 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash -844350818, now seen corresponding path program 1 times [2018-01-21 00:38:39,464 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:39,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:39,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,466 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:39,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:39,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:39,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:38:39,495 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:39,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:38:39,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:38:39,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:39,496 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 3 states. [2018-01-21 00:38:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:39,509 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2018-01-21 00:38:39,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:38:39,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-21 00:38:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:39,510 INFO L225 Difference]: With dead ends: 141 [2018-01-21 00:38:39,511 INFO L226 Difference]: Without dead ends: 96 [2018-01-21 00:38:39,511 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-21 00:38:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-21 00:38:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-21 00:38:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2018-01-21 00:38:39,518 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 26 [2018-01-21 00:38:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:39,518 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2018-01-21 00:38:39,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:38:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2018-01-21 00:38:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:38:39,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:39,520 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:38:39,520 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 217829659, now seen corresponding path program 1 times [2018-01-21 00:38:39,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:39,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:39,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:39,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:39,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:39,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:39,664 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:39,665 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-21 00:38:39,667 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [14], [16], [19], [102], [106], [110], [112], [116], [118], [119], [124], [125], [126], [130], [160], [162], [166], [168], [169], [170], [171] [2018-01-21 00:38:39,729 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:38:39,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:38:39,947 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:38:39,948 INFO L268 AbstractInterpreter]: Visited 27 different actions 30 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-21 00:38:39,955 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:38:39,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:39,956 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 00:38:39,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:39,971 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:38:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:40,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:40,090 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int)) (and (not (= 0 main_~n~4.base)) (= |c_#valid| (store |c_old(#valid)| main_~n~4.base 0)) (= 0 (select |c_old(#valid)| main_~n~4.base)))) is different from true [2018-01-21 00:38:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-21 00:38:40,102 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:40,242 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_3| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_3|))) (= 0 |v_main_#t~malloc0.base_3|) (= (store |c_#valid| |v_main_#t~malloc0.base_3| 0) |c_old(#valid)|))) is different from false [2018-01-21 00:38:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:40,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:40,292 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:38:40,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:40,296 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:38:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:40,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:38:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:40,527 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:38:40,575 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_4| Int)) (or (= (store |c_#valid| |v_main_#t~malloc0.base_4| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc0.base_4|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_4|))))) is different from false [2018-01-21 00:38:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:40,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:38:40,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 8, 6] total 20 [2018-01-21 00:38:40,599 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:38:40,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 00:38:40,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 00:38:40,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=250, Unknown=7, NotChecked=102, Total=420 [2018-01-21 00:38:40,601 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 10 states. [2018-01-21 00:38:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:41,141 INFO L93 Difference]: Finished difference Result 306 states and 376 transitions. [2018-01-21 00:38:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 00:38:41,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-01-21 00:38:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:41,144 INFO L225 Difference]: With dead ends: 306 [2018-01-21 00:38:41,144 INFO L226 Difference]: Without dead ends: 250 [2018-01-21 00:38:41,146 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=528, Unknown=7, NotChecked=150, Total=812 [2018-01-21 00:38:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-21 00:38:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 146. [2018-01-21 00:38:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-21 00:38:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2018-01-21 00:38:41,160 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 28 [2018-01-21 00:38:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:41,161 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2018-01-21 00:38:41,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 00:38:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2018-01-21 00:38:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:38:41,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:41,163 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] [2018-01-21 00:38:41,163 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -753850202, now seen corresponding path program 1 times [2018-01-21 00:38:41,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:41,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:41,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:41,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:41,165 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:41,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-21 00:38:41,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:41,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:38:41,306 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:41,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:38:41,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:38:41,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:38:41,307 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 6 states. [2018-01-21 00:38:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:41,513 INFO L93 Difference]: Finished difference Result 285 states and 345 transitions. [2018-01-21 00:38:41,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:38:41,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-21 00:38:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:41,515 INFO L225 Difference]: With dead ends: 285 [2018-01-21 00:38:41,515 INFO L226 Difference]: Without dead ends: 238 [2018-01-21 00:38:41,516 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:38:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-21 00:38:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 172. [2018-01-21 00:38:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-21 00:38:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2018-01-21 00:38:41,527 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 37 [2018-01-21 00:38:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:41,527 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2018-01-21 00:38:41,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:38:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2018-01-21 00:38:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 00:38:41,529 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:41,529 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-21 00:38:41,529 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash 612657287, now seen corresponding path program 2 times [2018-01-21 00:38:41,529 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:41,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:41,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:41,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:41,530 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:41,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:41,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:41,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:38:41,575 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:41,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:38:41,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:38:41,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:41,576 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand 3 states. [2018-01-21 00:38:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:41,596 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2018-01-21 00:38:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:38:41,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-21 00:38:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:41,598 INFO L225 Difference]: With dead ends: 178 [2018-01-21 00:38:41,598 INFO L226 Difference]: Without dead ends: 150 [2018-01-21 00:38:41,598 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:38:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-21 00:38:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-21 00:38:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-21 00:38:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 177 transitions. [2018-01-21 00:38:41,611 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 177 transitions. Word has length 39 [2018-01-21 00:38:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:41,611 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 177 transitions. [2018-01-21 00:38:41,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:38:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 177 transitions. [2018-01-21 00:38:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 00:38:41,613 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:41,613 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-21 00:38:41,613 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash 352686601, now seen corresponding path program 1 times [2018-01-21 00:38:41,613 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:41,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:41,614 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 00:38:41,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:41,615 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:41,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:41,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:38:41,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:38:41,739 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:41,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:38:41,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:38:41,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:38:41,740 INFO L87 Difference]: Start difference. First operand 150 states and 177 transitions. Second operand 6 states. [2018-01-21 00:38:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:38:41,902 INFO L93 Difference]: Finished difference Result 215 states and 253 transitions. [2018-01-21 00:38:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 00:38:41,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-21 00:38:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:38:41,903 INFO L225 Difference]: With dead ends: 215 [2018-01-21 00:38:41,903 INFO L226 Difference]: Without dead ends: 161 [2018-01-21 00:38:41,904 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:38:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-21 00:38:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-01-21 00:38:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-21 00:38:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2018-01-21 00:38:41,917 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 39 [2018-01-21 00:38:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:38:41,918 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2018-01-21 00:38:41,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:38:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2018-01-21 00:38:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 00:38:41,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:38:41,920 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-21 00:38:41,920 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 00:38:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1976444667, now seen corresponding path program 1 times [2018-01-21 00:38:41,920 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:38:41,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:41,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:38:41,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:38:41,921 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:38:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:38:41,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:38:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:41,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:38:41,998 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:38:41,998 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-21 00:38:41,998 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [14], [16], [19], [102], [106], [110], [112], [116], [118], [119], [124], [125], [126], [130], [132], [133], [140], [141], [142], [160], [162], [166], [168], [169], [170], [171] [2018-01-21 00:38:41,999 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:38:42,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:38:42,126 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 00:38:42,130 INFO L168 Benchmark]: Toolchain (without parser) took 4262.36 ms. Allocated memory was 305.1 MB in the beginning and 522.2 MB in the end (delta: 217.1 MB). Free memory was 263.5 MB in the beginning and 352.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 128.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:42,131 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:38:42,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.03 ms. Allocated memory is still 305.1 MB. Free memory was 262.5 MB in the beginning and 251.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:42,131 INFO L168 Benchmark]: Boogie Preprocessor took 40.86 ms. Allocated memory is still 305.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:42,132 INFO L168 Benchmark]: RCFGBuilder took 388.72 ms. Allocated memory is still 305.1 MB. Free memory was 249.4 MB in the beginning and 224.8 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:42,132 INFO L168 Benchmark]: TraceAbstraction took 3599.95 ms. Allocated memory was 305.1 MB in the beginning and 522.2 MB in the end (delta: 217.1 MB). Free memory was 224.8 MB in the beginning and 352.2 MB in the end (delta: -127.4 MB). Peak memory consumption was 89.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:42,134 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.19 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.03 ms. Allocated memory is still 305.1 MB. Free memory was 262.5 MB in the beginning and 251.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.86 ms. Allocated memory is still 305.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 388.72 ms. Allocated memory is still 305.1 MB. Free memory was 249.4 MB in the beginning and 224.8 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3599.95 ms. Allocated memory was 305.1 MB in the beginning and 522.2 MB in the end (delta: 217.1 MB). Free memory was 224.8 MB in the beginning and 352.2 MB in the end (delta: -127.4 MB). Peak memory consumption was 89.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 339 LocStat_NO_SUPPORTING_DISEQUALITIES : 94 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 39 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.480460 RENAME_VARIABLES(MILLISECONDS) : 0.511817 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.412998 PROJECTAWAY(MILLISECONDS) : 0.182695 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001627 DISJOIN(MILLISECONDS) : 1.142515 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.569893 ADD_EQUALITY(MILLISECONDS) : 0.037604 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018344 #CONJOIN_DISJUNCTIVE : 58 #RENAME_VARIABLES : 91 #UNFREEZE : 0 #CONJOIN : 126 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 12 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 81 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * 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, 78 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=78occurred 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: [L625] EXPR, FCALL malloc(sizeof(*root)) VAL [malloc(sizeof(*root))={10:0}] [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L626] FCALL root->left = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L627] FCALL root->right = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; VAL [malloc(sizeof(*root))={10:0}, n={0:0}, root={10:0}] [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root VAL [malloc(sizeof(*root))={10:0}, n={10:0}, pred={0:0}, root={10:0}] [L652] EXPR, FCALL n->left VAL [malloc(sizeof(*root))={10:0}, n={10:0}, n->left={0:0}, pred={0:0}, root={10:0}] [L652] n->left || n->right VAL [malloc(sizeof(*root))={10:0}, n={10:0}, n->left={0:0}, n->left || n->right=0, pred={0:0}, root={10:0}] [L652] EXPR, FCALL n->right VAL [malloc(sizeof(*root))={10:0}, n={10:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={10:0}] [L652] n->left || n->right VAL [malloc(sizeof(*root))={10:0}, n={10:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={10:0}] [L652] COND FALSE !(n->left || n->right) [L659] COND FALSE !(\read(*pred)) [L665] root = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, n={10:0}, pred={0:0}, root={0:0}] [L666] FCALL free(n) VAL [malloc(sizeof(*root))={10:0}, n={10:0}, pred={0:0}, root={0:0}] [L649] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={10:0}, n={10:0}, pred={0:0}, root={0:0}] [L668] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 78 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 262 SDtfs, 173 SDslu, 123 SDs, 0 SdLazy, 14 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-38-42-143.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-38-42-143.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-38-42-143.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-38-42-143.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-38-42-143.csv Received shutdown request...