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/dll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:01:43,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:01:43,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:01:43,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:01:43,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:01:43,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:01:43,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:01:43,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:01:43,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:01:43,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:01:43,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:01:43,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:01:43,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:01:43,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:01:43,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:01:43,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:01:43,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:01:43,438 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:01:43,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:01:43,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:01:43,443 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:01:43,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:01:43,443 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:01:43,444 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:01:43,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:01:43,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:01:43,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:01:43,447 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:01:43,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:01:43,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:01:43,448 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:01:43,448 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:01:43,457 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:01:43,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:01:43,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:01:43,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:01:43,459 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:01:43,459 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:01:43,459 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:01:43,459 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:01:43,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:01:43,460 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:01:43,460 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:01:43,461 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:01:43,461 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:01:43,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:01:43,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:01:43,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:01:43,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:01:43,462 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:01:43,462 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:01:43,462 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:01:43,462 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:01:43,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:01:43,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:01:43,463 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:01:43,463 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:01:43,463 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:01:43,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:01:43,463 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:01:43,464 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:01:43,464 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:01:43,464 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:01:43,464 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:01:43,464 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:01:43,464 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:01:43,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:01:43,465 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:01:43,465 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:01:43,466 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:01:43,466 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:01:43,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:01:43,512 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:01:43,515 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:01:43,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:01:43,517 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:01:43,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:01:43,693 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:01:43,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:01:43,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:01:43,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:01:43,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:01:43,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c1589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43, skipping insertion in model container [2018-01-21 01:01:43,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:01:43,762 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:01:43,891 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:01:43,915 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:01:43,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43 WrapperNode [2018-01-21 01:01:43,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:01:43,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:01:43,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:01:43,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:01:43,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (1/1) ... [2018-01-21 01:01:43,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:01:43,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:01:43,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:01:43,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:01:43,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (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:01:44,037 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:01:44,037 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:01:44,037 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:01:44,037 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:01:44,037 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:01:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:01:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:01:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:01:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:01:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:01:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:01:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:01:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:01:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:01:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:01:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:01:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:01:44,424 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:01:44,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:01:44 BoogieIcfgContainer [2018-01-21 01:01:44,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:01:44,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:01:44,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:01:44,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:01:44,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:01:43" (1/3) ... [2018-01-21 01:01:44,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c072597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:01:44, skipping insertion in model container [2018-01-21 01:01:44,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:43" (2/3) ... [2018-01-21 01:01:44,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c072597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:01:44, skipping insertion in model container [2018-01-21 01:01:44,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:01:44" (3/3) ... [2018-01-21 01:01:44,430 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:01:44,436 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:01:44,442 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:01:44,478 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:01:44,479 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:01:44,479 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:01:44,479 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:01:44,479 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:01:44,479 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:01:44,479 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:01:44,480 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:01:44,481 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:01:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-21 01:01:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:01:44,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:44,510 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:01:44,510 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:01:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 199372, now seen corresponding path program 1 times [2018-01-21 01:01:44,516 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:44,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:44,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:44,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:44,557 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:01:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:01:44,622 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:01:44,630 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:01:44,636 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:01:44,637 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:01:44,637 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:01:44,637 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:01:44,637 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:01:44,637 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:01:44,637 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:01:44,637 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:01:44,637 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:01:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-21 01:01:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 01:01:44,641 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:44,641 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] [2018-01-21 01:01:44,641 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2056818696, now seen corresponding path program 1 times [2018-01-21 01:01:44,642 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:44,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:44,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:44,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:44,643 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:44,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:44,822 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:01:44,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:44,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:01:44,825 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:44,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:01:44,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:01:44,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:01:44,840 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2018-01-21 01:01:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:44,863 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2018-01-21 01:01:44,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:01:44,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 01:01:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:44,876 INFO L225 Difference]: With dead ends: 128 [2018-01-21 01:01:44,876 INFO L226 Difference]: Without dead ends: 85 [2018-01-21 01:01:44,879 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:01:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-21 01:01:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-21 01:01:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-21 01:01:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-21 01:01:44,916 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 24 [2018-01-21 01:01:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:44,916 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-21 01:01:44,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:01:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-21 01:01:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 01:01:44,918 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:44,918 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] [2018-01-21 01:01:44,918 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1534244515, now seen corresponding path program 1 times [2018-01-21 01:01:44,919 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:44,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:44,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:44,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:44,920 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:44,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:45,039 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:01:45,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:45,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:01:45,040 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:45,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:01:45,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:01:45,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:01:45,043 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 5 states. [2018-01-21 01:01:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:45,243 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2018-01-21 01:01:45,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:01:45,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-21 01:01:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:45,248 INFO L225 Difference]: With dead ends: 148 [2018-01-21 01:01:45,248 INFO L226 Difference]: Without dead ends: 132 [2018-01-21 01:01:45,249 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:01:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-21 01:01:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 89. [2018-01-21 01:01:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 01:01:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-21 01:01:45,262 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2018-01-21 01:01:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:45,262 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-21 01:01:45,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:01:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-21 01:01:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 01:01:45,264 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:45,264 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] [2018-01-21 01:01:45,265 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:45,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1052367185, now seen corresponding path program 1 times [2018-01-21 01:01:45,265 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:45,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:45,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,267 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:45,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:01:45,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:45,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:01:45,362 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:45,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:01:45,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:01:45,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:01:45,363 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 5 states. [2018-01-21 01:01:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:45,447 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2018-01-21 01:01:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 01:01:45,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-21 01:01:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:45,449 INFO L225 Difference]: With dead ends: 140 [2018-01-21 01:01:45,449 INFO L226 Difference]: Without dead ends: 101 [2018-01-21 01:01:45,450 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-21 01:01:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-21 01:01:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2018-01-21 01:01:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-21 01:01:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-01-21 01:01:45,458 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 49 [2018-01-21 01:01:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:45,458 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-01-21 01:01:45,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:01:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-01-21 01:01:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-21 01:01:45,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:45,459 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] [2018-01-21 01:01:45,460 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash -280906860, now seen corresponding path program 1 times [2018-01-21 01:01:45,460 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:45,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:45,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:01:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:01:45,530 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:01:45,540 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:01:45,548 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:01:45,549 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:01:45,565 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:01:45,565 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:01:45,565 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:01:45,565 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:01:45,565 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:01:45,565 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:01:45,565 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:01:45,565 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:01:45,566 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:01:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-21 01:01:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 01:01:45,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:45,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] [2018-01-21 01:01:45,569 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:01:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1857075517, now seen corresponding path program 1 times [2018-01-21 01:01:45,570 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:45,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:45,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:45,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:45,595 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:01:45,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:45,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:01:45,595 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:45,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:01:45,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:01:45,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:01:45,596 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2018-01-21 01:01:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:45,601 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2018-01-21 01:01:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:01:45,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 01:01:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:45,603 INFO L225 Difference]: With dead ends: 128 [2018-01-21 01:01:45,603 INFO L226 Difference]: Without dead ends: 83 [2018-01-21 01:01:45,603 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:01:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-21 01:01:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-21 01:01:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-21 01:01:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-21 01:01:45,609 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 22 [2018-01-21 01:01:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:45,609 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-21 01:01:45,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:01:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-21 01:01:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 01:01:45,610 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:45,610 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] [2018-01-21 01:01:45,610 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:01:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1003988962, now seen corresponding path program 1 times [2018-01-21 01:01:45,610 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:45,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:45,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,611 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:45,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:45,650 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:01:45,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:45,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:01:45,651 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:45,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:01:45,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:01:45,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:01:45,652 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-01-21 01:01:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:45,851 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2018-01-21 01:01:45,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:01:45,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 01:01:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:45,853 INFO L225 Difference]: With dead ends: 144 [2018-01-21 01:01:45,854 INFO L226 Difference]: Without dead ends: 130 [2018-01-21 01:01:45,854 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:01:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-21 01:01:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2018-01-21 01:01:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-21 01:01:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-21 01:01:45,865 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 26 [2018-01-21 01:01:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:45,865 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-21 01:01:45,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:01:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-21 01:01:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 01:01:45,866 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:45,867 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] [2018-01-21 01:01:45,867 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 01:01:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash 68134102, now seen corresponding path program 1 times [2018-01-21 01:01:45,867 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:45,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:45,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:45,868 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:45,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:01:45,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:45,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:01:45,960 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:45,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:01:45,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:01:45,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:01:45,961 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 5 states. [2018-01-21 01:01:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:46,035 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2018-01-21 01:01:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 01:01:46,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-21 01:01:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:46,037 INFO L225 Difference]: With dead ends: 136 [2018-01-21 01:01:46,038 INFO L226 Difference]: Without dead ends: 99 [2018-01-21 01:01:46,038 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-21 01:01:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-21 01:01:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2018-01-21 01:01:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-21 01:01:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-01-21 01:01:46,047 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 47 [2018-01-21 01:01:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:46,047 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-01-21 01:01:46,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:01:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-01-21 01:01:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 01:01:46,048 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:46,048 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] [2018-01-21 01:01:46,049 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 01:01:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2109787175, now seen corresponding path program 1 times [2018-01-21 01:01:46,049 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:46,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:46,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:46,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:46,050 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:46,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:46,311 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:01:46,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:46,311 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:01:46,312 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-01-21 01:01:46,314 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [15], [18], [19], [20], [26], [30], [32], [35], [71], [75], [79], [81], [85], [86], [87], [94], [96], [104], [106], [111], [112], [113], [119], [123], [129], [130], [134], [138], [142], [144], [145], [146], [147], [155], [157], [161], [163], [164], [165], [171], [172], [173] [2018-01-21 01:01:46,377 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:01:46,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:01:46,690 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:01:46,694 INFO L168 Benchmark]: Toolchain (without parser) took 3000.45 ms. Allocated memory was 297.8 MB in the beginning and 474.0 MB in the end (delta: 176.2 MB). Free memory was 257.7 MB in the beginning and 360.9 MB in the end (delta: -103.2 MB). Peak memory consumption was 73.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:46,695 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 297.8 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:01:46,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.74 ms. Allocated memory is still 297.8 MB. Free memory was 256.7 MB in the beginning and 244.7 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:01:46,696 INFO L168 Benchmark]: Boogie Preprocessor took 33.11 ms. Allocated memory is still 297.8 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:46,697 INFO L168 Benchmark]: RCFGBuilder took 440.48 ms. Allocated memory is still 297.8 MB. Free memory was 242.7 MB in the beginning and 214.7 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:46,697 INFO L168 Benchmark]: TraceAbstraction took 2267.81 ms. Allocated memory was 297.8 MB in the beginning and 474.0 MB in the end (delta: 176.2 MB). Free memory was 214.7 MB in the beginning and 360.9 MB in the end (delta: -146.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:46,698 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.27 ms. Allocated memory is still 297.8 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 251.74 ms. Allocated memory is still 297.8 MB. Free memory was 256.7 MB in the beginning and 244.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.11 ms. Allocated memory is still 297.8 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 440.48 ms. Allocated memory is still 297.8 MB. Free memory was 242.7 MB in the beginning and 214.7 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2267.81 ms. Allocated memory was 297.8 MB in the beginning and 474.0 MB in the end (delta: 176.2 MB). Free memory was 214.7 MB in the beginning and 360.9 MB in the end (delta: -146.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 88 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=88occurred 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: [L986] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={21:0}] [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L987] FCALL head->next = ((void*)0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L988] FCALL head->prev = ((void*)0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L989] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND TRUE __VERIFIER_nondet_int() [L989] FCALL head->data = 1 VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L989] FCALL head->opt = head VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L990] SLL* x = head; VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L992] COND FALSE !(__VERIFIER_nondet_int()) [L995] x = head VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L996] COND TRUE x != ((void*)0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L998] EXPR, FCALL x->data VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1] [L998] EXPR x->data == 2 && x->opt != x VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0] [L998] EXPR x->data == 2 && x->opt != x && x->opt->next == ((void*)0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L998] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L998] EXPR, FCALL x->opt VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0, x->opt={21:0}] [L998] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=1, head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0, x->opt={21:0}] [L998] COND FALSE !(!((x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x)) [L998] COND FALSE !(0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L999] EXPR, FCALL x->next VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->next={0:0}] [L999] x = x->next [L996] COND FALSE !(x != ((void*)0)) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={0:0}] [L1002] x = head VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L1004] COND TRUE x != ((void*)0) [L1006] head = x VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L1007] EXPR, FCALL x->next VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->next={0:0}] [L1007] x = x->next [L1008] EXPR, FCALL head->data VAL [head={21:0}, head->data=1, malloc(sizeof(SLL))={21:0}, x={0:0}] [L1008] COND FALSE !(head->data == 2) [L1010] FCALL free(head) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={0:0}] [L1004] COND FALSE !(x != ((void*)0)) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={0:0}] [L1013] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 88 locations, 3 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 297 SDslu, 340 SDs, 0 SdLazy, 96 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred 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, 51 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 4969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 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/dll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-01-46-707.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-01-46-707.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-01-46-707.csv Received shutdown request...