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_smtcomp.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:26:42,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:26:42,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:26:42,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:26:42,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:26:42,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:26:42,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:26:42,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:26:42,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:26:42,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:26:42,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:26:42,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:26:42,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:26:42,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:26:42,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:26:42,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:26:42,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:26:42,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:26:42,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:26:42,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:26:42,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:26:42,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:26:42,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:26:42,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:26:42,108 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:26:42,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:26:42,110 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:26:42,110 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:26:42,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:26:42,111 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:26:42,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:26:42,112 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_smtcomp.epf [2018-01-21 10:26:42,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:26:42,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:26:42,121 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:26:42,121 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:26:42,121 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:26:42,121 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:26:42,122 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:26:42,122 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:26:42,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:26:42,122 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:26:42,123 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:26:42,123 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:26:42,123 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:26:42,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:26:42,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:26:42,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:26:42,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:26:42,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:26:42,124 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:26:42,124 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:26:42,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:26:42,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:26:42,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:26:42,125 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:26:42,125 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:26:42,125 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:26:42,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:26:42,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:26:42,125 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:26:42,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:26:42,126 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:26:42,126 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:26:42,126 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:26:42,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:26:42,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:26:42,126 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:26:42,126 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:26:42,127 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:26:42,127 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:26:42,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:26:42,172 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:26:42,176 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:26:42,177 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:26:42,177 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:26:42,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-01-21 10:26:42,338 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:26:42,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:26:42,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:26:42,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:26:42,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:26:42,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27608974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42, skipping insertion in model container [2018-01-21 10:26:42,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,367 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:26:42,406 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:26:42,543 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:26:42,568 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:26:42,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42 WrapperNode [2018-01-21 10:26:42,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:26:42,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:26:42,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:26:42,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:26:42,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (1/1) ... [2018-01-21 10:26:42,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:26:42,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:26:42,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:26:42,624 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:26:42,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (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 10:26:42,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:26:42,677 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:26:42,677 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:26:42,677 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:26:42,677 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:26:42,677 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:26:42,677 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:26:42,677 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:26:42,678 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:26:42,678 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:26:42,678 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:26:42,678 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:26:42,678 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 10:26:42,678 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:26:42,679 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:26:42,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:26:42,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:26:43,071 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:26:43,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:26:43 BoogieIcfgContainer [2018-01-21 10:26:43,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:26:43,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:26:43,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:26:43,074 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:26:43,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:26:42" (1/3) ... [2018-01-21 10:26:43,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d068ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:26:43, skipping insertion in model container [2018-01-21 10:26:43,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:42" (2/3) ... [2018-01-21 10:26:43,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d068ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:26:43, skipping insertion in model container [2018-01-21 10:26:43,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:26:43" (3/3) ... [2018-01-21 10:26:43,077 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-01-21 10:26:43,083 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:26:43,090 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 10:26:43,140 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:43,140 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:43,140 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:43,140 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:43,140 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:43,140 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:43,140 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:43,141 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:26:43,141 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 10:26:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:26:43,164 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:43,164 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:26:43,165 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:26:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash 217246, now seen corresponding path program 1 times [2018-01-21 10:26:43,171 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:43,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:43,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,218 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:43,272 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:26:43,278 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:43,285 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:43,285 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:43,285 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:43,285 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:43,285 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:43,285 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:43,285 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:43,285 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:26:43,286 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 10:26:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 10:26:43,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:43,290 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:43,290 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:26:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash 843511722, now seen corresponding path program 1 times [2018-01-21 10:26:43,290 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:43,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:43,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:43,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:43,344 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 10:26:43,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:43,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:26:43,347 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:43,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:26:43,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:26:43,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:26:43,445 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-01-21 10:26:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:43,473 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2018-01-21 10:26:43,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:26:43,475 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-21 10:26:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:43,486 INFO L225 Difference]: With dead ends: 175 [2018-01-21 10:26:43,486 INFO L226 Difference]: Without dead ends: 88 [2018-01-21 10:26:43,489 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 10:26:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-21 10:26:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-21 10:26:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-21 10:26:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2018-01-21 10:26:43,526 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 11 [2018-01-21 10:26:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:43,527 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2018-01-21 10:26:43,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:26:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2018-01-21 10:26:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 10:26:43,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:43,528 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:43,528 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:26:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash -578790635, now seen corresponding path program 1 times [2018-01-21 10:26:43,528 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:43,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:43,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,530 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:43,566 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:26:43,570 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:43,571 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:43,572 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:43,580 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:43,580 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:43,580 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:43,580 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:43,580 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:43,580 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:43,581 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:43,581 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:26:43,581 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-21 10:26:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-21 10:26:43,584 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:43,584 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:43,584 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1681322799, now seen corresponding path program 1 times [2018-01-21 10:26:43,585 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:43,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:43,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,586 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:43,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:43,605 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 10:26:43,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:43,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:26:43,606 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:43,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:26:43,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:26:43,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:26:43,607 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-01-21 10:26:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:43,617 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2018-01-21 10:26:43,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:26:43,618 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-21 10:26:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:43,619 INFO L225 Difference]: With dead ends: 175 [2018-01-21 10:26:43,620 INFO L226 Difference]: Without dead ends: 86 [2018-01-21 10:26:43,621 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 10:26:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-21 10:26:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-21 10:26:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-21 10:26:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2018-01-21 10:26:43,630 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 9 [2018-01-21 10:26:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:43,630 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2018-01-21 10:26:43,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:26:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2018-01-21 10:26:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-21 10:26:43,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:43,631 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:43,631 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1430768294, now seen corresponding path program 1 times [2018-01-21 10:26:43,632 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:43,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:43,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:43,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:43,681 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 10:26:43,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:43,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:26:43,682 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:43,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:26:43,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:26:43,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:26:43,683 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 3 states. [2018-01-21 10:26:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:43,726 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2018-01-21 10:26:43,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:26:43,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-21 10:26:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:43,729 INFO L225 Difference]: With dead ends: 111 [2018-01-21 10:26:43,730 INFO L226 Difference]: Without dead ends: 109 [2018-01-21 10:26:43,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:26:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-21 10:26:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2018-01-21 10:26:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-21 10:26:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-01-21 10:26:43,738 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 12 [2018-01-21 10:26:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:43,738 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-01-21 10:26:43,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:26:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-01-21 10:26:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 10:26:43,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:43,739 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 10:26:43,739 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:43,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1220894246, now seen corresponding path program 1 times [2018-01-21 10:26:43,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:43,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:43,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:43,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:43,804 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 10:26:43,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:43,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:26:43,805 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:43,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:26:43,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:26:43,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:26:43,806 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 3 states. [2018-01-21 10:26:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:43,853 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2018-01-21 10:26:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:26:43,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-21 10:26:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:43,855 INFO L225 Difference]: With dead ends: 186 [2018-01-21 10:26:43,855 INFO L226 Difference]: Without dead ends: 105 [2018-01-21 10:26:43,856 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:26:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-21 10:26:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-01-21 10:26:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 10:26:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2018-01-21 10:26:43,864 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 21 [2018-01-21 10:26:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:43,865 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2018-01-21 10:26:43,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:26:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2018-01-21 10:26:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:26:43,866 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:43,866 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:43,866 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash 354796251, now seen corresponding path program 1 times [2018-01-21 10:26:43,867 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:43,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:43,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:43,868 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:43,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:26:43,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:43,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:26:43,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:43,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:26:43,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:26:43,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:26:43,976 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 5 states. [2018-01-21 10:26:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:44,050 INFO L93 Difference]: Finished difference Result 265 states and 312 transitions. [2018-01-21 10:26:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:26:44,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-21 10:26:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:44,053 INFO L225 Difference]: With dead ends: 265 [2018-01-21 10:26:44,053 INFO L226 Difference]: Without dead ends: 182 [2018-01-21 10:26:44,054 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:26:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-21 10:26:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 103. [2018-01-21 10:26:44,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 10:26:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-01-21 10:26:44,063 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 30 [2018-01-21 10:26:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:44,064 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-01-21 10:26:44,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:26:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-01-21 10:26:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 10:26:44,065 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:44,065 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:44,065 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash -626570212, now seen corresponding path program 1 times [2018-01-21 10:26:44,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:44,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:44,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:44,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:44,067 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:44,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:26:44,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:44,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:26:44,149 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:44,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:26:44,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:26:44,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:26:44,150 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 5 states. [2018-01-21 10:26:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:44,264 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2018-01-21 10:26:44,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 10:26:44,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-21 10:26:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:44,266 INFO L225 Difference]: With dead ends: 237 [2018-01-21 10:26:44,266 INFO L226 Difference]: Without dead ends: 157 [2018-01-21 10:26:44,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-21 10:26:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-21 10:26:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 103. [2018-01-21 10:26:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 10:26:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-01-21 10:26:44,276 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 31 [2018-01-21 10:26:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:44,277 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-01-21 10:26:44,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:26:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-01-21 10:26:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 10:26:44,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:44,279 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:44,279 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash 85377444, now seen corresponding path program 1 times [2018-01-21 10:26:44,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:44,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:44,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:44,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:44,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:44,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:26:44,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:44,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:26:44,343 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:44,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:26:44,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:26:44,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:26:44,344 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 4 states. [2018-01-21 10:26:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:44,379 INFO L93 Difference]: Finished difference Result 262 states and 298 transitions. [2018-01-21 10:26:44,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:26:44,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-21 10:26:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:44,380 INFO L225 Difference]: With dead ends: 262 [2018-01-21 10:26:44,380 INFO L226 Difference]: Without dead ends: 175 [2018-01-21 10:26:44,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:26:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-21 10:26:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 104. [2018-01-21 10:26:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-21 10:26:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-01-21 10:26:44,390 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 40 [2018-01-21 10:26:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:44,390 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-01-21 10:26:44,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:26:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-01-21 10:26:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 10:26:44,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:44,392 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:44,393 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:44,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1217411263, now seen corresponding path program 1 times [2018-01-21 10:26:44,393 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:44,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:44,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:44,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:44,395 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:44,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:26:44,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:44,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-21 10:26:44,802 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:44,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 10:26:44,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 10:26:44,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-21 10:26:44,803 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 10 states. [2018-01-21 10:26:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:45,280 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-01-21 10:26:45,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 10:26:45,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-21 10:26:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:45,282 INFO L225 Difference]: With dead ends: 168 [2018-01-21 10:26:45,282 INFO L226 Difference]: Without dead ends: 165 [2018-01-21 10:26:45,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-01-21 10:26:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-21 10:26:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2018-01-21 10:26:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-21 10:26:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2018-01-21 10:26:45,293 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 42 [2018-01-21 10:26:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:45,294 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2018-01-21 10:26:45,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 10:26:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2018-01-21 10:26:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 10:26:45,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:45,297 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:45,297 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:45,297 INFO L82 PathProgramCache]: Analyzing trace with hash -456231378, now seen corresponding path program 1 times [2018-01-21 10:26:45,297 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:45,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:45,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:45,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:45,299 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:45,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:45,898 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 48 DAG size of output 29 [2018-01-21 10:26:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:26:46,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:26:46,100 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:26:46,101 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-21 10:26:46,104 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [30], [36], [37], [43], [44], [48], [49], [58], [59], [60], [62], [63], [70], [74], [76], [79], [144], [145], [146], [150], [154], [156], [157], [158], [159], [160], [167], [174], [179], [181], [182], [183], [189], [190], [191] [2018-01-21 10:26:46,164 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:26:46,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:27:13,945 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 10:27:13,948 INFO L168 Benchmark]: Toolchain (without parser) took 31609.46 ms. Allocated memory was 303.0 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 260.4 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 338.8 MB. Max. memory is 5.3 GB. [2018-01-21 10:27:13,949 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 303.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:27:13,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.40 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 248.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:27:13,949 INFO L168 Benchmark]: Boogie Preprocessor took 44.78 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:27:13,950 INFO L168 Benchmark]: RCFGBuilder took 447.52 ms. Allocated memory is still 303.0 MB. Free memory was 246.3 MB in the beginning and 217.8 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. [2018-01-21 10:27:13,950 INFO L168 Benchmark]: TraceAbstraction took 30875.13 ms. Allocated memory was 303.0 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 217.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 296.2 MB. Max. memory is 5.3 GB. [2018-01-21 10:27:13,952 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.15 ms. Allocated memory is still 303.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 235.40 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 248.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.78 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 447.52 ms. Allocated memory is still 303.0 MB. Free memory was 246.3 MB in the beginning and 217.8 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 30875.13 ms. Allocated memory was 303.0 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 217.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 296.2 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, 91 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=91occurred 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: [L629] struct TLItem* data = ((void *)0); [L630] struct DItem* item, * item2; [L631] struct TLItem *lItem; [L632] int c1 = 0; VAL [c1=0, data={0:0}] [L633] c1 < 5 && __VERIFIER_nondet_int() [L633] c1 < 5 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, c1=0, c1 < 5 && __VERIFIER_nondet_int()=0, data={0:0}] [L633] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L657] COND TRUE !data [L658] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 91 locations, 3 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 105 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=91occurred 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.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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 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/test-0513_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-27-13-959.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-27-13-959.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-27-13-959.csv Received shutdown request...