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-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:04:19,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:04:19,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:04:19,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:04:19,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:04:19,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:04:19,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:04:19,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:04:19,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:04:19,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:04:19,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:04:19,139 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:04:19,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:04:19,141 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:04:19,142 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:04:19,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:04:19,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:04:19,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:04:19,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:04:19,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:04:19,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:04:19,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:04:19,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:04:19,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:04:19,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:04:19,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:04:19,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:04:19,159 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:04:19,160 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:04:19,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:04:19,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:04:19,161 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:04:19,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:04:19,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:04:19,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:04:19,172 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:04:19,172 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:04:19,173 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:04:19,173 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:04:19,173 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:04:19,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:04:19,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:04:19,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:04:19,174 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:04:19,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:04:19,175 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:04:19,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:04:19,175 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:04:19,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:04:19,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:04:19,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:04:19,176 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:04:19,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:04:19,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:04:19,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:04:19,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:04:19,177 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:04:19,177 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:04:19,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:04:19,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:04:19,177 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:04:19,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:04:19,178 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:04:19,178 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:04:19,178 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:04:19,178 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:04:19,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:04:19,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:04:19,179 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:04:19,180 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:04:19,180 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:04:19,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:04:19,228 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:04:19,232 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:04:19,233 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:04:19,234 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:04:19,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:04:19,419 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:04:19,424 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:04:19,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:04:19,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:04:19,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:04:19,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b75990c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19, skipping insertion in model container [2018-01-21 01:04:19,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,456 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:04:19,500 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:04:19,623 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:04:19,642 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:04:19,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19 WrapperNode [2018-01-21 01:04:19,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:04:19,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:04:19,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:04:19,653 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:04:19,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (1/1) ... [2018-01-21 01:04:19,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:04:19,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:04:19,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:04:19,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:04:19,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (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:04:19,746 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:04:19,746 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:04:19,746 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:04:19,747 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:04:19,748 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:04:19,748 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:04:19,748 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:04:19,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:04:19,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:04:20,145 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:04:20,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:04:20 BoogieIcfgContainer [2018-01-21 01:04:20,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:04:20,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:04:20,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:04:20,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:04:20,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:04:19" (1/3) ... [2018-01-21 01:04:20,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c18ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:04:20, skipping insertion in model container [2018-01-21 01:04:20,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:19" (2/3) ... [2018-01-21 01:04:20,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c18ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:04:20, skipping insertion in model container [2018-01-21 01:04:20,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:04:20" (3/3) ... [2018-01-21 01:04:20,154 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:04:20,163 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:04:20,170 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:04:20,220 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:20,221 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:20,221 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:20,221 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:20,221 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:20,221 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:20,221 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:20,222 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:04:20,222 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-21 01:04:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:04:20,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:20,250 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:04:20,250 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:04:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash 195400, now seen corresponding path program 1 times [2018-01-21 01:04:20,256 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:20,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:20,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:20,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:20,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:20,359 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:04:20,365 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:20,373 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:20,373 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:20,373 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:20,373 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:20,373 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:20,374 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:20,374 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:20,374 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:04:20,374 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-21 01:04:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 01:04:20,380 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:20,380 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:04:20,380 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash 499029481, now seen corresponding path program 1 times [2018-01-21 01:04:20,381 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:20,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:20,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:20,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:20,382 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:20,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:20,543 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:04:20,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:20,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:04:20,547 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:20,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:04:20,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:04:20,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:04:20,565 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-01-21 01:04:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:20,599 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-01-21 01:04:20,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:04:20,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-21 01:04:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:20,615 INFO L225 Difference]: With dead ends: 124 [2018-01-21 01:04:20,616 INFO L226 Difference]: Without dead ends: 81 [2018-01-21 01:04:20,619 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:04:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-21 01:04:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-21 01:04:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-21 01:04:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-21 01:04:20,659 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 23 [2018-01-21 01:04:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:20,659 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-21 01:04:20,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:04:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-21 01:04:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 01:04:20,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:20,661 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] [2018-01-21 01:04:20,661 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:20,661 INFO L82 PathProgramCache]: Analyzing trace with hash -245872207, now seen corresponding path program 1 times [2018-01-21 01:04:20,662 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:20,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:20,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:20,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:20,663 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:20,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:20,767 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:04:20,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:20,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:04:20,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:20,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:04:20,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:04:20,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:04:20,771 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 5 states. [2018-01-21 01:04:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:20,906 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2018-01-21 01:04:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:04:20,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-21 01:04:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:20,911 INFO L225 Difference]: With dead ends: 141 [2018-01-21 01:04:20,911 INFO L226 Difference]: Without dead ends: 125 [2018-01-21 01:04:20,912 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:04:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-21 01:04:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-01-21 01:04:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-21 01:04:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-21 01:04:20,924 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 27 [2018-01-21 01:04:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:20,924 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-21 01:04:20,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:04:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-21 01:04:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 01:04:20,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:20,925 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] [2018-01-21 01:04:20,926 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash -130557319, now seen corresponding path program 1 times [2018-01-21 01:04:20,926 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:20,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:20,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:20,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:20,927 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:20,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:21,010 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:04:21,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:21,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 01:04:21,011 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:21,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:04:21,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:04:21,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:04:21,012 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-01-21 01:04:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:21,094 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-01-21 01:04:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:04:21,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-21 01:04:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:21,096 INFO L225 Difference]: With dead ends: 129 [2018-01-21 01:04:21,097 INFO L226 Difference]: Without dead ends: 90 [2018-01-21 01:04:21,097 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:04:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-21 01:04:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-01-21 01:04:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-21 01:04:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-21 01:04:21,108 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 48 [2018-01-21 01:04:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:21,108 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-21 01:04:21,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:04:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-21 01:04:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 01:04:21,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:21,111 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] [2018-01-21 01:04:21,111 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1094978108, now seen corresponding path program 1 times [2018-01-21 01:04:21,111 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:21,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:21,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:21,187 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:04:21,197 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:21,206 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:21,206 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:21,222 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:21,222 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:21,222 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:21,222 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:21,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:21,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:21,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:21,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:04:21,223 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-21 01:04:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 01:04:21,226 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:21,226 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:04:21,227 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1898919954, now seen corresponding path program 1 times [2018-01-21 01:04:21,227 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:21,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:21,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,228 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:21,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:21,253 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:04:21,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:21,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:04:21,254 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:21,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:04:21,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:04:21,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:04:21,255 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-01-21 01:04:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:21,261 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-01-21 01:04:21,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:04:21,261 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 01:04:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:21,262 INFO L225 Difference]: With dead ends: 124 [2018-01-21 01:04:21,263 INFO L226 Difference]: Without dead ends: 79 [2018-01-21 01:04:21,263 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:04:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-21 01:04:21,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-21 01:04:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 01:04:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-01-21 01:04:21,270 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 21 [2018-01-21 01:04:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:21,270 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-01-21 01:04:21,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:04:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-01-21 01:04:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 01:04:21,272 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:21,272 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] [2018-01-21 01:04:21,272 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1934937526, now seen corresponding path program 1 times [2018-01-21 01:04:21,272 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:21,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:21,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,274 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:21,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:21,361 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:04:21,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:21,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:04:21,361 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:21,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:04:21,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:04:21,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:04:21,362 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 5 states. [2018-01-21 01:04:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:21,615 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2018-01-21 01:04:21,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:04:21,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 01:04:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:21,618 INFO L225 Difference]: With dead ends: 137 [2018-01-21 01:04:21,618 INFO L226 Difference]: Without dead ends: 123 [2018-01-21 01:04:21,619 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:04:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-21 01:04:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2018-01-21 01:04:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-21 01:04:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-21 01:04:21,629 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 25 [2018-01-21 01:04:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:21,630 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-21 01:04:21,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:04:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-21 01:04:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 01:04:21,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:21,632 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] [2018-01-21 01:04:21,632 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1827795070, now seen corresponding path program 1 times [2018-01-21 01:04:21,633 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:21,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:21,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,634 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:21,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:21,736 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:04:21,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:21,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 01:04:21,737 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:21,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:04:21,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:04:21,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:04:21,738 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2018-01-21 01:04:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:21,763 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-01-21 01:04:21,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:04:21,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-21 01:04:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:21,765 INFO L225 Difference]: With dead ends: 125 [2018-01-21 01:04:21,765 INFO L226 Difference]: Without dead ends: 88 [2018-01-21 01:04:21,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:04:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-21 01:04:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-01-21 01:04:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-21 01:04:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-21 01:04:21,774 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 46 [2018-01-21 01:04:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:21,775 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-21 01:04:21,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:04:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-21 01:04:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 01:04:21,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:21,777 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] [2018-01-21 01:04:21,777 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 01:04:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1002255617, now seen corresponding path program 1 times [2018-01-21 01:04:21,778 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:21,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:21,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:21,779 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:21,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:22,032 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:04:22,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:22,033 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:04:22,034 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-21 01:04:22,036 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [14], [17], [18], [19], [25], [29], [31], [34], [67], [71], [75], [77], [81], [82], [83], [90], [92], [100], [102], [107], [108], [109], [115], [119], [125], [126], [130], [134], [138], [140], [141], [142], [143], [151], [153], [157], [159], [160], [161], [167], [168], [169] [2018-01-21 01:04:22,102 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:04:22,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:04:22,620 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:04:22,624 INFO L168 Benchmark]: Toolchain (without parser) took 3204.76 ms. Allocated memory was 303.6 MB in the beginning and 480.2 MB in the end (delta: 176.7 MB). Free memory was 263.5 MB in the beginning and 325.2 MB in the end (delta: -61.8 MB). Peak memory consumption was 114.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:22,626 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 303.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:04:22,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.24 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 250.4 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:04:22,626 INFO L168 Benchmark]: Boogie Preprocessor took 40.59 ms. Allocated memory is still 303.6 MB. Free memory was 250.4 MB in the beginning and 248.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:22,627 INFO L168 Benchmark]: RCFGBuilder took 452.78 ms. Allocated memory is still 303.6 MB. Free memory was 248.4 MB in the beginning and 221.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:22,627 INFO L168 Benchmark]: TraceAbstraction took 2475.78 ms. Allocated memory was 303.6 MB in the beginning and 480.2 MB in the end (delta: 176.7 MB). Free memory was 221.5 MB in the beginning and 325.2 MB in the end (delta: -103.8 MB). Peak memory consumption was 72.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:22,629 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.25 ms. Allocated memory is still 303.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.24 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 250.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.59 ms. Allocated memory is still 303.6 MB. Free memory was 250.4 MB in the beginning and 248.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 452.78 ms. Allocated memory is still 303.6 MB. Free memory was 248.4 MB in the beginning and 221.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2475.78 ms. Allocated memory was 303.6 MB in the beginning and 480.2 MB in the end (delta: 176.7 MB). Free memory was 221.5 MB in the beginning and 325.2 MB in the end (delta: -103.8 MB). Peak memory consumption was 72.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, 84 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=84occurred 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: [L985] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={18:0}] [L985] SLL* head = malloc(sizeof(SLL)); VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L986] FCALL head->next = ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L987] COND FALSE !(__VERIFIER_nondet_int()) [L987] COND TRUE __VERIFIER_nondet_int() [L987] FCALL head->data = 1 VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L987] FCALL head->opt = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L988] SLL* x = head; VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L990] COND FALSE !(__VERIFIER_nondet_int()) [L993] x = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L994] COND TRUE x != ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L996] EXPR, FCALL x->data VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1] [L996] EXPR x->data == 2 && x->opt != x VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0] [L996] EXPR x->data == 2 && x->opt != x && x->opt->next == ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L996] 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={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L996] EXPR, FCALL x->opt VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={18:0}, malloc(sizeof(SLL))={18:0}, x={18: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={18:0}] [L996] 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={18:0}, malloc(sizeof(SLL))={18:0}, x={18: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={18:0}] [L996] COND FALSE !(!((x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x)) [L996] COND FALSE !(0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L997] EXPR, FCALL x->next VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->next={0:0}] [L997] x = x->next [L994] COND FALSE !(x != ((void*)0)) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1000] x = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1002] COND TRUE x != ((void*)0) [L1004] head = x VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1005] EXPR, FCALL x->next VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->next={0:0}] [L1005] x = x->next [L1006] EXPR, FCALL head->data VAL [head={18:0}, head->data=1, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1006] COND FALSE !(head->data == 2) [L1008] FCALL free(head) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1002] COND FALSE !(x != ((void*)0)) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1011] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 84 locations, 3 error locations. UNSAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 269 SDslu, 246 SDs, 0 SdLazy, 79 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 4555 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/sll-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-04-22-637.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-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-04-22-637.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-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-04-22-637.csv Received shutdown request...