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/list-ext-properties/list-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:42:29,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:42:29,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:42:29,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:42:29,145 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:42:29,146 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:42:29,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:42:29,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:42:29,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:42:29,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:42:29,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:42:29,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:42:29,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:42:29,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:42:29,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:42:29,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:42:29,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:42:29,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:42:29,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:42:29,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:42:29,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:42:29,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:42:29,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:42:29,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:42:29,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:42:29,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:42:29,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:42:29,171 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:42:29,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:42:29,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:42:29,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:42:29,172 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:42:29,182 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:42:29,182 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:42:29,183 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:42:29,183 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:42:29,183 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:42:29,184 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:42:29,184 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:42:29,184 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:42:29,185 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:42:29,185 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:42:29,185 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:42:29,185 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:42:29,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:42:29,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:42:29,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:42:29,186 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:42:29,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:42:29,186 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:42:29,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:42:29,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:42:29,187 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:42:29,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:42:29,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:42:29,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:42:29,188 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:42:29,188 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:42:29,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:42:29,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:42:29,188 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:42:29,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:42:29,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:42:29,189 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:42:29,189 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:42:29,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:42:29,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:42:29,190 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:42:29,190 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:42:29,191 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:42:29,191 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:42:29,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:42:29,236 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:42:29,240 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:42:29,241 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:42:29,241 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:42:29,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-01-21 00:42:29,420 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:42:29,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:42:29,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:29,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:42:29,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:42:29,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6479bd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29, skipping insertion in model container [2018-01-21 00:42:29,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,457 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:29,496 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:29,616 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:29,637 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:29,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29 WrapperNode [2018-01-21 00:42:29,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:29,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:42:29,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:42:29,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:42:29,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (1/1) ... [2018-01-21 00:42:29,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:42:29,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:42:29,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:42:29,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:42:29,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:42:29,748 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:42:29,748 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:42:29,748 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 00:42:29,749 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 00:42:29,749 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:42:29,750 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:42:29,750 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:42:29,750 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 00:42:29,750 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:42:29,750 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:42:29,750 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:42:30,086 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:42:30,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:30 BoogieIcfgContainer [2018-01-21 00:42:30,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:42:30,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:42:30,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:42:30,090 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:42:30,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:42:29" (1/3) ... [2018-01-21 00:42:30,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e936bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:30, skipping insertion in model container [2018-01-21 00:42:30,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:29" (2/3) ... [2018-01-21 00:42:30,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e936bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:30, skipping insertion in model container [2018-01-21 00:42:30,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:30" (3/3) ... [2018-01-21 00:42:30,095 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_1_true-valid-memsafety.i [2018-01-21 00:42:30,104 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:42:30,112 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:42:30,160 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:30,160 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:30,160 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:30,160 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:30,160 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:30,160 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:30,160 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:30,161 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 00:42:30,161 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-21 00:42:30,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:30,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 70 states. [2018-01-21 00:42:30,263 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 00:42:30,263 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 00:42:30,264 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 00:42:30,264 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 00:42:30,264 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 00:42:30,264 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 672) no Hoare annotation was computed. [2018-01-21 00:42:30,264 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 672) no Hoare annotation was computed. [2018-01-21 00:42:30,264 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 672) the Hoare annotation is: true [2018-01-21 00:42:30,264 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 672) no Hoare annotation was computed. [2018-01-21 00:42:30,265 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 672) the Hoare annotation is: true [2018-01-21 00:42:30,265 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 672) no Hoare annotation was computed. [2018-01-21 00:42:30,265 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 672) the Hoare annotation is: true [2018-01-21 00:42:30,265 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 672) no Hoare annotation was computed. [2018-01-21 00:42:30,265 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 672) no Hoare annotation was computed. [2018-01-21 00:42:30,265 INFO L401 ceAbstractionStarter]: For program point L641'''''(lines 641 648) no Hoare annotation was computed. [2018-01-21 00:42:30,266 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 00:42:30,266 INFO L401 ceAbstractionStarter]: For program point L635'(line 635) no Hoare annotation was computed. [2018-01-21 00:42:30,266 INFO L401 ceAbstractionStarter]: For program point L641''''''(lines 641 648) no Hoare annotation was computed. [2018-01-21 00:42:30,266 INFO L401 ceAbstractionStarter]: For program point L658'''(lines 658 661) no Hoare annotation was computed. [2018-01-21 00:42:30,266 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 672) no Hoare annotation was computed. [2018-01-21 00:42:30,266 INFO L401 ceAbstractionStarter]: For program point L641(lines 641 648) no Hoare annotation was computed. [2018-01-21 00:42:30,267 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-21 00:42:30,267 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-21 00:42:30,267 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-21 00:42:30,267 INFO L401 ceAbstractionStarter]: For program point L660'(line 660) no Hoare annotation was computed. [2018-01-21 00:42:30,267 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-21 00:42:30,267 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-21 00:42:30,268 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 00:42:30,268 INFO L404 ceAbstractionStarter]: At program point L645'(line 645) the Hoare annotation is: true [2018-01-21 00:42:30,268 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-21 00:42:30,268 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-21 00:42:30,268 INFO L401 ceAbstractionStarter]: For program point L637'''(line 637) no Hoare annotation was computed. [2018-01-21 00:42:30,269 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 672) no Hoare annotation was computed. [2018-01-21 00:42:30,269 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-21 00:42:30,269 INFO L401 ceAbstractionStarter]: For program point L665''''(lines 665 669) no Hoare annotation was computed. [2018-01-21 00:42:30,269 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 640) no Hoare annotation was computed. [2018-01-21 00:42:30,269 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-21 00:42:30,269 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 00:42:30,270 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-21 00:42:30,270 INFO L404 ceAbstractionStarter]: At program point L665'''(lines 665 669) the Hoare annotation is: true [2018-01-21 00:42:30,270 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-21 00:42:30,270 INFO L401 ceAbstractionStarter]: For program point L658'(line 658) no Hoare annotation was computed. [2018-01-21 00:42:30,270 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-21 00:42:30,271 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 00:42:30,271 INFO L401 ceAbstractionStarter]: For program point L662(line 662) no Hoare annotation was computed. [2018-01-21 00:42:30,271 INFO L401 ceAbstractionStarter]: For program point L660(line 660) no Hoare annotation was computed. [2018-01-21 00:42:30,271 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-21 00:42:30,271 INFO L401 ceAbstractionStarter]: For program point L645'''(line 645) no Hoare annotation was computed. [2018-01-21 00:42:30,272 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-21 00:42:30,272 INFO L401 ceAbstractionStarter]: For program point L666(line 666) no Hoare annotation was computed. [2018-01-21 00:42:30,272 INFO L401 ceAbstractionStarter]: For program point L665(lines 665 669) no Hoare annotation was computed. [2018-01-21 00:42:30,272 INFO L401 ceAbstractionStarter]: For program point L667'(line 667) no Hoare annotation was computed. [2018-01-21 00:42:30,272 INFO L401 ceAbstractionStarter]: For program point L643'(line 643) no Hoare annotation was computed. [2018-01-21 00:42:30,272 INFO L404 ceAbstractionStarter]: At program point L654'''(lines 654 657) the Hoare annotation is: true [2018-01-21 00:42:30,273 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 00:42:30,273 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-21 00:42:30,273 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 672) no Hoare annotation was computed. [2018-01-21 00:42:30,273 INFO L401 ceAbstractionStarter]: For program point L654(lines 654 657) no Hoare annotation was computed. [2018-01-21 00:42:30,273 INFO L401 ceAbstractionStarter]: For program point L658(lines 658 661) no Hoare annotation was computed. [2018-01-21 00:42:30,274 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 672) the Hoare annotation is: true [2018-01-21 00:42:30,274 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 640) the Hoare annotation is: true [2018-01-21 00:42:30,274 INFO L401 ceAbstractionStarter]: For program point L656'(line 656) no Hoare annotation was computed. [2018-01-21 00:42:30,274 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-21 00:42:30,274 INFO L401 ceAbstractionStarter]: For program point L662''(lines 662 663) no Hoare annotation was computed. [2018-01-21 00:42:30,274 INFO L401 ceAbstractionStarter]: For program point L658''''(lines 658 661) no Hoare annotation was computed. [2018-01-21 00:42:30,275 INFO L404 ceAbstractionStarter]: At program point L637'(line 637) the Hoare annotation is: true [2018-01-21 00:42:30,275 INFO L401 ceAbstractionStarter]: For program point L665'(line 665) no Hoare annotation was computed. [2018-01-21 00:42:30,275 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-21 00:42:30,275 INFO L401 ceAbstractionStarter]: For program point L670(line 670) no Hoare annotation was computed. [2018-01-21 00:42:30,275 INFO L401 ceAbstractionStarter]: For program point L641'(line 641) no Hoare annotation was computed. [2018-01-21 00:42:30,276 INFO L401 ceAbstractionStarter]: For program point L641'''(line 641) no Hoare annotation was computed. [2018-01-21 00:42:30,276 INFO L401 ceAbstractionStarter]: For program point L666'(line 666) no Hoare annotation was computed. [2018-01-21 00:42:30,276 INFO L401 ceAbstractionStarter]: For program point L654'(line 654) no Hoare annotation was computed. [2018-01-21 00:42:30,281 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:30,281 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:30,281 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:30,281 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:30,281 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:30,282 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:30,282 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:30,282 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:42:30,282 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-21 00:42:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:42:30,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:30,287 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:42:30,287 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:42:30,293 INFO L82 PathProgramCache]: Analyzing trace with hash 188257, now seen corresponding path program 1 times [2018-01-21 00:42:30,296 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:30,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:30,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,320 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:30,387 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:30,394 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:30,398 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:30,398 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:30,398 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:30,398 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:30,398 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:30,399 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:30,399 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:30,399 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:42:30,399 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-21 00:42:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:42:30,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:30,402 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 00:42:30,403 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1932365681, now seen corresponding path program 1 times [2018-01-21 00:42:30,403 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:30,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:30,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:30,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:30,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:30,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:30,535 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:30,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:30,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:30,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:30,550 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-01-21 00:42:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:30,570 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2018-01-21 00:42:30,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:30,571 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 00:42:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:30,578 INFO L225 Difference]: With dead ends: 116 [2018-01-21 00:42:30,578 INFO L226 Difference]: Without dead ends: 61 [2018-01-21 00:42:30,580 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-21 00:42:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-21 00:42:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-21 00:42:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-01-21 00:42:30,609 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 26 [2018-01-21 00:42:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:30,610 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-01-21 00:42:30,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-01-21 00:42:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 00:42:30,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:30,611 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:30,611 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1521926025, now seen corresponding path program 1 times [2018-01-21 00:42:30,612 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:30,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:30,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,613 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:30,703 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:30,712 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:30,718 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:30,718 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:30,736 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:30,736 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:30,736 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:30,736 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:30,736 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:30,736 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:30,736 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:30,736 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:42:30,737 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-21 00:42:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:42:30,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:30,740 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 00:42:30,740 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1812064646, now seen corresponding path program 1 times [2018-01-21 00:42:30,741 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:30,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:30,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:30,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:30,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:30,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:30,774 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:30,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:30,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:30,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:30,775 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-01-21 00:42:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:30,783 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2018-01-21 00:42:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:30,783 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 00:42:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:30,785 INFO L225 Difference]: With dead ends: 116 [2018-01-21 00:42:30,785 INFO L226 Difference]: Without dead ends: 59 [2018-01-21 00:42:30,786 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-21 00:42:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-21 00:42:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 00:42:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-01-21 00:42:30,793 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 24 [2018-01-21 00:42:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:30,793 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-01-21 00:42:30,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-01-21 00:42:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 00:42:30,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:30,795 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:30,795 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash 314432500, now seen corresponding path program 1 times [2018-01-21 00:42:30,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:30,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:30,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:30,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:30,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:31,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:31,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:42:31,006 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:31,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:42:31,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:42:31,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:42:31,007 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 6 states. [2018-01-21 00:42:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:31,335 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-01-21 00:42:31,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:42:31,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-21 00:42:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:31,338 INFO L225 Difference]: With dead ends: 118 [2018-01-21 00:42:31,338 INFO L226 Difference]: Without dead ends: 114 [2018-01-21 00:42:31,339 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:42:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-21 00:42:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2018-01-21 00:42:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-21 00:42:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-01-21 00:42:31,348 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 36 [2018-01-21 00:42:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:31,349 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-01-21 00:42:31,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:42:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-01-21 00:42:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 00:42:31,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:31,350 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] [2018-01-21 00:42:31,350 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash 721961098, now seen corresponding path program 1 times [2018-01-21 00:42:31,350 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:31,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:31,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:31,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:31,351 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:31,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:31,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:42:31,740 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:42:31,741 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-21 00:42:31,743 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [25], [46], [48], [51], [57], [76], [77], [78], [82], [84], [87], [97], [99], [102], [110], [117], [119], [123], [125], [128], [130], [131], [132], [133], [134], [138], [139], [141], [147], [148], [160], [161], [162] [2018-01-21 00:42:31,791 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:42:31,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:42:32,056 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 Int Bool) 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 Int Bool) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 00:42:32,060 INFO L168 Benchmark]: Toolchain (without parser) took 2639.08 ms. Allocated memory was 306.7 MB in the beginning and 480.2 MB in the end (delta: 173.5 MB). Free memory was 264.6 MB in the beginning and 419.9 MB in the end (delta: -155.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:32,062 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 306.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:42:32,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.82 ms. Allocated memory is still 306.7 MB. Free memory was 263.6 MB in the beginning and 252.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:32,062 INFO L168 Benchmark]: Boogie Preprocessor took 43.65 ms. Allocated memory is still 306.7 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:32,063 INFO L168 Benchmark]: RCFGBuilder took 395.96 ms. Allocated memory is still 306.7 MB. Free memory was 250.5 MB in the beginning and 226.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:32,063 INFO L168 Benchmark]: TraceAbstraction took 1971.24 ms. Allocated memory was 306.7 MB in the beginning and 480.2 MB in the end (delta: 173.5 MB). Free memory was 226.5 MB in the beginning and 419.9 MB in the end (delta: -193.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:42:32,065 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.17 ms. Allocated memory is still 306.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.82 ms. Allocated memory is still 306.7 MB. Free memory was 263.6 MB in the beginning and 252.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.65 ms. Allocated memory is still 306.7 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 395.96 ms. Allocated memory is still 306.7 MB. Free memory was 250.5 MB in the beginning and 226.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1971.24 ms. Allocated memory was 306.7 MB in the beginning and 480.2 MB in the end (delta: 173.5 MB). Free memory was 226.5 MB in the beginning and 419.9 MB in the end (delta: -193.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: exitErr0EnsuresViolation CFG has 4 procedures, 73 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred 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: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 13 PreInvPairs, 13 NumberOfFragments, 11 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 73 locations, 4 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=70occurred 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: [L627] int i = 0; [L628] int y = 0; VAL [i=0, y=0] [L629] EXPR, FCALL malloc(sizeof(struct node)) VAL [i=0, malloc(sizeof(struct node))={13:0}, y=0] [L629] List a = (List) malloc(sizeof(struct node)); VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, y=0] [L630] COND FALSE !(a == 0) VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, y=0] [L631] List t; [L632] List p = a; VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={13:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0] [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L650] FCALL p->n = 0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L651] i = 0 [L652] y = 0 [L653] p = a VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L654] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=3, y=0] [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=3, y=0] [L658] COND FALSE !(p->h == 2) [L662] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=3, y=0] [L662] COND FALSE !(p->h != 3 || (i + y) > 20) [L664] p = a VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L665] EXPR, FCALL p->n VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}, y=0] [L665] COND FALSE !(p->n != 0) [L670] FCALL free(p) VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L671] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 73 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Int Bool) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Int Bool): 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/list-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-42-32-074.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-42-32-074.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-42-32-074.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-42-32-074.csv Received shutdown request...