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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:26:43,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:26:43,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:26:43,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:26:43,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:26:43,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:26:43,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:26:43,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:26:43,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:26:43,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:26:43,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:26:43,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:26:43,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:26:43,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:26:43,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:26:43,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:26:43,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:26:43,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:26:43,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:26:43,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:26:43,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:26:43,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:26:43,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:26:43,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:26:43,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:26:43,603 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:26:43,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:26:43,604 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:26:43,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:26:43,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:26:43,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:26:43,606 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:26:43,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:26:43,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:26:43,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:26:43,615 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:26:43,615 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:26:43,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:26:43,616 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:26:43,616 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:26:43,616 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:26:43,616 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:26:43,616 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:26:43,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:26:43,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:26:43,617 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:26:43,617 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:26:43,617 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:26:43,617 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:26:43,617 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:26:43,617 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:26:43,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:26:43,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:26:43,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:26:43,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:26:43,618 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:26:43,618 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:26:43,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:26:43,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:26:43,619 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:26:43,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:26:43,619 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:26:43,619 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:26:43,619 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:26:43,620 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:26:43,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:26:43,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:26:43,620 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:26:43,621 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:26:43,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:26:43,663 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:26:43,666 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:26:43,667 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:26:43,668 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:26:43,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i [2018-01-23 14:26:43,841 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:26:43,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:26:43,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:26:43,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:26:43,852 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:26:43,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:26:43" (1/1) ... [2018-01-23 14:26:43,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b83b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:43, skipping insertion in model container [2018-01-23 14:26:43,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:26:43" (1/1) ... [2018-01-23 14:26:43,870 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:26:43,908 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:26:44,032 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:26:44,057 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:26:44,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44 WrapperNode [2018-01-23 14:26:44,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:26:44,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:26:44,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:26:44,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:26:44,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (1/1) ... [2018-01-23 14:26:44,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (1/1) ... [2018-01-23 14:26:44,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (1/1) ... [2018-01-23 14:26:44,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (1/1) ... [2018-01-23 14:26:44,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (1/1) ... [2018-01-23 14:26:44,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (1/1) ... [2018-01-23 14:26:44,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (1/1) ... [2018-01-23 14:26:44,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:26:44,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:26:44,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:26:44,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:26:44,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (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-23 14:26:44,161 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:26:44,161 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:26:44,161 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-23 14:26:44,161 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-23 14:26:44,161 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-23 14:26:44,161 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-23 14:26:44,162 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-23 14:26:44,162 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-23 14:26:44,162 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-23 14:26:44,162 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-23 14:26:44,162 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:26:44,162 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:26:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:26:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:26:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:26:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:26:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:26:44,163 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:26:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:26:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-23 14:26:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:26:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-23 14:26:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-23 14:26:44,164 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-23 14:26:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-23 14:26:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-23 14:26:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-23 14:26:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-23 14:26:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-23 14:26:44,165 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:26:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:26:44,166 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:26:44,523 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:26:44,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:26:44 BoogieIcfgContainer [2018-01-23 14:26:44,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:26:44,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:26:44,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:26:44,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:26:44,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:26:43" (1/3) ... [2018-01-23 14:26:44,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb7d39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:26:44, skipping insertion in model container [2018-01-23 14:26:44,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:26:44" (2/3) ... [2018-01-23 14:26:44,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb7d39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:26:44, skipping insertion in model container [2018-01-23 14:26:44,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:26:44" (3/3) ... [2018-01-23 14:26:44,530 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_true-valid-memsafety.i [2018-01-23 14:26:44,536 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:26:44,542 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-23 14:26:44,589 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:44,589 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:44,589 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:44,589 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:44,590 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:44,590 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:44,590 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:44,590 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == __list_addErr0EnsuresViolation======== [2018-01-23 14:26:44,591 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:26:44,621 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:44,622 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-23 14:26:44,622 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr0EnsuresViolation]=== [2018-01-23 14:26:44,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1421895685, now seen corresponding path program 1 times [2018-01-23 14:26:44,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:44,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:44,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:44,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:44,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:44,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:26:44,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:44,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:44,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:44,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:44,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:44,822 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:44,949 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:44,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:44,950 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-23 14:26:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:44,958 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:44,958 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:44,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-23 14:26:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:44,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-23 14:26:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:44,983 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:44,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:44,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:44,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:26:45,073 INFO L401 ceAbstractionStarter]: For program point L627'(line 627) no Hoare annotation was computed. [2018-01-23 14:26:45,073 INFO L401 ceAbstractionStarter]: For program point __list_addErr0EnsuresViolation(lines 623 631) no Hoare annotation was computed. [2018-01-23 14:26:45,073 INFO L401 ceAbstractionStarter]: For program point __list_addEXIT(lines 623 631) no Hoare annotation was computed. [2018-01-23 14:26:45,073 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-23 14:26:45,074 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-23 14:26:45,074 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-23 14:26:45,074 INFO L404 ceAbstractionStarter]: At program point __list_addENTRY(lines 623 631) the Hoare annotation is: true [2018-01-23 14:26:45,074 INFO L401 ceAbstractionStarter]: For program point __list_addFINAL(lines 623 631) no Hoare annotation was computed. [2018-01-23 14:26:45,074 INFO L404 ceAbstractionStarter]: At program point L670(line 670) the Hoare annotation is: true [2018-01-23 14:26:45,074 INFO L401 ceAbstractionStarter]: For program point insert_subFINAL(lines 665 672) no Hoare annotation was computed. [2018-01-23 14:26:45,074 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point insert_subErr0EnsuresViolation(lines 665 672) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point L668''(lines 668 669) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point L668(lines 668 669) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point insert_subEXIT(lines 665 672) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point L667'(line 667) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L404 ceAbstractionStarter]: At program point insert_subENTRY(lines 665 672) the Hoare annotation is: true [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 702) the Hoare annotation is: true [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:26:45,075 INFO L401 ceAbstractionStarter]: For program point L692(lines 692 694) no Hoare annotation was computed. [2018-01-23 14:26:45,076 INFO L404 ceAbstractionStarter]: At program point L692''(lines 692 694) the Hoare annotation is: true [2018-01-23 14:26:45,076 INFO L401 ceAbstractionStarter]: For program point create_topErr0EnsuresViolation(lines 690 695) no Hoare annotation was computed. [2018-01-23 14:26:45,076 INFO L404 ceAbstractionStarter]: At program point L693(line 693) the Hoare annotation is: true [2018-01-23 14:26:45,076 INFO L404 ceAbstractionStarter]: At program point create_topENTRY(lines 690 695) the Hoare annotation is: true [2018-01-23 14:26:45,076 INFO L401 ceAbstractionStarter]: For program point create_topEXIT(lines 690 695) no Hoare annotation was computed. [2018-01-23 14:26:45,076 INFO L401 ceAbstractionStarter]: For program point L693'(line 693) no Hoare annotation was computed. [2018-01-23 14:26:45,076 INFO L401 ceAbstractionStarter]: For program point L692'''(lines 692 694) no Hoare annotation was computed. [2018-01-23 14:26:45,077 INFO L401 ceAbstractionStarter]: For program point insert_topErr0EnsuresViolation(lines 681 689) no Hoare annotation was computed. [2018-01-23 14:26:45,077 INFO L401 ceAbstractionStarter]: For program point L684(lines 684 685) no Hoare annotation was computed. [2018-01-23 14:26:45,077 INFO L404 ceAbstractionStarter]: At program point L684''(lines 684 685) the Hoare annotation is: true [2018-01-23 14:26:45,077 INFO L401 ceAbstractionStarter]: For program point L683(line 683) no Hoare annotation was computed. [2018-01-23 14:26:45,077 INFO L401 ceAbstractionStarter]: For program point L683'(line 683) no Hoare annotation was computed. [2018-01-23 14:26:45,077 INFO L404 ceAbstractionStarter]: At program point L687(line 687) the Hoare annotation is: true [2018-01-23 14:26:45,077 INFO L404 ceAbstractionStarter]: At program point L686(line 686) the Hoare annotation is: true [2018-01-23 14:26:45,078 INFO L404 ceAbstractionStarter]: At program point insert_topENTRY(lines 681 689) the Hoare annotation is: true [2018-01-23 14:26:45,078 INFO L401 ceAbstractionStarter]: For program point insert_topEXIT(lines 681 689) no Hoare annotation was computed. [2018-01-23 14:26:45,078 INFO L401 ceAbstractionStarter]: For program point insert_topFINAL(lines 681 689) no Hoare annotation was computed. [2018-01-23 14:26:45,078 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-23 14:26:45,078 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-23 14:26:45,078 INFO L401 ceAbstractionStarter]: For program point destroy_subErr0EnsuresViolation(lines 645 653) no Hoare annotation was computed. [2018-01-23 14:26:45,078 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-23 14:26:45,078 INFO L401 ceAbstractionStarter]: For program point L648(lines 648 652) no Hoare annotation was computed. [2018-01-23 14:26:45,078 INFO L404 ceAbstractionStarter]: At program point destroy_subENTRY(lines 645 653) the Hoare annotation is: true [2018-01-23 14:26:45,079 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-23 14:26:45,079 INFO L404 ceAbstractionStarter]: At program point L648''(lines 648 652) the Hoare annotation is: true [2018-01-23 14:26:45,079 INFO L401 ceAbstractionStarter]: For program point L648'''(lines 648 652) no Hoare annotation was computed. [2018-01-23 14:26:45,079 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-23 14:26:45,079 INFO L401 ceAbstractionStarter]: For program point L647'(line 647) no Hoare annotation was computed. [2018-01-23 14:26:45,079 INFO L401 ceAbstractionStarter]: For program point destroy_subEXIT(lines 645 653) no Hoare annotation was computed. [2018-01-23 14:26:45,079 INFO L401 ceAbstractionStarter]: For program point L677'''(lines 677 679) no Hoare annotation was computed. [2018-01-23 14:26:45,079 INFO L404 ceAbstractionStarter]: At program point L678(line 678) the Hoare annotation is: true [2018-01-23 14:26:45,079 INFO L401 ceAbstractionStarter]: For program point L677(lines 677 679) no Hoare annotation was computed. [2018-01-23 14:26:45,079 INFO L404 ceAbstractionStarter]: At program point L677''(lines 677 679) the Hoare annotation is: true [2018-01-23 14:26:45,080 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-23 14:26:45,080 INFO L401 ceAbstractionStarter]: For program point create_sub_listEXIT(lines 673 680) no Hoare annotation was computed. [2018-01-23 14:26:45,080 INFO L404 ceAbstractionStarter]: At program point create_sub_listENTRY(lines 673 680) the Hoare annotation is: true [2018-01-23 14:26:45,080 INFO L401 ceAbstractionStarter]: For program point create_sub_listErr0EnsuresViolation(lines 673 680) no Hoare annotation was computed. [2018-01-23 14:26:45,080 INFO L401 ceAbstractionStarter]: For program point L678'(line 678) no Hoare annotation was computed. [2018-01-23 14:26:45,080 INFO L401 ceAbstractionStarter]: For program point L675'(line 675) no Hoare annotation was computed. [2018-01-23 14:26:45,080 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 702) the Hoare annotation is: true [2018-01-23 14:26:45,081 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:26:45,081 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 702) the Hoare annotation is: true [2018-01-23 14:26:45,081 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:26:45,081 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:26:45,081 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 696 702) the Hoare annotation is: true [2018-01-23 14:26:45,081 INFO L401 ceAbstractionStarter]: For program point L698'''(line 698) no Hoare annotation was computed. [2018-01-23 14:26:45,081 INFO L401 ceAbstractionStarter]: For program point L698'(line 698) no Hoare annotation was computed. [2018-01-23 14:26:45,082 INFO L401 ceAbstractionStarter]: For program point L700(line 700) no Hoare annotation was computed. [2018-01-23 14:26:45,082 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 696 702) no Hoare annotation was computed. [2018-01-23 14:26:45,082 INFO L404 ceAbstractionStarter]: At program point L699(line 699) the Hoare annotation is: true [2018-01-23 14:26:45,082 INFO L401 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-01-23 14:26:45,082 INFO L401 ceAbstractionStarter]: For program point L698''''(line 698) no Hoare annotation was computed. [2018-01-23 14:26:45,082 INFO L404 ceAbstractionStarter]: At program point L698''(line 698) the Hoare annotation is: true [2018-01-23 14:26:45,082 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 696 702) no Hoare annotation was computed. [2018-01-23 14:26:45,082 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 696 702) no Hoare annotation was computed. [2018-01-23 14:26:45,083 INFO L401 ceAbstractionStarter]: For program point list_add_tailEXIT(lines 632 635) no Hoare annotation was computed. [2018-01-23 14:26:45,083 INFO L404 ceAbstractionStarter]: At program point L634'(line 634) the Hoare annotation is: true [2018-01-23 14:26:45,083 INFO L401 ceAbstractionStarter]: For program point list_add_tailFINAL(lines 632 635) no Hoare annotation was computed. [2018-01-23 14:26:45,083 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-23 14:26:45,083 INFO L401 ceAbstractionStarter]: For program point L634''(line 634) no Hoare annotation was computed. [2018-01-23 14:26:45,083 INFO L404 ceAbstractionStarter]: At program point list_add_tailENTRY(lines 632 635) the Hoare annotation is: true [2018-01-23 14:26:45,083 INFO L401 ceAbstractionStarter]: For program point list_add_tailErr0EnsuresViolation(lines 632 635) no Hoare annotation was computed. [2018-01-23 14:26:45,083 INFO L401 ceAbstractionStarter]: For program point destroy_topErr0EnsuresViolation(lines 654 664) no Hoare annotation was computed. [2018-01-23 14:26:45,084 INFO L401 ceAbstractionStarter]: For program point L661(line 661) no Hoare annotation was computed. [2018-01-23 14:26:45,084 INFO L401 ceAbstractionStarter]: For program point L660(line 660) no Hoare annotation was computed. [2018-01-23 14:26:45,084 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-23 14:26:45,084 INFO L404 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: true [2018-01-23 14:26:45,084 INFO L401 ceAbstractionStarter]: For program point L658(line 658) no Hoare annotation was computed. [2018-01-23 14:26:45,084 INFO L404 ceAbstractionStarter]: At program point L657''(lines 657 663) the Hoare annotation is: true [2018-01-23 14:26:45,084 INFO L401 ceAbstractionStarter]: For program point L657(lines 657 663) no Hoare annotation was computed. [2018-01-23 14:26:45,085 INFO L404 ceAbstractionStarter]: At program point L659'(line 659) the Hoare annotation is: true [2018-01-23 14:26:45,085 INFO L401 ceAbstractionStarter]: For program point L658'(line 658) no Hoare annotation was computed. [2018-01-23 14:26:45,085 INFO L401 ceAbstractionStarter]: For program point L656'(line 656) no Hoare annotation was computed. [2018-01-23 14:26:45,085 INFO L401 ceAbstractionStarter]: For program point L657'''(lines 657 663) no Hoare annotation was computed. [2018-01-23 14:26:45,085 INFO L404 ceAbstractionStarter]: At program point destroy_topENTRY(lines 654 664) the Hoare annotation is: true [2018-01-23 14:26:45,085 INFO L401 ceAbstractionStarter]: For program point destroy_topEXIT(lines 654 664) no Hoare annotation was computed. [2018-01-23 14:26:45,089 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:45,089 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:45,089 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:45,089 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:45,090 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:45,090 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:45,090 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:45,090 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_subErr0EnsuresViolation======== [2018-01-23 14:26:45,090 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:26:45,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:45,096 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-23 14:26:45,096 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_subErr0EnsuresViolation]=== [2018-01-23 14:26:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash 712574584, now seen corresponding path program 1 times [2018-01-23 14:26:45,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:45,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:45,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:45,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:45,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:45,160 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-23 14:26:45,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:45,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:45,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:45,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:45,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:45,161 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:45,175 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:45,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:45,175 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-01-23 14:26:45,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:45,179 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:45,180 INFO L226 Difference]: Without dead ends: 54 [2018-01-23 14:26:45,181 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-23 14:26:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-23 14:26:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-23 14:26:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-23 14:26:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-23 14:26:45,198 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 42 [2018-01-23 14:26:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:45,199 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-23 14:26:45,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-23 14:26:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:26:45,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:45,201 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-23 14:26:45,202 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_subErr0EnsuresViolation]=== [2018-01-23 14:26:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1047454716, now seen corresponding path program 1 times [2018-01-23 14:26:45,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:45,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:45,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:45,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:26:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:26:45,346 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:26:45,358 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:26:45,365 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:26:45,366 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:26:45,367 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:26:45,383 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:45,384 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:45,384 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:45,384 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:45,384 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:45,384 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:45,384 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:45,384 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:26:45,384 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:26:45,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:45,388 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:26:45,388 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:26:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash 189700, now seen corresponding path program 1 times [2018-01-23 14:26:45,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:45,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:45,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:45,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:26:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:26:45,396 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:26:45,397 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:26:45,399 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:45,399 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:45,400 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:45,400 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:45,400 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:45,400 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:45,400 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:45,400 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_topErr0EnsuresViolation======== [2018-01-23 14:26:45,400 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-23 14:26:45,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:45,403 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:45,403 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_topErr0EnsuresViolation]=== [2018-01-23 14:26:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1605295434, now seen corresponding path program 1 times [2018-01-23 14:26:45,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:45,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:45,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:45,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:45,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:45,422 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-23 14:26:45,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:45,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:45,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:45,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:45,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:45,424 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:45,435 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:45,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:45,435 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-23 14:26:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:45,437 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:45,437 INFO L226 Difference]: Without dead ends: 55 [2018-01-23 14:26:45,438 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-23 14:26:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-23 14:26:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-23 14:26:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-23 14:26:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-23 14:26:45,446 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 12 [2018-01-23 14:26:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:45,447 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-23 14:26:45,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-23 14:26:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-23 14:26:45,450 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:45,450 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-23 14:26:45,450 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_topErr0EnsuresViolation]=== [2018-01-23 14:26:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash -817398474, now seen corresponding path program 1 times [2018-01-23 14:26:45,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:45,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:45,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:45,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:45,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:45,588 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-23 14:26:45,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:45,588 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-23 14:26:45,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:45,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:45,736 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-23 14:26:45,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:45,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-23 14:26:45,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:26:45,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:26:45,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:26:45,759 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-23 14:26:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:45,908 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-01-23 14:26:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:26:45,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-01-23 14:26:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:45,910 INFO L225 Difference]: With dead ends: 87 [2018-01-23 14:26:45,910 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:45,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 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-23 14:26:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:45,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2018-01-23 14:26:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:45,913 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:45,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:26:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:45,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:45,915 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:45,915 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:45,915 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:45,915 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:45,915 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:45,915 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:45,915 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:45,915 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == insert_topErr0EnsuresViolation======== [2018-01-23 14:26:45,915 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-23 14:26:45,918 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:45,918 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-23 14:26:45,918 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insert_topErr0EnsuresViolation]=== [2018-01-23 14:26:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1794587042, now seen corresponding path program 1 times [2018-01-23 14:26:45,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:45,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:45,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:45,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:45,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:26:45,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:45,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:45,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:45,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:45,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:45,953 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:45,962 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:45,963 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2018-01-23 14:26:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:45,964 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:45,964 INFO L226 Difference]: Without dead ends: 54 [2018-01-23 14:26:45,972 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-23 14:26:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-23 14:26:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-23 14:26:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-23 14:26:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-23 14:26:45,981 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 45 [2018-01-23 14:26:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:45,981 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-23 14:26:45,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-23 14:26:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-23 14:26:45,983 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:45,983 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-23 14:26:45,983 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insert_topErr0EnsuresViolation]=== [2018-01-23 14:26:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1017096708, now seen corresponding path program 1 times [2018-01-23 14:26:45,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:45,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:45,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:45,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:45,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:46,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:46,078 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-23 14:26:46,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:46,079 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-23 14:26:46,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:46,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:46,215 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-23 14:26:46,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:26:46,243 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-23 14:26:46,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:26:46,247 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-23 14:26:46,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-23 14:26:46,340 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-23 14:26:46,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:46,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-23 14:26:46,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:26:46,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:26:46,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2018-01-23 14:26:46,376 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2018-01-23 14:26:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:46,494 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-01-23 14:26:46,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:26:46,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-01-23 14:26:46,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:46,496 INFO L225 Difference]: With dead ends: 86 [2018-01-23 14:26:46,496 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:46,497 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2018-01-23 14:26:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:46,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-01-23 14:26:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:46,498 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:46,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:26:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:46,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:46,500 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:46,500 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:46,501 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:46,501 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:46,501 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:46,501 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:46,501 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:46,501 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_subErr0EnsuresViolation======== [2018-01-23 14:26:46,501 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-23 14:26:46,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:46,504 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-23 14:26:46,505 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_subErr0EnsuresViolation]=== [2018-01-23 14:26:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash 781950497, now seen corresponding path program 1 times [2018-01-23 14:26:46,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:46,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:46,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:46,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:46,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:46,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:46,521 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-23 14:26:46,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:46,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:46,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:46,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:46,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:46,523 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:46,530 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:46,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:46,530 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-23 14:26:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:46,531 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:46,532 INFO L226 Difference]: Without dead ends: 79 [2018-01-23 14:26:46,532 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-23 14:26:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-23 14:26:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-23 14:26:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-23 14:26:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-23 14:26:46,540 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27 [2018-01-23 14:26:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:46,541 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-23 14:26:46,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-23 14:26:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-23 14:26:46,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:46,543 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-23 14:26:46,543 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_subErr0EnsuresViolation]=== [2018-01-23 14:26:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash 885609031, now seen corresponding path program 1 times [2018-01-23 14:26:46,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:46,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:46,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:46,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:46,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:46,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:46,637 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-23 14:26:46,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:46,637 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-23 14:26:46,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:46,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:46,797 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-23 14:26:46,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:46,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-23 14:26:46,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:26:46,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:26:46,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:26:46,818 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 4 states. [2018-01-23 14:26:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:46,976 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-01-23 14:26:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:26:46,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-01-23 14:26:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:46,977 INFO L225 Difference]: With dead ends: 111 [2018-01-23 14:26:46,977 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:46,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 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-23 14:26:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:46,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-01-23 14:26:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:46,979 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:46,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:26:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:46,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:46,981 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:46,981 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:46,981 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:46,981 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:46,981 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:46,981 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:46,981 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:46,982 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_sub_listErr0EnsuresViolation======== [2018-01-23 14:26:46,982 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:26:46,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:46,984 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-23 14:26:46,984 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_sub_listErr0EnsuresViolation]=== [2018-01-23 14:26:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1195581130, now seen corresponding path program 1 times [2018-01-23 14:26:46,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:46,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:46,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:46,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:46,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:46,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:46,998 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-23 14:26:46,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:46,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:46,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:46,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:47,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:47,000 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:47,005 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:47,006 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-23 14:26:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:47,007 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:47,007 INFO L226 Difference]: Without dead ends: 54 [2018-01-23 14:26:47,007 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-23 14:26:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-23 14:26:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-23 14:26:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-23 14:26:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-23 14:26:47,013 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 22 [2018-01-23 14:26:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:47,014 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-23 14:26:47,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-23 14:26:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:26:47,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:47,015 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-23 14:26:47,015 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_sub_listErr0EnsuresViolation]=== [2018-01-23 14:26:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash -463951323, now seen corresponding path program 1 times [2018-01-23 14:26:47,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:47,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:47,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:47,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:47,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:47,053 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-23 14:26:47,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:47,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:47,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:26:47,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:26:47,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:26:47,054 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 3 states. [2018-01-23 14:26:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:47,143 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-23 14:26:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:26:47,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-23 14:26:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:47,144 INFO L225 Difference]: With dead ends: 54 [2018-01-23 14:26:47,145 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:47,145 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-23 14:26:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:47,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-23 14:26:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:47,146 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:47,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:26:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:47,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:47,148 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:47,148 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:47,148 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:47,148 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:47,148 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:47,148 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:47,149 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:47,149 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:26:47,149 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-23 14:26:47,151 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:47,151 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-23 14:26:47,151 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:26:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1280962335, now seen corresponding path program 1 times [2018-01-23 14:26:47,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:47,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:47,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:47,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:47,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:47,165 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-23 14:26:47,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:47,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:47,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:47,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:47,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:47,166 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:47,172 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:47,173 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-23 14:26:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:47,174 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:47,174 INFO L226 Difference]: Without dead ends: 87 [2018-01-23 14:26:47,175 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-23 14:26:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-23 14:26:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-23 14:26:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-23 14:26:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-23 14:26:47,183 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 26 [2018-01-23 14:26:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:47,183 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-23 14:26:47,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-23 14:26:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-23 14:26:47,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:47,185 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-23 14:26:47,185 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:26:47,185 INFO L82 PathProgramCache]: Analyzing trace with hash 167217557, now seen corresponding path program 1 times [2018-01-23 14:26:47,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:47,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:47,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:47,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:47,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:47,275 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-23 14:26:47,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:47,276 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-23 14:26:47,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:47,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:47,390 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-23 14:26:47,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:26:47,409 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-23 14:26:47,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:26:47,413 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-23 14:26:47,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-23 14:26:47,464 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-23 14:26:47,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:47,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-23 14:26:47,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:26:47,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:26:47,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2018-01-23 14:26:47,500 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 7 states. [2018-01-23 14:26:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:47,639 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-01-23 14:26:47,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:26:47,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-01-23 14:26:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:47,641 INFO L225 Difference]: With dead ends: 119 [2018-01-23 14:26:47,641 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:47,641 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2018-01-23 14:26:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:47,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-01-23 14:26:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:47,643 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:47,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:26:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:47,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:47,644 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:47,645 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:47,645 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:47,645 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:47,645 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:47,645 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:47,645 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:47,645 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:26:47,645 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:26:47,647 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:47,648 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-23 14:26:47,648 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash 870174460, now seen corresponding path program 1 times [2018-01-23 14:26:47,648 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:47,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:47,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:47,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:47,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:47,662 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-23 14:26:47,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:47,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:47,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:47,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:47,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:47,663 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:47,670 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:47,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:47,670 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-23 14:26:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:47,671 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:47,672 INFO L226 Difference]: Without dead ends: 85 [2018-01-23 14:26:47,672 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-23 14:26:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-23 14:26:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-23 14:26:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-23 14:26:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-23 14:26:47,680 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 24 [2018-01-23 14:26:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:47,680 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-23 14:26:47,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-23 14:26:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-23 14:26:47,682 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:47,682 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-23 14:26:47,682 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash 165536944, now seen corresponding path program 1 times [2018-01-23 14:26:47,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:47,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:47,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:47,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:47,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:47,780 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-23 14:26:47,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:47,780 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-23 14:26:47,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:47,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:47,879 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-23 14:26:47,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:26:47,892 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-23 14:26:47,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:26:47,893 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-23 14:26:47,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-23 14:26:47,933 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-23 14:26:47,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:47,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-01-23 14:26:47,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:26:47,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:26:47,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=19, Unknown=2, NotChecked=8, Total=42 [2018-01-23 14:26:47,955 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states. [2018-01-23 14:26:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:48,078 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-23 14:26:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:26:48,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-01-23 14:26:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:48,079 INFO L225 Difference]: With dead ends: 117 [2018-01-23 14:26:48,079 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:48,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2018-01-23 14:26:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:48,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-01-23 14:26:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:48,081 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:48,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:26:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:48,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:48,083 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:48,083 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:48,083 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:48,083 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:48,084 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:48,084 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:48,084 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:48,084 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == list_add_tailErr0EnsuresViolation======== [2018-01-23 14:26:48,084 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-23 14:26:48,086 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:48,086 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] [2018-01-23 14:26:48,086 INFO L371 AbstractCegarLoop]: === Iteration 1 === [list_add_tailErr0EnsuresViolation]=== [2018-01-23 14:26:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash -176168903, now seen corresponding path program 1 times [2018-01-23 14:26:48,087 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:48,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:48,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:48,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:48,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:48,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:26:48,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:48,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:48,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:48,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:48,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:48,108 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:48,114 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:48,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:48,115 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 43 [2018-01-23 14:26:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:48,115 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:48,115 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:48,116 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-23 14:26:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:48,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-23 14:26:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:48,117 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:48,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:48,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:48,119 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:48,119 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:48,119 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:48,119 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:48,119 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:48,119 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:48,119 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:48,119 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == destroy_topErr0EnsuresViolation======== [2018-01-23 14:26:48,119 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-23 14:26:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:26:48,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:48,121 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-23 14:26:48,121 INFO L371 AbstractCegarLoop]: === Iteration 1 === [destroy_topErr0EnsuresViolation]=== [2018-01-23 14:26:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash 391106876, now seen corresponding path program 1 times [2018-01-23 14:26:48,121 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:48,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:48,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:48,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:48,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:48,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:48,132 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-23 14:26:48,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:26:48,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:26:48,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:26:48,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:26:48,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:26:48,133 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-01-23 14:26:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:48,139 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-01-23 14:26:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:26:48,139 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-23 14:26:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:48,141 INFO L225 Difference]: With dead ends: 183 [2018-01-23 14:26:48,141 INFO L226 Difference]: Without dead ends: 80 [2018-01-23 14:26:48,141 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-23 14:26:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-23 14:26:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-23 14:26:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-23 14:26:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-23 14:26:48,148 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 19 [2018-01-23 14:26:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:48,149 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-23 14:26:48,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:26:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-23 14:26:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-23 14:26:48,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:48,150 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-23 14:26:48,150 INFO L371 AbstractCegarLoop]: === Iteration 2 === [destroy_topErr0EnsuresViolation]=== [2018-01-23 14:26:48,151 INFO L82 PathProgramCache]: Analyzing trace with hash -589432056, now seen corresponding path program 1 times [2018-01-23 14:26:48,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:48,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:48,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:48,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:48,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:48,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:48,217 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-23 14:26:48,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:48,217 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-23 14:26:48,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:48,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:48,293 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-23 14:26:48,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:48,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2018-01-23 14:26:48,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:26:48,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:26:48,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:26:48,315 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 4 states. [2018-01-23 14:26:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:48,567 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-01-23 14:26:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:26:48,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-01-23 14:26:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:48,568 INFO L225 Difference]: With dead ends: 112 [2018-01-23 14:26:48,569 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:26:48,569 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 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-23 14:26:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:26:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:26:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:26:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:26:48,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-01-23 14:26:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:48,570 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:26:48,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:26:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:26:48,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:26:48,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:26:48 BoogieIcfgContainer [2018-01-23 14:26:48,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:26:48,574 INFO L168 Benchmark]: Toolchain (without parser) took 4732.19 ms. Allocated memory was 305.1 MB in the beginning and 521.7 MB in the end (delta: 216.5 MB). Free memory was 262.1 MB in the beginning and 351.7 MB in the end (delta: -89.6 MB). Peak memory consumption was 126.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:48,575 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 305.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:26:48,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.28 ms. Allocated memory is still 305.1 MB. Free memory was 262.1 MB in the beginning and 250.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:48,576 INFO L168 Benchmark]: Boogie Preprocessor took 43.72 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:48,576 INFO L168 Benchmark]: RCFGBuilder took 412.13 ms. Allocated memory is still 305.1 MB. Free memory was 248.1 MB in the beginning and 220.9 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:48,577 INFO L168 Benchmark]: TraceAbstraction took 4047.83 ms. Allocated memory was 305.1 MB in the beginning and 521.7 MB in the end (delta: 216.5 MB). Free memory was 220.9 MB in the beginning and 351.7 MB in the end (delta: -130.8 MB). Peak memory consumption was 85.8 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:48,579 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 305.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.28 ms. Allocated memory is still 305.1 MB. Free memory was 262.1 MB in the beginning and 250.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.72 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 412.13 ms. Allocated memory is still 305.1 MB. Free memory was 248.1 MB in the beginning and 220.9 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4047.83 ms. Allocated memory was 305.1 MB in the beginning and 521.7 MB in the end (delta: 216.5 MB). Free memory was 220.9 MB in the beginning and 351.7 MB in the end (delta: -130.8 MB). Peak memory consumption was 85.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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, 98 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 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=98occurred 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, 27 LocationsWithAnnotation, 59 PreInvPairs, 73 NumberOfFragments, 27 HoareAnnotationTreeSize, 59 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 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: 665]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L698] FCALL struct list_head top = { &(top), &(top) }; VAL [top={33:0}] [L699] CALL create_top(&top) VAL [top={33:0}] [L693] CALL insert_top(top) VAL [head={33:0}] [L683] EXPR, FCALL malloc(sizeof(*top)) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}] [L683] struct top_list *top = malloc(sizeof(*top)); VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L684] COND FALSE !(!top) VAL [head={33:0}, head={33:0}, malloc(sizeof(*top))={38:0}, top={38:0}] [L686] CALL create_sub_list(&top->sub1) VAL [sub={38:8}] [L675] FCALL sub->prev = sub VAL [sub={38:8}, sub={38:8}] [L676] FCALL sub->next = sub VAL [sub={38:8}, sub={38:8}] [L678] CALL insert_sub(sub) VAL [head={38:8}] [L667] EXPR, FCALL malloc(sizeof(*sub)) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}] [L667] struct sub_list *sub = malloc(sizeof(*sub)); VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L668] COND FALSE !(!sub) VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L670] FCALL sub->number = 0 VAL [head={38:8}, head={38:8}, malloc(sizeof(*sub))={35:0}, sub={35:0}] [L671] 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}] [L671] 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, 98 locations, 11 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 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=98occurred 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, 98 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=98occurred 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: 690]: 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, 98 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 19 SDslu, 15 SDs, 0 SdLazy, 34 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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.1s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 21721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 681]: 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, 98 locations, 11 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 43 SDslu, 17 SDs, 0 SdLazy, 37 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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.2s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 228 ConstructedInterpolants, 18 QuantifiedInterpolants, 32480 SizeOfPredicates, 3 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 106/118 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, 98 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 21 SDslu, 15 SDs, 0 SdLazy, 34 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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.1s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 29236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 673]: 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, 98 locations, 11 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 18 SDslu, 7 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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=98occurred 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, 98 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 32 SDslu, 23 SDs, 0 SdLazy, 49 SolverSat, 17 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 247 ConstructedInterpolants, 18 QuantifiedInterpolants, 41695 SizeOfPredicates, 3 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 696]: 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, 98 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 39 SDslu, 25 SDs, 0 SdLazy, 50 SolverSat, 20 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 241 ConstructedInterpolants, 18 QuantifiedInterpolants, 40423 SizeOfPredicates, 3 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 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, 98 locations, 11 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 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=98occurred 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, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 6/6 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, 98 locations, 11 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 21 SDslu, 15 SDs, 0 SdLazy, 34 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 25180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 100/112 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: 677]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 657]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 692]: 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_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-23_14-26-48-591.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-10-2018-01-23_14-26-48-591.csv Received shutdown request...