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/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:05:56,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:05:56,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:05:56,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:05:56,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:05:56,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:05:56,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:05:56,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:05:56,299 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:05:56,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:05:56,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:05:56,301 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:05:56,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:05:56,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:05:56,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:05:56,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:05:56,309 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:05:56,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:05:56,313 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:05:56,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:05:56,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:05:56,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:05:56,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:05:56,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:05:56,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:05:56,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:05:56,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:05:56,321 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:05:56,321 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:05:56,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:05:56,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:05:56,322 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 01:05:56,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:05:56,335 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:05:56,335 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:05:56,336 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:05:56,336 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:05:56,336 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:05:56,336 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:05:56,336 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:05:56,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:05:56,337 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:05:56,338 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:05:56,338 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:05:56,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:05:56,338 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:05:56,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:05:56,339 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:05:56,339 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:05:56,339 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:05:56,339 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:05:56,339 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:05:56,340 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:05:56,340 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:05:56,340 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:05:56,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:05:56,340 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:05:56,341 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:05:56,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:05:56,341 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:05:56,341 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:05:56,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:05:56,342 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:05:56,342 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:05:56,342 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:05:56,342 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:05:56,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:05:56,343 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:05:56,343 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:05:56,344 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:05:56,344 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:05:56,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:05:56,392 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:05:56,396 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:05:56,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:05:56,398 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:05:56,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-01-21 01:05:56,552 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:05:56,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:05:56,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:05:56,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:05:56,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:05:56,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169cf693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56, skipping insertion in model container [2018-01-21 01:05:56,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,582 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:05:56,623 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:05:56,742 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:05:56,767 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:05:56,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56 WrapperNode [2018-01-21 01:05:56,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:05:56,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:05:56,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:05:56,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:05:56,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (1/1) ... [2018-01-21 01:05:56,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:05:56,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:05:56,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:05:56,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:05:56,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (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 01:05:56,880 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:05:56,880 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:05:56,881 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:05:56,881 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:05:56,881 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:05:56,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:05:56,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:05:56,882 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:05:56,882 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:05:56,882 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:05:56,882 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:05:56,882 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:05:56,882 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:05:56,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:05:56,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:05:57,312 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:05:57,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:05:57 BoogieIcfgContainer [2018-01-21 01:05:57,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:05:57,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:05:57,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:05:57,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:05:57,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:05:56" (1/3) ... [2018-01-21 01:05:57,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77eac608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:05:57, skipping insertion in model container [2018-01-21 01:05:57,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:56" (2/3) ... [2018-01-21 01:05:57,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77eac608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:05:57, skipping insertion in model container [2018-01-21 01:05:57,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:05:57" (3/3) ... [2018-01-21 01:05:57,321 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-01-21 01:05:57,329 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:05:57,337 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:05:57,389 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:05:57,389 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:05:57,389 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:05:57,389 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:05:57,389 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:05:57,390 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:05:57,390 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:05:57,390 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:05:57,391 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:05:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-21 01:05:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:05:57,420 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:57,421 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:05:57,422 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:05:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash 400739, now seen corresponding path program 1 times [2018-01-21 01:05:57,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:57,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:57,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:57,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:57,484 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:05:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:05:57,546 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:05:57,554 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:05:57,561 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:05:57,561 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:05:57,562 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:05:57,562 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:05:57,562 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:05:57,562 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:05:57,562 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:05:57,562 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:05:57,562 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:05:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-21 01:05:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 01:05:57,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:57,569 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:57,569 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash -63616992, now seen corresponding path program 1 times [2018-01-21 01:05:57,569 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:57,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:57,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:57,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:57,570 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:57,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:57,633 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 01:05:57,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:57,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:05:57,635 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:57,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:05:57,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:05:57,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:05:57,731 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-01-21 01:05:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:57,764 INFO L93 Difference]: Finished difference Result 243 states and 349 transitions. [2018-01-21 01:05:57,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:05:57,765 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-21 01:05:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:57,776 INFO L225 Difference]: With dead ends: 243 [2018-01-21 01:05:57,776 INFO L226 Difference]: Without dead ends: 123 [2018-01-21 01:05:57,780 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 01:05:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-21 01:05:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-21 01:05:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-21 01:05:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-01-21 01:05:57,819 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 23 [2018-01-21 01:05:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:57,820 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-01-21 01:05:57,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:05:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-01-21 01:05:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 01:05:57,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:57,821 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:57,821 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash -980023246, now seen corresponding path program 1 times [2018-01-21 01:05:57,822 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:57,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:57,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:57,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:57,823 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:57,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:57,975 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 01:05:57,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:57,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:05:57,976 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:57,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:05:57,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:05:57,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:05:57,978 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 5 states. [2018-01-21 01:05:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:58,277 INFO L93 Difference]: Finished difference Result 289 states and 315 transitions. [2018-01-21 01:05:58,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 01:05:58,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-21 01:05:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:58,281 INFO L225 Difference]: With dead ends: 289 [2018-01-21 01:05:58,281 INFO L226 Difference]: Without dead ends: 194 [2018-01-21 01:05:58,282 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:05:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-21 01:05:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 127. [2018-01-21 01:05:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-21 01:05:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-01-21 01:05:58,291 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 36 [2018-01-21 01:05:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:58,292 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-01-21 01:05:58,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:05:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-01-21 01:05:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 01:05:58,293 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:58,293 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:58,293 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:58,293 INFO L82 PathProgramCache]: Analyzing trace with hash -465624459, now seen corresponding path program 1 times [2018-01-21 01:05:58,293 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:58,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:58,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,294 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:58,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:58,363 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 01:05:58,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:58,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:05:58,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:58,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:05:58,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:05:58,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:05:58,365 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 5 states. [2018-01-21 01:05:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:58,494 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2018-01-21 01:05:58,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:05:58,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-21 01:05:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:58,496 INFO L225 Difference]: With dead ends: 212 [2018-01-21 01:05:58,496 INFO L226 Difference]: Without dead ends: 185 [2018-01-21 01:05:58,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:05:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-21 01:05:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2018-01-21 01:05:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-21 01:05:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-01-21 01:05:58,507 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 38 [2018-01-21 01:05:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:58,507 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-01-21 01:05:58,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:05:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-01-21 01:05:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-21 01:05:58,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:58,509 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:58,509 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:58,509 INFO L82 PathProgramCache]: Analyzing trace with hash 700231337, now seen corresponding path program 1 times [2018-01-21 01:05:58,510 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:58,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:58,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,511 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:05:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:05:58,572 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:05:58,583 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:05:58,593 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:05:58,593 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:05:58,614 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:05:58,614 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:05:58,614 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:05:58,614 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:05:58,614 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:05:58,615 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:05:58,615 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:05:58,615 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:05:58,615 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:05:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-21 01:05:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 01:05:58,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:58,618 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:58,618 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1135260480, now seen corresponding path program 1 times [2018-01-21 01:05:58,619 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:58,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:58,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,620 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:58,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:58,635 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 01:05:58,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:58,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:05:58,636 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:58,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:05:58,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:05:58,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:05:58,637 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-01-21 01:05:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:58,643 INFO L93 Difference]: Finished difference Result 243 states and 349 transitions. [2018-01-21 01:05:58,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:05:58,643 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 01:05:58,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:58,645 INFO L225 Difference]: With dead ends: 243 [2018-01-21 01:05:58,645 INFO L226 Difference]: Without dead ends: 121 [2018-01-21 01:05:58,646 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 01:05:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-21 01:05:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-21 01:05:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-21 01:05:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-01-21 01:05:58,655 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 21 [2018-01-21 01:05:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:58,655 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-01-21 01:05:58,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:05:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-01-21 01:05:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 01:05:58,656 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:58,656 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:58,657 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1152051538, now seen corresponding path program 1 times [2018-01-21 01:05:58,657 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:58,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:58,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,658 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:58,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:58,728 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 01:05:58,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:58,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:05:58,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:58,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:05:58,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:05:58,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:05:58,730 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 5 states. [2018-01-21 01:05:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:58,945 INFO L93 Difference]: Finished difference Result 285 states and 310 transitions. [2018-01-21 01:05:58,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 01:05:58,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-21 01:05:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:58,947 INFO L225 Difference]: With dead ends: 285 [2018-01-21 01:05:58,948 INFO L226 Difference]: Without dead ends: 192 [2018-01-21 01:05:58,949 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:05:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-21 01:05:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 125. [2018-01-21 01:05:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-21 01:05:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-01-21 01:05:58,958 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 34 [2018-01-21 01:05:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:58,958 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-01-21 01:05:58,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:05:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-01-21 01:05:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 01:05:58,960 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:58,960 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:58,960 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash -934561707, now seen corresponding path program 1 times [2018-01-21 01:05:58,961 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:58,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:58,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:58,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:58,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:59,018 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 01:05:59,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:59,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:05:59,019 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:59,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:05:59,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:05:59,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:05:59,020 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 5 states. [2018-01-21 01:05:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:59,151 INFO L93 Difference]: Finished difference Result 208 states and 226 transitions. [2018-01-21 01:05:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:05:59,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-21 01:05:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:59,153 INFO L225 Difference]: With dead ends: 208 [2018-01-21 01:05:59,153 INFO L226 Difference]: Without dead ends: 183 [2018-01-21 01:05:59,154 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:05:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-21 01:05:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 129. [2018-01-21 01:05:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-21 01:05:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-01-21 01:05:59,162 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 36 [2018-01-21 01:05:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:59,162 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-01-21 01:05:59,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:05:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-01-21 01:05:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-21 01:05:59,164 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:59,164 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:59,165 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 01:05:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1469660791, now seen corresponding path program 1 times [2018-01-21 01:05:59,165 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:59,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:59,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:59,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:59,166 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:59,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:59,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:59,307 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:59,308 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-21 01:05:59,310 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [13], [18], [22], [28], [31], [32], [46], [47], [48], [53], [54], [55], [61], [65], [71], [75], [77], [80], [169], [173], [178], [182], [190], [194], [196], [197], [198], [202], [206], [283], [288], [292], [298], [299], [305], [309], [311], [312], [313], [374], [376], [377], [378], [379], [383], [385], [386], [387], [388] [2018-01-21 01:05:59,358 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:59,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:59,745 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 01:05:59,749 INFO L168 Benchmark]: Toolchain (without parser) took 3196.34 ms. Allocated memory was 307.8 MB in the beginning and 465.6 MB in the end (delta: 157.8 MB). Free memory was 264.5 MB in the beginning and 379.4 MB in the end (delta: -114.8 MB). Peak memory consumption was 43.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:59,751 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 307.8 MB. Free memory is still 272.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:05:59,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.02 ms. Allocated memory is still 307.8 MB. Free memory was 264.5 MB in the beginning and 252.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:59,752 INFO L168 Benchmark]: Boogie Preprocessor took 44.00 ms. Allocated memory is still 307.8 MB. Free memory was 252.6 MB in the beginning and 248.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:59,752 INFO L168 Benchmark]: RCFGBuilder took 492.91 ms. Allocated memory is still 307.8 MB. Free memory was 248.6 MB in the beginning and 215.6 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:59,752 INFO L168 Benchmark]: TraceAbstraction took 2434.62 ms. Allocated memory was 307.8 MB in the beginning and 465.6 MB in the end (delta: 157.8 MB). Free memory was 215.6 MB in the beginning and 379.4 MB in the end (delta: -163.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:05:59,754 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.18 ms. Allocated memory is still 307.8 MB. Free memory is still 272.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.02 ms. Allocated memory is still 307.8 MB. Free memory was 264.5 MB in the beginning and 252.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.00 ms. Allocated memory is still 307.8 MB. Free memory was 252.6 MB in the beginning and 248.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 492.91 ms. Allocated memory is still 307.8 MB. Free memory was 248.6 MB in the beginning and 215.6 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2434.62 ms. Allocated memory was 307.8 MB in the beginning and 465.6 MB in the end (delta: 157.8 MB). Free memory was 215.6 MB in the beginning and 379.4 MB in the end (delta: -163.7 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 126 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={10:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] FCALL list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND TRUE __VERIFIER_nondet_int() [L993] FCALL list->inner = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR, FCALL end->inner VAL [end={10:0}, end->inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND FALSE !(((void*)0) != inner) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] COND FALSE !(!(len <= 1)) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] COND FALSE !(0) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1033] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1033] end = end->next [L1014] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1037] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1039] EXPR, FCALL list->inner VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L1039] end = list->inner [L1041] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1049] EXPR, FCALL list->next VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->next={0:0}, malloc(sizeof(SLL))={10:0}] [L1049] end = list->next [L1050] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1051] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1037] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1054] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 126 locations, 3 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 441 SDslu, 441 SDs, 0 SdLazy, 165 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 121 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 7469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - 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/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-05-59-763.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-05-59-763.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-05-59-763.csv Received shutdown request...