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/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:32:56,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:32:56,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:32:56,216 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:32:56,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:32:56,217 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:32:56,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:32:56,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:32:56,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:32:56,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:32:56,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:32:56,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:32:56,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:32:56,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:32:56,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:32:56,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:32:56,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:32:56,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:32:56,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:32:56,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:32:56,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:32:56,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:32:56,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:32:56,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:32:56,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:32:56,242 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:32:56,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:32:56,243 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:32:56,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:32:56,243 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:32:56,244 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:32:56,244 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:32:56,253 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:32:56,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:32:56,254 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:32:56,254 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:32:56,254 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:32:56,254 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:32:56,254 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:32:56,255 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:32:56,255 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:32:56,255 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:32:56,255 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:32:56,255 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:32:56,256 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:32:56,256 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:32:56,256 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:32:56,256 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:32:56,256 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:32:56,256 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:32:56,256 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:32:56,256 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:32:56,257 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:32:56,257 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:32:56,257 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:32:56,257 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:32:56,257 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:32:56,258 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:32:56,258 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:32:56,258 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:32:56,258 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:32:56,258 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:32:56,258 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:32:56,258 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:32:56,258 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:32:56,259 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:32:56,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:32:56,259 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:32:56,259 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:32:56,260 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:32:56,260 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:32:56,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:32:56,301 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:32:56,315 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:32:56,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:32:56,317 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:32:56,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-01-21 00:32:56,477 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:32:56,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:32:56,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:32:56,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:32:56,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:32:56,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4b61a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56, skipping insertion in model container [2018-01-21 00:32:56,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,504 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:32:56,542 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:32:56,664 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:32:56,689 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:32:56,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56 WrapperNode [2018-01-21 00:32:56,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:32:56,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:32:56,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:32:56,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:32:56,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (1/1) ... [2018-01-21 00:32:56,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:32:56,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:32:56,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:32:56,744 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:32:56,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:32:56,796 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:32:56,796 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:32:56,796 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-21 00:32:56,796 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-21 00:32:56,796 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-21 00:32:56,797 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-21 00:32:56,797 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-21 00:32:56,797 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-21 00:32:56,797 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-21 00:32:56,797 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-21 00:32:56,797 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:32:56,798 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:32:56,798 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:32:56,798 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:32:56,798 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:32:56,798 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:32:56,798 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-21 00:32:56,799 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-21 00:32:56,800 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-21 00:32:56,800 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-21 00:32:56,800 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:32:56,800 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:32:56,800 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:32:57,148 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:32:57,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:32:57 BoogieIcfgContainer [2018-01-21 00:32:57,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:32:57,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:32:57,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:32:57,152 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:32:57,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:32:56" (1/3) ... [2018-01-21 00:32:57,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b742a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:32:57, skipping insertion in model container [2018-01-21 00:32:57,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:56" (2/3) ... [2018-01-21 00:32:57,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b742a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:32:57, skipping insertion in model container [2018-01-21 00:32:57,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:32:57" (3/3) ... [2018-01-21 00:32:57,155 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-21 00:32:57,162 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:32:57,168 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-21 00:32:57,207 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:57,207 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:57,207 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:57,207 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:57,207 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:57,207 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:57,208 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:57,208 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == __list_addErr0EnsuresViolation======== [2018-01-21 00:32:57,208 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:32:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:32:57,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:57,234 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] [2018-01-21 00:32:57,234 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr0EnsuresViolation]=== [2018-01-21 00:32:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1080187328, now seen corresponding path program 1 times [2018-01-21 00:32:57,239 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:57,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:57,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:57,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:57,450 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:32:57,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:57,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:32:57,453 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:57,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:32:57,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:32:57,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:32:57,554 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:32:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:57,586 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:32:57,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:32:57,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-21 00:32:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:57,593 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:32:57,593 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:32:57,598 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:32:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:32:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:32:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:32:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:32:57,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-21 00:32:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:57,619 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:32:57,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:32:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:32:57,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:32:57,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:32:57,681 INFO L401 ceAbstractionStarter]: For program point L627'(line 627) no Hoare annotation was computed. [2018-01-21 00:32:57,682 INFO L401 ceAbstractionStarter]: For program point __list_addErr0EnsuresViolation(lines 623 631) no Hoare annotation was computed. [2018-01-21 00:32:57,682 INFO L401 ceAbstractionStarter]: For program point __list_addEXIT(lines 623 631) no Hoare annotation was computed. [2018-01-21 00:32:57,682 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 00:32:57,682 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-21 00:32:57,682 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-21 00:32:57,682 INFO L404 ceAbstractionStarter]: At program point __list_addENTRY(lines 623 631) the Hoare annotation is: true [2018-01-21 00:32:57,682 INFO L401 ceAbstractionStarter]: For program point __list_addFINAL(lines 623 631) no Hoare annotation was computed. [2018-01-21 00:32:57,682 INFO L401 ceAbstractionStarter]: For program point insert_subFINAL(lines 664 671) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L401 ceAbstractionStarter]: For program point L667(lines 667 668) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L401 ceAbstractionStarter]: For program point L666(line 666) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L401 ceAbstractionStarter]: For program point L667''(lines 667 668) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L401 ceAbstractionStarter]: For program point insert_subErr0EnsuresViolation(lines 664 671) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L404 ceAbstractionStarter]: At program point L669(line 669) the Hoare annotation is: true [2018-01-21 00:32:57,683 INFO L401 ceAbstractionStarter]: For program point insert_subEXIT(lines 664 671) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L404 ceAbstractionStarter]: At program point insert_subENTRY(lines 664 671) the Hoare annotation is: true [2018-01-21 00:32:57,683 INFO L401 ceAbstractionStarter]: For program point L666'(line 666) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 701) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 701) no Hoare annotation was computed. [2018-01-21 00:32:57,683 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 701) the Hoare annotation is: true [2018-01-21 00:32:57,684 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 701) no Hoare annotation was computed. [2018-01-21 00:32:57,684 INFO L404 ceAbstractionStarter]: At program point L692(line 692) the Hoare annotation is: true [2018-01-21 00:32:57,684 INFO L401 ceAbstractionStarter]: For program point L691(lines 691 693) no Hoare annotation was computed. [2018-01-21 00:32:57,684 INFO L404 ceAbstractionStarter]: At program point L691''(lines 691 693) the Hoare annotation is: true [2018-01-21 00:32:57,684 INFO L401 ceAbstractionStarter]: For program point create_topErr0EnsuresViolation(lines 689 694) no Hoare annotation was computed. [2018-01-21 00:32:57,684 INFO L404 ceAbstractionStarter]: At program point create_topENTRY(lines 689 694) the Hoare annotation is: true [2018-01-21 00:32:57,684 INFO L401 ceAbstractionStarter]: For program point create_topEXIT(lines 689 694) no Hoare annotation was computed. [2018-01-21 00:32:57,685 INFO L401 ceAbstractionStarter]: For program point L692'(line 692) no Hoare annotation was computed. [2018-01-21 00:32:57,685 INFO L401 ceAbstractionStarter]: For program point L691'''(lines 691 693) no Hoare annotation was computed. [2018-01-21 00:32:57,685 INFO L401 ceAbstractionStarter]: For program point insert_topErr0EnsuresViolation(lines 680 688) no Hoare annotation was computed. [2018-01-21 00:32:57,685 INFO L404 ceAbstractionStarter]: At program point L685(line 685) the Hoare annotation is: true [2018-01-21 00:32:57,685 INFO L401 ceAbstractionStarter]: For program point L683(lines 683 684) no Hoare annotation was computed. [2018-01-21 00:32:57,685 INFO L404 ceAbstractionStarter]: At program point L683''(lines 683 684) the Hoare annotation is: true [2018-01-21 00:32:57,685 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-21 00:32:57,685 INFO L401 ceAbstractionStarter]: For program point L682'(line 682) no Hoare annotation was computed. [2018-01-21 00:32:57,686 INFO L404 ceAbstractionStarter]: At program point L686(line 686) the Hoare annotation is: true [2018-01-21 00:32:57,686 INFO L404 ceAbstractionStarter]: At program point insert_topENTRY(lines 680 688) the Hoare annotation is: true [2018-01-21 00:32:57,686 INFO L401 ceAbstractionStarter]: For program point insert_topEXIT(lines 680 688) no Hoare annotation was computed. [2018-01-21 00:32:57,686 INFO L401 ceAbstractionStarter]: For program point insert_topFINAL(lines 680 688) no Hoare annotation was computed. [2018-01-21 00:32:57,686 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 00:32:57,686 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-21 00:32:57,686 INFO L401 ceAbstractionStarter]: For program point destroy_subErr0EnsuresViolation(lines 645 653) no Hoare annotation was computed. [2018-01-21 00:32:57,686 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-21 00:32:57,687 INFO L401 ceAbstractionStarter]: For program point L648(lines 648 652) no Hoare annotation was computed. [2018-01-21 00:32:57,687 INFO L404 ceAbstractionStarter]: At program point destroy_subENTRY(lines 645 653) the Hoare annotation is: true [2018-01-21 00:32:57,687 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-21 00:32:57,687 INFO L404 ceAbstractionStarter]: At program point L648''(lines 648 652) the Hoare annotation is: true [2018-01-21 00:32:57,687 INFO L401 ceAbstractionStarter]: For program point L648'''(lines 648 652) no Hoare annotation was computed. [2018-01-21 00:32:57,687 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-21 00:32:57,687 INFO L401 ceAbstractionStarter]: For program point L647'(line 647) no Hoare annotation was computed. [2018-01-21 00:32:57,687 INFO L401 ceAbstractionStarter]: For program point destroy_subEXIT(lines 645 653) no Hoare annotation was computed. [2018-01-21 00:32:57,687 INFO L401 ceAbstractionStarter]: For program point L676'''(lines 676 678) no Hoare annotation was computed. [2018-01-21 00:32:57,687 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-21 00:32:57,688 INFO L401 ceAbstractionStarter]: For program point L674'(line 674) no Hoare annotation was computed. [2018-01-21 00:32:57,688 INFO L404 ceAbstractionStarter]: At program point L677(line 677) the Hoare annotation is: true [2018-01-21 00:32:57,688 INFO L401 ceAbstractionStarter]: For program point L676(lines 676 678) no Hoare annotation was computed. [2018-01-21 00:32:57,688 INFO L404 ceAbstractionStarter]: At program point L676''(lines 676 678) the Hoare annotation is: true [2018-01-21 00:32:57,688 INFO L401 ceAbstractionStarter]: For program point create_sub_listEXIT(lines 672 679) no Hoare annotation was computed. [2018-01-21 00:32:57,688 INFO L404 ceAbstractionStarter]: At program point create_sub_listENTRY(lines 672 679) the Hoare annotation is: true [2018-01-21 00:32:57,688 INFO L401 ceAbstractionStarter]: For program point create_sub_listErr0EnsuresViolation(lines 672 679) no Hoare annotation was computed. [2018-01-21 00:32:57,689 INFO L401 ceAbstractionStarter]: For program point L677'(line 677) no Hoare annotation was computed. [2018-01-21 00:32:57,689 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 701) the Hoare annotation is: true [2018-01-21 00:32:57,689 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 701) no Hoare annotation was computed. [2018-01-21 00:32:57,689 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 701) the Hoare annotation is: true [2018-01-21 00:32:57,689 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 701) no Hoare annotation was computed. [2018-01-21 00:32:57,689 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 701) no Hoare annotation was computed. [2018-01-21 00:32:57,689 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 695 701) the Hoare annotation is: true [2018-01-21 00:32:57,690 INFO L401 ceAbstractionStarter]: For program point L697'''(line 697) no Hoare annotation was computed. [2018-01-21 00:32:57,690 INFO L401 ceAbstractionStarter]: For program point L697'(line 697) no Hoare annotation was computed. [2018-01-21 00:32:57,690 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 695 701) no Hoare annotation was computed. [2018-01-21 00:32:57,690 INFO L401 ceAbstractionStarter]: For program point L699(line 699) no Hoare annotation was computed. [2018-01-21 00:32:57,690 INFO L404 ceAbstractionStarter]: At program point L698(line 698) the Hoare annotation is: true [2018-01-21 00:32:57,690 INFO L401 ceAbstractionStarter]: For program point L697(line 697) no Hoare annotation was computed. [2018-01-21 00:32:57,690 INFO L404 ceAbstractionStarter]: At program point L697''(line 697) the Hoare annotation is: true [2018-01-21 00:32:57,690 INFO L401 ceAbstractionStarter]: For program point L697''''(line 697) no Hoare annotation was computed. [2018-01-21 00:32:57,691 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 695 701) no Hoare annotation was computed. [2018-01-21 00:32:57,691 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 695 701) no Hoare annotation was computed. [2018-01-21 00:32:57,691 INFO L401 ceAbstractionStarter]: For program point list_add_tailEXIT(lines 632 635) no Hoare annotation was computed. [2018-01-21 00:32:57,691 INFO L404 ceAbstractionStarter]: At program point L634'(line 634) the Hoare annotation is: true [2018-01-21 00:32:57,691 INFO L401 ceAbstractionStarter]: For program point list_add_tailFINAL(lines 632 635) no Hoare annotation was computed. [2018-01-21 00:32:57,691 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-21 00:32:57,691 INFO L401 ceAbstractionStarter]: For program point L634''(line 634) no Hoare annotation was computed. [2018-01-21 00:32:57,692 INFO L404 ceAbstractionStarter]: At program point list_add_tailENTRY(lines 632 635) the Hoare annotation is: true [2018-01-21 00:32:57,692 INFO L401 ceAbstractionStarter]: For program point list_add_tailErr0EnsuresViolation(lines 632 635) no Hoare annotation was computed. [2018-01-21 00:32:57,692 INFO L401 ceAbstractionStarter]: For program point destroy_topErr0EnsuresViolation(lines 654 663) no Hoare annotation was computed. [2018-01-21 00:32:57,692 INFO L401 ceAbstractionStarter]: For program point L660(line 660) no Hoare annotation was computed. [2018-01-21 00:32:57,692 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-21 00:32:57,692 INFO L404 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: true [2018-01-21 00:32:57,692 INFO L401 ceAbstractionStarter]: For program point L658(line 658) no Hoare annotation was computed. [2018-01-21 00:32:57,692 INFO L404 ceAbstractionStarter]: At program point L657''(lines 657 662) the Hoare annotation is: true [2018-01-21 00:32:57,693 INFO L401 ceAbstractionStarter]: For program point L657(lines 657 662) no Hoare annotation was computed. [2018-01-21 00:32:57,693 INFO L401 ceAbstractionStarter]: For program point L659'(line 659) no Hoare annotation was computed. [2018-01-21 00:32:57,693 INFO L401 ceAbstractionStarter]: For program point L658'(line 658) no Hoare annotation was computed. [2018-01-21 00:32:57,693 INFO L401 ceAbstractionStarter]: For program point L656'(line 656) no Hoare annotation was computed. [2018-01-21 00:32:57,693 INFO L401 ceAbstractionStarter]: For program point L657'''(lines 657 662) no Hoare annotation was computed. [2018-01-21 00:32:57,693 INFO L404 ceAbstractionStarter]: At program point destroy_topENTRY(lines 654 663) the Hoare annotation is: true [2018-01-21 00:32:57,693 INFO L401 ceAbstractionStarter]: For program point destroy_topEXIT(lines 654 663) no Hoare annotation was computed. [2018-01-21 00:32:57,697 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:57,697 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:57,698 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:57,698 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:57,698 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:57,698 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:57,698 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:57,698 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_subErr0EnsuresViolation======== [2018-01-21 00:32:57,698 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:57,701 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:32:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:32:57,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:57,704 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, 1, 1, 1, 1] [2018-01-21 00:32:57,704 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_subErr0EnsuresViolation]=== [2018-01-21 00:32:57,705 INFO L82 PathProgramCache]: Analyzing trace with hash -630072835, now seen corresponding path program 1 times [2018-01-21 00:32:57,705 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:57,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:57,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,706 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:57,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:57,775 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:32:57,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:57,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:32:57,776 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:57,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:32:57,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:32:57,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:32:57,777 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:32:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:57,791 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:32:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:32:57,791 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-01-21 00:32:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:57,795 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:32:57,796 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 00:32:57,797 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:32:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 00:32:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 00:32:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:32:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-21 00:32:57,815 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 42 [2018-01-21 00:32:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:57,816 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-21 00:32:57,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:32:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-21 00:32:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:32:57,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:57,819 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, 1, 1, 1, 1] [2018-01-21 00:32:57,819 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_subErr0EnsuresViolation]=== [2018-01-21 00:32:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2076546559, now seen corresponding path program 1 times [2018-01-21 00:32:57,819 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:57,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:57,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:32:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:32:57,950 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:32:57,961 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:32:57,967 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:32:57,967 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:32:57,968 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:32:57,979 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:57,979 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:57,979 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:57,979 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:57,979 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:57,979 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:57,980 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:57,980 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:32:57,980 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:32:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:32:57,982 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:57,982 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:32:57,982 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:32:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash 186785, now seen corresponding path program 1 times [2018-01-21 00:32:57,982 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:57,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:57,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,983 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:32:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:32:57,990 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:32:57,991 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:32:57,993 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:57,994 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:57,994 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:57,994 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:57,994 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:57,994 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:57,994 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:57,994 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_topErr0EnsuresViolation======== [2018-01-21 00:32:57,994 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:32:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-21 00:32:57,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:57,997 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:32:57,997 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_topErr0EnsuresViolation]=== [2018-01-21 00:32:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash 194822873, now seen corresponding path program 1 times [2018-01-21 00:32:57,998 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:57,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:57,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:57,999 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:58,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:58,016 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:32:58,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:58,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:32:58,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:58,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:32:58,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:32:58,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:32:58,018 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:32:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:58,029 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:32:58,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:32:58,030 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-21 00:32:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:58,030 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:32:58,031 INFO L226 Difference]: Without dead ends: 55 [2018-01-21 00:32:58,031 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:32:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-21 00:32:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-21 00:32:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 00:32:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-21 00:32:58,036 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 12 [2018-01-21 00:32:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:58,037 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-21 00:32:58,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:32:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-21 00:32:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-21 00:32:58,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:58,039 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-21 00:32:58,039 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_topErr0EnsuresViolation]=== [2018-01-21 00:32:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 797717174, now seen corresponding path program 1 times [2018-01-21 00:32:58,040 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:58,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:58,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:58,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:58,040 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:58,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:32:58,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:32:58,179 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:32:58,180 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-01-21 00:32:58,183 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [101], [102], [104], [108], [111], [114], [121], [122], [123], [124], [129], [134], [140], [141], [142], [143], [144], [148], [149], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162] [2018-01-21 00:32:58,245 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:32:58,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:32:58,777 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:32:58,778 INFO L268 AbstractInterpreter]: Visited 56 different actions 97 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:32:58,810 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:32:58,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:32:58,811 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:32:58,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:58,823 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:32:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:58,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:32:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-21 00:32:58,956 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:32:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-21 00:32:59,190 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:32:59,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 4 [2018-01-21 00:32:59,190 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:59,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:32:59,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:32:59,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:32:59,191 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 3 states. [2018-01-21 00:32:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:59,245 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-21 00:32:59,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:32:59,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-01-21 00:32:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:59,248 INFO L225 Difference]: With dead ends: 55 [2018-01-21 00:32:59,248 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:32:59,249 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:32:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:32:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:32:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:32:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:32:59,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2018-01-21 00:32:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:59,251 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:32:59,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:32:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:32:59,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:32:59,253 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:59,253 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:59,253 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:59,254 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:59,254 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:59,254 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:59,254 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:59,254 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_topErr0EnsuresViolation======== [2018-01-21 00:32:59,254 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:32:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-21 00:32:59,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:59,260 INFO L322 BasicCegarLoop]: trace histogram [2, 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] [2018-01-21 00:32:59,260 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_topErr0EnsuresViolation]=== [2018-01-21 00:32:59,260 INFO L82 PathProgramCache]: Analyzing trace with hash -127396070, now seen corresponding path program 1 times [2018-01-21 00:32:59,260 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:59,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:59,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:59,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:59,262 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:59,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 00:32:59,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:32:59,304 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:32:59,305 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-01-21 00:32:59,305 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [42], [43], [44], [58], [60], [62], [63], [64], [72], [73], [75], [76], [101], [102], [104], [108], [122], [123], [124], [129], [135], [144], [148], [149], [152], [154], [155], [156], [157], [158], [159], [160], [161], [162] [2018-01-21 00:32:59,307 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:32:59,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:32:59,392 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:32:59,392 INFO L268 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-01-21 00:32:59,412 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:32:59,519 INFO L232 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 57.84% of their original sizes. [2018-01-21 00:32:59,519 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:32:59,808 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:32:59,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:32:59,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [2] total 17 [2018-01-21 00:32:59,809 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:59,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-21 00:32:59,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-21 00:32:59,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-01-21 00:32:59,810 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 17 states. [2018-01-21 00:33:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:03,303 INFO L93 Difference]: Finished difference Result 204 states and 253 transitions. [2018-01-21 00:33:03,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-21 00:33:03,303 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-01-21 00:33:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:03,307 INFO L225 Difference]: With dead ends: 204 [2018-01-21 00:33:03,307 INFO L226 Difference]: Without dead ends: 66 [2018-01-21 00:33:03,308 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2018-01-21 00:33:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-21 00:33:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2018-01-21 00:33:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:33:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-21 00:33:03,321 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 45 [2018-01-21 00:33:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:03,322 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-21 00:33:03,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-21 00:33:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-21 00:33:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-21 00:33:03,324 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:03,324 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-21 00:33:03,324 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_topErr0EnsuresViolation]=== [2018-01-21 00:33:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1858165626, now seen corresponding path program 1 times [2018-01-21 00:33:03,324 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:03,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:03,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:03,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:03,325 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:03,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:33:03,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:03,453 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:33:03,453 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-01-21 00:33:03,454 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [101], [102], [104], [108], [122], [123], [124], [129], [135], [140], [141], [142], [143], [144], [148], [149], [152], [154], [155], [156], [157], [158], [159], [160], [161], [162] [2018-01-21 00:33:03,456 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:33:03,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:33:03,682 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:33:03,682 INFO L268 AbstractInterpreter]: Visited 52 different actions 93 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:33:03,683 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:33:03,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:03,684 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:33:03,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:03,697 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:33:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:03,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:33:03,793 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:33:03,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:33:03,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:33:03,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:33:03,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:33:03,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:33:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-21 00:33:03,903 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:33:03,999 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_33| Int)) (or (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_33|)) (not (= |c_old(#valid)| (store |c_#valid| |v_insert_sub_#t~malloc9.base_33| 1))))) is different from false [2018-01-21 00:33:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:33:04,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:33:04,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:33:04,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:04,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:33:04,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:33:04,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=4, NotChecked=18, Total=56 [2018-01-21 00:33:04,045 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-01-21 00:33:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:04,158 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-21 00:33:04,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:33:04,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-01-21 00:33:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:04,160 INFO L225 Difference]: With dead ends: 86 [2018-01-21 00:33:04,161 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:04,161 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=27, Unknown=4, NotChecked=22, Total=72 [2018-01-21 00:33:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:04,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-01-21 00:33:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:04,162 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:04,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:33:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:04,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:04,164 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:04,164 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:04,164 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:04,164 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:04,164 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:04,164 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:04,165 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:04,165 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_subErr0EnsuresViolation======== [2018-01-21 00:33:04,165 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:33:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:33:04,167 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:04,167 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:33:04,167 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_subErr0EnsuresViolation]=== [2018-01-21 00:33:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash 673138463, now seen corresponding path program 1 times [2018-01-21 00:33:04,167 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:04,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:04,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:04,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:04,169 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:04,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:04,182 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:33:04,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:04,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:04,182 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:04,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:33:04,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:33:04,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:33:04,183 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:33:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:04,190 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:33:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:33:04,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 00:33:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:04,191 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:33:04,191 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 00:33:04,192 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:33:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 00:33:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-21 00:33:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-21 00:33:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-21 00:33:04,199 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 27 [2018-01-21 00:33:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:04,200 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-21 00:33:04,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:33:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-21 00:33:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-21 00:33:04,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:04,202 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-01-21 00:33:04,202 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_subErr0EnsuresViolation]=== [2018-01-21 00:33:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1952480154, now seen corresponding path program 1 times [2018-01-21 00:33:04,202 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:04,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:04,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:04,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:04,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:04,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:33:04,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:04,295 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:33:04,295 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-01-21 00:33:04,295 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [20], [21], [22], [26], [30], [41], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [78], [79], [80], [84], [90], [91], [92], [101], [102], [104], [108], [111], [114], [120], [122], [123], [124], [129], [134], [140], [141], [142], [143], [144], [145], [146], [148], [149], [150], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162] [2018-01-21 00:33:04,298 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:33:04,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:33:04,562 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:33:04,563 INFO L268 AbstractInterpreter]: Visited 72 different actions 113 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:33:04,564 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:33:04,849 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 66.66% of their original sizes. [2018-01-21 00:33:04,850 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:33:06,862 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:33:06,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:33:06,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [67] imperfect sequences [4] total 70 [2018-01-21 00:33:06,878 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:06,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-01-21 00:33:06,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-01-21 00:33:06,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4280, Unknown=0, NotChecked=0, Total=4556 [2018-01-21 00:33:06,880 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 68 states. [2018-01-21 00:33:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:19,007 INFO L93 Difference]: Finished difference Result 217 states and 241 transitions. [2018-01-21 00:33:19,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-01-21 00:33:19,007 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 113 [2018-01-21 00:33:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:19,009 INFO L225 Difference]: With dead ends: 217 [2018-01-21 00:33:19,009 INFO L226 Difference]: Without dead ends: 216 [2018-01-21 00:33:19,012 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1069, Invalid=14431, Unknown=0, NotChecked=0, Total=15500 [2018-01-21 00:33:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-01-21 00:33:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 114. [2018-01-21 00:33:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-21 00:33:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-01-21 00:33:19,030 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 113 [2018-01-21 00:33:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:19,031 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-01-21 00:33:19,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-01-21 00:33:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-01-21 00:33:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-21 00:33:19,032 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:19,032 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-01-21 00:33:19,032 INFO L371 AbstractCegarLoop]: === Iteration 3 === [destroy_subErr0EnsuresViolation]=== [2018-01-21 00:33:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1195073054, now seen corresponding path program 1 times [2018-01-21 00:33:19,033 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:19,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:19,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,034 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:19,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-21 00:33:19,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:19,119 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:33:19,119 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-01-21 00:33:19,120 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [20], [21], [22], [26], [30], [32], [33], [34], [35], [36], [41], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [78], [79], [80], [84], [90], [91], [92], [101], [102], [104], [108], [111], [114], [120], [122], [123], [124], [129], [134], [140], [141], [142], [143], [144], [145], [146], [148], [149], [150], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162] [2018-01-21 00:33:19,123 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:33:19,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:33:19,316 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:33:19,317 INFO L268 AbstractInterpreter]: Visited 77 different actions 126 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-21 00:33:19,325 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:33:19,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:19,326 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:33:19,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:19,330 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:33:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:19,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:33:19,396 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:33:19,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:33:19,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:33:19,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:33:19,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:33:19,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:33:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-21 00:33:19,447 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:33:19,533 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_58| Int)) (or (not (= (store |c_#valid| |v_insert_sub_#t~malloc9.base_58| 1) |c_old(#valid)|)) (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_58|)))) is different from false [2018-01-21 00:33:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-21 00:33:19,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:33:19,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:33:19,565 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:19,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:33:19,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:33:19,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=20, Unknown=3, NotChecked=18, Total=56 [2018-01-21 00:33:19,566 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 6 states. [2018-01-21 00:33:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:19,664 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-01-21 00:33:19,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:33:19,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-01-21 00:33:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:19,665 INFO L225 Difference]: With dead ends: 139 [2018-01-21 00:33:19,665 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:19,666 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2018-01-21 00:33:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:19,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-01-21 00:33:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:19,667 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:19,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:33:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:19,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:19,668 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:19,668 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:19,668 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:19,668 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:19,669 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:19,669 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:19,669 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:19,669 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_sub_listErr0EnsuresViolation======== [2018-01-21 00:33:19,669 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:33:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:33:19,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:19,670 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:33:19,670 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_sub_listErr0EnsuresViolation]=== [2018-01-21 00:33:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 584331388, now seen corresponding path program 1 times [2018-01-21 00:33:19,671 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:19,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:19,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:19,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:19,686 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:33:19,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:19,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:19,687 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:19,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:33:19,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:33:19,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:33:19,687 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:33:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:19,692 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:33:19,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:33:19,693 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 00:33:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:19,693 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:33:19,693 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 00:33:19,694 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:33:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 00:33:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 00:33:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:33:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-21 00:33:19,699 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 22 [2018-01-21 00:33:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:19,699 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-21 00:33:19,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:33:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-21 00:33:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 00:33:19,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:19,700 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:33:19,701 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_sub_listErr0EnsuresViolation]=== [2018-01-21 00:33:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1395666505, now seen corresponding path program 1 times [2018-01-21 00:33:19,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:19,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:19,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:19,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:19,733 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:33:19,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:19,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:19,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:19,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:33:19,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:33:19,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:33:19,734 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 3 states. [2018-01-21 00:33:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:19,941 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-21 00:33:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:33:19,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-21 00:33:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:19,941 INFO L225 Difference]: With dead ends: 54 [2018-01-21 00:33:19,941 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:19,942 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 00:33:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:19,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 00:33:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:19,943 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:19,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:33:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:19,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:19,943 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:19,943 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:19,944 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:19,944 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:19,944 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:19,944 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:19,944 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:19,944 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:33:19,944 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:33:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:33:19,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:19,945 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:33:19,945 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:33:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1772916773, now seen corresponding path program 1 times [2018-01-21 00:33:19,945 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:19,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:19,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,946 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:19,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:19,954 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:33:19,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:19,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:19,955 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:19,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:33:19,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:33:19,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:33:19,955 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:33:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:19,961 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:33:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:33:19,961 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 00:33:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:19,962 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:33:19,962 INFO L226 Difference]: Without dead ends: 86 [2018-01-21 00:33:19,963 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:33:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-21 00:33:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-21 00:33:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-21 00:33:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-21 00:33:19,970 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 26 [2018-01-21 00:33:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:19,970 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-21 00:33:19,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:33:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-21 00:33:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-21 00:33:19,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:19,971 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 00:33:19,971 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:33:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1417640009, now seen corresponding path program 1 times [2018-01-21 00:33:19,972 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:19,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:19,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:19,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:19,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:33:20,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:20,023 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:33:20,023 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2018-01-21 00:33:20,023 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [67], [68], [69], [70], [72], [73], [75], [76], [78], [79], [80], [84], [88], [99], [101], [102], [104], [108], [111], [114], [120], [122], [123], [124], [129], [134], [139], [140], [141], [142], [143], [144], [145], [146], [147], [148], [149], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162], [163] [2018-01-21 00:33:20,024 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:33:20,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:33:20,164 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:33:20,164 INFO L268 AbstractInterpreter]: Visited 71 different actions 112 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:33:20,173 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:33:20,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:20,174 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:33:20,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:20,188 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:33:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:20,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:33:20,255 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:33:20,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:33:20,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:33:20,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:33:20,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:33:20,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:33:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-21 00:33:20,286 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:33:20,414 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_89| Int)) (or (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_89|)) (not (= |c_old(#valid)| (store |c_#valid| |v_insert_sub_#t~malloc9.base_89| 1))))) is different from false [2018-01-21 00:33:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:33:20,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:33:20,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:33:20,443 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:20,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:33:20,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:33:20,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=20, Unknown=3, NotChecked=18, Total=56 [2018-01-21 00:33:20,443 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 6 states. [2018-01-21 00:33:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:20,487 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-01-21 00:33:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:33:20,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-01-21 00:33:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:20,488 INFO L225 Difference]: With dead ends: 118 [2018-01-21 00:33:20,488 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:20,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2018-01-21 00:33:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:20,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-01-21 00:33:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:20,489 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:20,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:33:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:20,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:20,490 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:20,490 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:20,490 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:20,490 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:20,490 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:20,490 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:20,490 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:20,490 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:33:20,491 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:33:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:33:20,492 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:20,492 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:33:20,492 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:33:20,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1285304546, now seen corresponding path program 1 times [2018-01-21 00:33:20,493 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:20,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:20,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:20,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:20,494 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:20,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:20,503 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:33:20,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:20,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:20,503 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:20,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:33:20,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:33:20,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:33:20,504 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:33:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:20,510 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:33:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:33:20,510 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 00:33:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:20,510 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:33:20,511 INFO L226 Difference]: Without dead ends: 84 [2018-01-21 00:33:20,511 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:33:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-21 00:33:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-21 00:33:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-21 00:33:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-21 00:33:20,518 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 24 [2018-01-21 00:33:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:20,518 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-21 00:33:20,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:33:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-21 00:33:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-21 00:33:20,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:20,520 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-21 00:33:20,520 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:33:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -23821520, now seen corresponding path program 1 times [2018-01-21 00:33:20,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:20,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:20,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:20,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:20,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:20,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:33:20,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:20,601 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:33:20,601 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-01-21 00:33:20,601 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [67], [68], [69], [71], [72], [73], [75], [76], [78], [79], [80], [84], [88], [99], [101], [102], [104], [108], [111], [114], [120], [122], [123], [124], [129], [134], [140], [141], [142], [143], [144], [145], [146], [147], [148], [149], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162] [2018-01-21 00:33:20,603 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:33:20,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:33:20,736 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:33:20,737 INFO L268 AbstractInterpreter]: Visited 69 different actions 110 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:33:20,740 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:33:20,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:20,740 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:33:20,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:20,752 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:33:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:20,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:33:20,836 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:33:20,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:33:20,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:33:20,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:33:20,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:33:20,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:33:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-21 00:33:20,960 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:33:21,045 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_114| Int)) (or (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_114|)) (not (= (store |c_#valid| |v_insert_sub_#t~malloc9.base_114| 1) |c_old(#valid)|)))) is different from false [2018-01-21 00:33:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:33:21,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:33:21,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:33:21,072 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:21,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:33:21,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:33:21,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=20, Unknown=3, NotChecked=18, Total=56 [2018-01-21 00:33:21,073 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-01-21 00:33:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:21,120 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-01-21 00:33:21,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:33:21,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-01-21 00:33:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:21,121 INFO L225 Difference]: With dead ends: 116 [2018-01-21 00:33:21,121 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:21,122 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2018-01-21 00:33:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:21,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-01-21 00:33:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:21,123 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:21,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:33:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:21,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:21,124 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:21,124 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:21,124 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:21,124 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:21,124 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:21,124 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:21,124 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:21,125 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == list_add_tailErr0EnsuresViolation======== [2018-01-21 00:33:21,125 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:33:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 00:33:21,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:21,127 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, 1, 1] [2018-01-21 00:33:21,127 INFO L371 AbstractCegarLoop]: === Iteration 1 === [list_add_tailErr0EnsuresViolation]=== [2018-01-21 00:33:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1965822616, now seen corresponding path program 1 times [2018-01-21 00:33:21,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:21,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:21,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:21,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:21,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:21,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:21,150 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:33:21,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:21,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:21,151 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:21,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:33:21,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:33:21,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:33:21,152 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:33:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:21,157 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:33:21,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:33:21,157 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-01-21 00:33:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:21,158 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:33:21,158 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:21,158 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:33:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:21,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-21 00:33:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:21,159 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:21,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:33:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:21,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:21,161 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:21,161 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:21,161 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:21,161 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:21,161 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:21,161 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:21,161 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:21,161 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_topErr0EnsuresViolation======== [2018-01-21 00:33:21,161 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:33:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:33:21,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:21,163 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:33:21,163 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_topErr0EnsuresViolation]=== [2018-01-21 00:33:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash 719208377, now seen corresponding path program 1 times [2018-01-21 00:33:21,163 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:21,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:21,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:21,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:21,164 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:21,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:21,173 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:33:21,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:21,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:21,174 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:21,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:33:21,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:33:21,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:33:21,175 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:33:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:21,180 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-21 00:33:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:33:21,180 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 00:33:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:21,181 INFO L225 Difference]: With dead ends: 181 [2018-01-21 00:33:21,181 INFO L226 Difference]: Without dead ends: 79 [2018-01-21 00:33:21,182 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:33:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-21 00:33:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-21 00:33:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 00:33:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-21 00:33:21,187 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 19 [2018-01-21 00:33:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:21,188 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-21 00:33:21,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:33:21,188 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-21 00:33:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-21 00:33:21,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:21,189 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-21 00:33:21,189 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_topErr0EnsuresViolation]=== [2018-01-21 00:33:21,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1592932249, now seen corresponding path program 1 times [2018-01-21 00:33:21,190 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:21,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:21,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:21,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:21,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:21,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-21 00:33:21,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:21,255 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:33:21,255 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-01-21 00:33:21,255 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [78], [79], [80], [84], [88], [100], [101], [102], [104], [108], [111], [114], [120], [122], [123], [124], [129], [134], [140], [141], [142], [143], [144], [145], [146], [148], [149], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162] [2018-01-21 00:33:21,256 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:33:21,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:33:21,388 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-21 00:33:21,388 INFO L268 AbstractInterpreter]: Visited 64 different actions 105 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-21 00:33:21,397 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-21 00:33:21,559 INFO L232 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 67.55% of their original sizes. [2018-01-21 00:33:21,559 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-21 00:33:23,147 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-21 00:33:23,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-21 00:33:23,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [4] total 68 [2018-01-21 00:33:23,148 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:23,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-01-21 00:33:23,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-01-21 00:33:23,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=4027, Unknown=0, NotChecked=0, Total=4290 [2018-01-21 00:33:23,149 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 66 states. [2018-01-21 00:33:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:32,899 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2018-01-21 00:33:32,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-01-21 00:33:32,899 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 105 [2018-01-21 00:33:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:32,901 INFO L225 Difference]: With dead ends: 221 [2018-01-21 00:33:32,901 INFO L226 Difference]: Without dead ends: 218 [2018-01-21 00:33:32,904 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3694 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=995, Invalid=13285, Unknown=0, NotChecked=0, Total=14280 [2018-01-21 00:33:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-21 00:33:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 114. [2018-01-21 00:33:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-21 00:33:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-01-21 00:33:32,921 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 105 [2018-01-21 00:33:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:32,921 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-01-21 00:33:32,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-01-21 00:33:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-01-21 00:33:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-21 00:33:32,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:32,923 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-01-21 00:33:32,923 INFO L371 AbstractCegarLoop]: === Iteration 3 === [destroy_topErr0EnsuresViolation]=== [2018-01-21 00:33:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1262042771, now seen corresponding path program 1 times [2018-01-21 00:33:32,923 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:32,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:32,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:32,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:32,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:32,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-21 00:33:33,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:33,031 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:33:33,031 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-01-21 00:33:33,031 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [7], [8], [9], [14], [16], [18], [20], [21], [22], [26], [30], [40], [42], [43], [44], [48], [51], [54], [60], [62], [63], [64], [72], [73], [75], [76], [78], [79], [80], [84], [88], [90], [91], [92], [94], [95], [100], [101], [102], [104], [108], [111], [114], [120], [122], [123], [124], [129], [134], [140], [141], [142], [143], [144], [145], [146], [148], [149], [150], [151], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162] [2018-01-21 00:33:33,033 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:33:33,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:33:33,382 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:33:33,382 INFO L268 AbstractInterpreter]: Visited 77 different actions 149 times. Merged at 9 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-21 00:33:33,392 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:33:33,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:33:33,392 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:33:33,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:33,404 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:33:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:33,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:33:33,491 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|insert_sub_#t~malloc9.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |insert_sub_#t~malloc9.base| 1)) (<= (select |c_old(#valid)| |insert_sub_#t~malloc9.base|) 0))) is different from true [2018-01-21 00:33:33,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:33:33,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-21 00:33:33,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:33:33,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:33:33,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-21 00:33:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-21 00:33:33,572 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:33:33,843 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_insert_sub_#t~malloc9.base_139| Int)) (or (not (= (store |c_#valid| |v_insert_sub_#t~malloc9.base_139| 1) |c_old(#valid)|)) (< 0 (select |c_#valid| |v_insert_sub_#t~malloc9.base_139|)))) is different from false [2018-01-21 00:33:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-21 00:33:33,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:33:33,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 8 [2018-01-21 00:33:33,890 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:33,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:33:33,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:33:33,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=4, NotChecked=18, Total=56 [2018-01-21 00:33:33,891 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 6 states. [2018-01-21 00:33:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:34,000 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-01-21 00:33:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:33:34,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-01-21 00:33:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:34,002 INFO L225 Difference]: With dead ends: 139 [2018-01-21 00:33:34,002 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:34,002 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=27, Unknown=4, NotChecked=22, Total=72 [2018-01-21 00:33:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:34,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-01-21 00:33:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:34,003 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:34,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:33:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:34,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:34,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:33:34 BoogieIcfgContainer [2018-01-21 00:33:34,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:33:34,007 INFO L168 Benchmark]: Toolchain (without parser) took 37529.98 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 854.6 MB). Free memory was 264.0 MB in the beginning and 337.6 MB in the end (delta: -73.6 MB). Peak memory consumption was 781.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:33:34,008 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:33:34,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.20 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:33:34,009 INFO L168 Benchmark]: Boogie Preprocessor took 43.76 ms. Allocated memory is still 305.7 MB. Free memory was 252.0 MB in the beginning and 250.0 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:33:34,009 INFO L168 Benchmark]: RCFGBuilder took 405.08 ms. Allocated memory is still 305.7 MB. Free memory was 250.0 MB in the beginning and 222.2 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-01-21 00:33:34,010 INFO L168 Benchmark]: TraceAbstraction took 36856.57 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 854.6 MB). Free memory was 222.2 MB in the beginning and 337.6 MB in the end (delta: -115.4 MB). Peak memory consumption was 739.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:33:34,011 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.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.20 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.76 ms. Allocated memory is still 305.7 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 405.08 ms. Allocated memory is still 305.7 MB. Free memory was 250.0 MB in the beginning and 222.2 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 36856.57 ms. Allocated memory was 305.7 MB in the beginning and 1.2 GB in the end (delta: 854.6 MB). Free memory was 222.2 MB in the beginning and 337.6 MB in the end (delta: -115.4 MB). Peak memory consumption was 739.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 54 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 557 LocStat_NO_SUPPORTING_DISEQUALITIES : 205 LocStat_NO_DISJUNCTIONS : -108 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 72 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 154 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 74 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.241350 RENAME_VARIABLES(MILLISECONDS) : 0.125362 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.168415 PROJECTAWAY(MILLISECONDS) : 0.069465 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001122 DISJOIN(MILLISECONDS) : 0.549651 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.156439 ADD_EQUALITY(MILLISECONDS) : 0.041814 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011056 #CONJOIN_DISJUNCTIVE : 145 #RENAME_VARIABLES : 261 #UNFREEZE : 0 #CONJOIN : 320 #PROJECTAWAY : 230 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 258 #ADD_EQUALITY : 191 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 191 LocStat_NO_SUPPORTING_DISEQUALITIES : 76 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 80 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.014931 RENAME_VARIABLES(MILLISECONDS) : 0.327922 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.428405 PROJECTAWAY(MILLISECONDS) : 0.408495 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000987 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.360007 ADD_EQUALITY(MILLISECONDS) : 0.040467 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008477 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 55 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 57 #ADD_WEAK_EQUALITY : 29 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 55 #ADD_EQUALITY : 96 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 50 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 532 LocStat_NO_SUPPORTING_DISEQUALITIES : 193 LocStat_NO_DISJUNCTIONS : -100 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 68 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 152 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 70 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.182720 RENAME_VARIABLES(MILLISECONDS) : 0.086839 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.160128 PROJECTAWAY(MILLISECONDS) : 0.058070 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001191 DISJOIN(MILLISECONDS) : 0.439067 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.107450 ADD_EQUALITY(MILLISECONDS) : 0.014340 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011340 #CONJOIN_DISJUNCTIVE : 140 #RENAME_VARIABLES : 250 #UNFREEZE : 0 #CONJOIN : 311 #PROJECTAWAY : 218 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 247 #ADD_EQUALITY : 189 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 69 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 627 LocStat_NO_SUPPORTING_DISEQUALITIES : 243 LocStat_NO_DISJUNCTIONS : -138 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 92 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 181 TransStat_NO_SUPPORTING_DISEQUALITIES : 19 TransStat_NO_DISJUNCTIONS : 95 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.228001 RENAME_VARIABLES(MILLISECONDS) : 0.148550 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.212372 PROJECTAWAY(MILLISECONDS) : 0.014021 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000970 DISJOIN(MILLISECONDS) : 3.259278 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.170816 ADD_EQUALITY(MILLISECONDS) : 0.012937 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009041 #CONJOIN_DISJUNCTIVE : 175 #RENAME_VARIABLES : 309 #UNFREEZE : 0 #CONJOIN : 361 #PROJECTAWAY : 277 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 46 #RENAME_VARIABLES_DISJUNCTIVE : 305 #ADD_EQUALITY : 218 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 74 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 658 LocStat_NO_SUPPORTING_DISEQUALITIES : 254 LocStat_NO_DISJUNCTIONS : -148 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 97 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 201 TransStat_NO_SUPPORTING_DISEQUALITIES : 23 TransStat_NO_DISJUNCTIONS : 104 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.139764 RENAME_VARIABLES(MILLISECONDS) : 0.187807 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.127049 PROJECTAWAY(MILLISECONDS) : 0.198023 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001839 DISJOIN(MILLISECONDS) : 0.207097 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.204468 ADD_EQUALITY(MILLISECONDS) : 0.007418 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004739 #CONJOIN_DISJUNCTIVE : 203 #RENAME_VARIABLES : 371 #UNFREEZE : 0 #CONJOIN : 426 #PROJECTAWAY : 324 #ADD_WEAK_EQUALITY : 62 #DISJOIN : 54 #RENAME_VARIABLES_DISJUNCTIVE : 353 #ADD_EQUALITY : 230 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 13 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 69 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 672 LocStat_NO_SUPPORTING_DISEQUALITIES : 246 LocStat_NO_DISJUNCTIONS : -138 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 89 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 172 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 91 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.054726 RENAME_VARIABLES(MILLISECONDS) : 0.029744 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.042403 PROJECTAWAY(MILLISECONDS) : 0.014438 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000509 DISJOIN(MILLISECONDS) : 0.246216 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.039340 ADD_EQUALITY(MILLISECONDS) : 0.008915 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008859 #CONJOIN_DISJUNCTIVE : 165 #RENAME_VARIABLES : 302 #UNFREEZE : 0 #CONJOIN : 354 #PROJECTAWAY : 277 #ADD_WEAK_EQUALITY : 62 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 299 #ADD_EQUALITY : 209 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 67 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 633 LocStat_NO_SUPPORTING_DISEQUALITIES : 244 LocStat_NO_DISJUNCTIONS : -134 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 87 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 170 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 89 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.049427 RENAME_VARIABLES(MILLISECONDS) : 0.025629 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.037092 PROJECTAWAY(MILLISECONDS) : 0.013646 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000639 DISJOIN(MILLISECONDS) : 0.206925 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.034876 ADD_EQUALITY(MILLISECONDS) : 0.014086 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008969 #CONJOIN_DISJUNCTIVE : 163 #RENAME_VARIABLES : 295 #UNFREEZE : 0 #CONJOIN : 348 #PROJECTAWAY : 267 #ADD_WEAK_EQUALITY : 62 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 292 #ADD_EQUALITY : 207 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 61 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 666 LocStat_NO_SUPPORTING_DISEQUALITIES : 226 LocStat_NO_DISJUNCTIONS : -122 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 82 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 167 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 84 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.084102 RENAME_VARIABLES(MILLISECONDS) : 0.062474 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.072169 PROJECTAWAY(MILLISECONDS) : 0.009974 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000170 DISJOIN(MILLISECONDS) : 0.211073 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.072678 ADD_EQUALITY(MILLISECONDS) : 0.005580 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006818 #CONJOIN_DISJUNCTIVE : 158 #RENAME_VARIABLES : 282 #UNFREEZE : 0 #CONJOIN : 339 #PROJECTAWAY : 252 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 279 #ADD_EQUALITY : 204 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 74 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 696 LocStat_NO_SUPPORTING_DISEQUALITIES : 242 LocStat_NO_DISJUNCTIONS : -148 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 97 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 200 TransStat_NO_SUPPORTING_DISEQUALITIES : 21 TransStat_NO_DISJUNCTIONS : 103 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.150346 RENAME_VARIABLES(MILLISECONDS) : 0.313990 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.276840 PROJECTAWAY(MILLISECONDS) : 0.071038 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000526 DISJOIN(MILLISECONDS) : 0.359934 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.339212 ADD_EQUALITY(MILLISECONDS) : 0.008712 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011468 #CONJOIN_DISJUNCTIVE : 232 #RENAME_VARIABLES : 457 #UNFREEZE : 0 #CONJOIN : 486 #PROJECTAWAY : 377 #ADD_WEAK_EQUALITY : 62 #DISJOIN : 69 #RENAME_VARIABLES_DISJUNCTIVE : 434 #ADD_EQUALITY : 229 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 * 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) - 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: 623]: 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: __list_addErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 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=97occurred 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: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 53 PreInvPairs, 66 NumberOfFragments, 26 HoareAnnotationTreeSize, 53 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 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 - CounterExampleResult [Line: 664]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L697] FCALL struct list_head top = { &(top), &(top) }; VAL [top={33:0}] [L698] CALL create_top(&top) VAL [top={33:0}] [L692] CALL insert_top(top) VAL [head={33:0}] [L682] EXPR, FCALL malloc(sizeof(*top)) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}] [L682] struct top_list *top = malloc(sizeof(*top)); VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L683] COND FALSE !(!top) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L685] CALL create_sub_list(&top->sub1) VAL [sub={38:8}] [L674] FCALL sub->prev = sub VAL [sub={38:8}, sub={38:8}] [L675] FCALL sub->next = sub VAL [sub={38:8}, sub={38:8}] [L677] CALL insert_sub(sub) VAL [head={38:8}] [L666] EXPR, FCALL malloc(sizeof(*sub)) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}] [L666] struct sub_list *sub = malloc(sizeof(*sub)); VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L667] COND FALSE !(!sub) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L669] FCALL sub->number = 0 VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L670] CALL list_add_tail(&sub->link, head) VAL [head={38:8}, new={35:4}] [L634] EXPR, FCALL head->prev VAL [head={38:8}, head={38:8}, head->prev={38:8}, new={35:4}, new={35:4}] [L634] CALL __list_add(new, head->prev, head) VAL [new={35:4}, next={38:8}, prev={38:8}] [L627] FCALL next->prev = new VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L628] FCALL new->next = next VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L629] FCALL new->prev = prev VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L630] RET, FCALL prev->next = new VAL [new={35:4}, new={35:4}, next={38:8}, next={38:8}, prev={38:8}, prev={38:8}] [L634] RET __list_add(new, head->prev, head) VAL [head={38:8}, head={38:8}, head->prev={38:8}, new={35:4}, new={35:4}] [L670] list_add_tail(&sub->link, head) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: insert_subErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 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=97occurred 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, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1681 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 - 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 11 procedures, 97 locations, 11 error locations. UNSAFE Result, 0.0s 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=97occurred 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 - PositiveResult [Line: 689]: 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: create_topErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 1.2s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 149 SDtfs, 21 SDslu, 7 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 32281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 156/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 680]: 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: insert_topErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 4.9s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 90 SDtfs, 227 SDslu, 272 SDs, 0 SdLazy, 631 SolverSat, 75 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 248 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9651695526695524 AbsIntWeakeningRatio, 1.0909090909090908 AbsIntAvgWeakeningVarsNumRemoved, 3.1136363636363638 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 320 ConstructedInterpolants, 20 QuantifiedInterpolants, 44716 SizeOfPredicates, 3 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 148/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 645]: 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: destroy_subErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 15.5s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 617 SDslu, 623 SDs, 0 SdLazy, 2542 SolverSat, 291 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 420 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9224475206749367 AbsIntWeakeningRatio, 1.1785714285714286 AbsIntAvgWeakeningVarsNumRemoved, 8.473214285714286 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 102 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 492 ConstructedInterpolants, 20 QuantifiedInterpolants, 79422 SizeOfPredicates, 3 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 194/230 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 672]: 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: create_sub_listErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 148 SDtfs, 18 SDslu, 7 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 3276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: 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: ULTIMATE.startErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 39 SDslu, 17 SDs, 0 SdLazy, 31 SolverSat, 20 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 358 ConstructedInterpolants, 20 QuantifiedInterpolants, 58567 SizeOfPredicates, 3 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 144/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 695]: 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: mainErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 0.6s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 30 SolverSat, 17 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 350 ConstructedInterpolants, 20 QuantifiedInterpolants, 56773 SizeOfPredicates, 3 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 144/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 632]: 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: list_add_tailErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 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=97occurred 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, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 1521 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 - PositiveResult [Line: 654]: 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: destroy_topErr0EnsuresViolation CFG has 11 procedures, 97 locations, 11 error locations. SAFE Result, 12.8s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 174 SDtfs, 673 SDslu, 668 SDs, 0 SdLazy, 2476 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 409 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3695 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9251586852689795 AbsIntWeakeningRatio, 1.1538461538461537 AbsIntAvgWeakeningVarsNumRemoved, 10.307692307692308 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 104 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 476 ConstructedInterpolants, 20 QuantifiedInterpolants, 77190 SizeOfPredicates, 3 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 194/230 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 691]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 657]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-6-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-6-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-7-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-7-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-8-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-8-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-21_00-33-34-034.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-10-2018-01-21_00-33-34-034.csv Received shutdown request...