java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 08:55:42,819 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 08:55:42,821 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 08:55:42,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 08:55:42,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 08:55:42,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 08:55:42,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 08:55:42,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 08:55:42,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 08:55:42,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 08:55:42,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 08:55:42,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 08:55:42,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 08:55:42,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 08:55:42,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 08:55:42,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 08:55:42,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 08:55:42,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 08:55:42,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 08:55:42,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 08:55:42,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 08:55:42,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 08:55:42,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 08:55:42,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 08:55:42,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 08:55:42,868 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 08:55:42,868 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 08:55:42,869 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 08:55:42,869 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 08:55:42,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 08:55:42,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 08:55:42,870 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-21 08:55:42,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 08:55:42,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 08:55:42,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 08:55:42,883 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 08:55:42,883 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 08:55:42,883 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 08:55:42,883 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 08:55:42,883 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 08:55:42,884 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 08:55:42,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 08:55:42,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 08:55:42,885 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 08:55:42,885 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 08:55:42,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 08:55:42,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 08:55:42,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 08:55:42,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 08:55:42,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 08:55:42,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 08:55:42,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 08:55:42,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 08:55:42,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 08:55:42,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 08:55:42,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 08:55:42,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 08:55:42,888 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 08:55:42,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 08:55:42,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:55:42,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 08:55:42,888 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 08:55:42,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 08:55:42,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 08:55:42,889 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 08:55:42,889 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 08:55:42,889 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 08:55:42,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 08:55:42,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 08:55:42,890 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 08:55:42,891 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 08:55:42,891 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 08:55:42,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 08:55:42,943 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 08:55:42,947 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 08:55:42,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 08:55:42,950 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 08:55:42,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-21 08:55:43,164 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 08:55:43,170 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 08:55:43,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 08:55:43,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 08:55:43,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 08:55:43,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba505b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43, skipping insertion in model container [2018-01-21 08:55:43,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,195 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:55:43,247 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:55:43,372 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:55:43,392 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:55:43,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43 WrapperNode [2018-01-21 08:55:43,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 08:55:43,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 08:55:43,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 08:55:43,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 08:55:43,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (1/1) ... [2018-01-21 08:55:43,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 08:55:43,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 08:55:43,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 08:55:43,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 08:55:43,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:55:43,494 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 08:55:43,494 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 08:55:43,494 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-01-21 08:55:43,494 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 08:55:43,494 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 08:55:43,494 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-21 08:55:43,494 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 08:55:43,494 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 08:55:43,494 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 08:55:43,495 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 08:55:43,495 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 08:55:43,495 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 08:55:43,495 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 08:55:43,495 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 08:55:43,495 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 08:55:43,496 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 08:55:43,496 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-01-21 08:55:43,496 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 08:55:43,496 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-21 08:55:43,496 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 08:55:43,496 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-21 08:55:43,497 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 08:55:43,497 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 08:55:43,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 08:55:43,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 08:55:43,771 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 08:55:43,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:55:43 BoogieIcfgContainer [2018-01-21 08:55:43,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 08:55:43,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 08:55:43,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 08:55:43,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 08:55:43,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 08:55:43" (1/3) ... [2018-01-21 08:55:43,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1331734c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:55:43, skipping insertion in model container [2018-01-21 08:55:43,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:55:43" (2/3) ... [2018-01-21 08:55:43,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1331734c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:55:43, skipping insertion in model container [2018-01-21 08:55:43,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:55:43" (3/3) ... [2018-01-21 08:55:43,778 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-21 08:55:43,785 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 08:55:43,792 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-21 08:55:43,831 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:55:43,832 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:55:43,832 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:55:43,832 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:55:43,832 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:55:43,832 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:55:43,832 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:55:43,832 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 08:55:43,833 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:55:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 08:55:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 08:55:43,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:43,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:43,860 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 08:55:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 643835230, now seen corresponding path program 1 times [2018-01-21 08:55:43,866 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:43,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:43,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:43,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:43,916 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:43,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:44,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:44,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:55:44,049 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:44,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:55:44,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:55:44,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:55:44,065 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-21 08:55:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:44,324 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2018-01-21 08:55:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:55:44,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 08:55:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:44,338 INFO L225 Difference]: With dead ends: 136 [2018-01-21 08:55:44,338 INFO L226 Difference]: Without dead ends: 37 [2018-01-21 08:55:44,343 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:55:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-21 08:55:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-21 08:55:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-21 08:55:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-21 08:55:44,380 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 17 [2018-01-21 08:55:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:44,381 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-21 08:55:44,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:55:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-21 08:55:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 08:55:44,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:44,383 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:44,383 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 08:55:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash 250272672, now seen corresponding path program 1 times [2018-01-21 08:55:44,384 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:44,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:44,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:55:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:55:44,471 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:55:44,480 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,482 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,483 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,496 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:55:44,496 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:55:44,496 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:55:44,496 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:55:44,496 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:55:44,496 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:55:44,497 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:55:44,497 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 08:55:44,497 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:55:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 08:55:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 08:55:44,499 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:44,500 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 08:55:44,500 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 08:55:44,500 INFO L82 PathProgramCache]: Analyzing trace with hash 153409, now seen corresponding path program 1 times [2018-01-21 08:55:44,500 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:44,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:44,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,503 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:55:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:55:44,513 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:55:44,514 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,516 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:55:44,517 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:55:44,517 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:55:44,517 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:55:44,517 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:55:44,517 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:55:44,517 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:55:44,518 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_positiveErr0EnsuresViolation======== [2018-01-21 08:55:44,518 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:55:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 08:55:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 08:55:44,521 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:44,521 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:44,521 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_positiveErr0EnsuresViolation]=== [2018-01-21 08:55:44,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1058941792, now seen corresponding path program 1 times [2018-01-21 08:55:44,522 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:44,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:44,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,523 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:44,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:44,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:44,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-21 08:55:44,545 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:44,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:55:44,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:55:44,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:55:44,546 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2018-01-21 08:55:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:44,555 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2018-01-21 08:55:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:55:44,556 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-21 08:55:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:44,556 INFO L225 Difference]: With dead ends: 124 [2018-01-21 08:55:44,556 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:55:44,557 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:55:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:55:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:55:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:55:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:55:44,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-01-21 08:55:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:44,559 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:55:44,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:55:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:55:44,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:55:44,562 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:55:44,562 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:55:44,563 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:55:44,563 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:55:44,563 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:55:44,563 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:55:44,563 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:55:44,563 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 08:55:44,563 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:55:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 08:55:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 08:55:44,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:44,567 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:44,567 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 08:55:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1013801841, now seen corresponding path program 1 times [2018-01-21 08:55:44,568 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:44,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:44,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,570 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:44,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:44,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:44,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:55:44,672 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:44,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:55:44,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:55:44,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:55:44,673 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 5 states. [2018-01-21 08:55:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:44,706 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-01-21 08:55:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:55:44,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 08:55:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:44,709 INFO L225 Difference]: With dead ends: 136 [2018-01-21 08:55:44,709 INFO L226 Difference]: Without dead ends: 49 [2018-01-21 08:55:44,710 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:55:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-21 08:55:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-21 08:55:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-21 08:55:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-21 08:55:44,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 26 [2018-01-21 08:55:44,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:44,719 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-21 08:55:44,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:55:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-21 08:55:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 08:55:44,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:44,720 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] [2018-01-21 08:55:44,720 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 08:55:44,720 INFO L82 PathProgramCache]: Analyzing trace with hash 763530293, now seen corresponding path program 1 times [2018-01-21 08:55:44,720 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:44,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:44,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,722 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:44,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:44,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:44,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 08:55:44,782 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:44,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:55:44,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:55:44,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:55:44,783 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-01-21 08:55:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:44,810 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-21 08:55:44,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 08:55:44,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-21 08:55:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:44,812 INFO L225 Difference]: With dead ends: 56 [2018-01-21 08:55:44,812 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:55:44,813 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:55:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:55:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:55:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:55:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:55:44,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-21 08:55:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:44,814 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:55:44,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:55:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:55:44,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:55:44,817 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:55:44,817 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:55:44,817 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:55:44,817 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:55:44,817 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:55:44,817 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:55:44,817 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:55:44,818 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 08:55:44,818 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:55:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 08:55:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 08:55:44,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:44,821 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:44,821 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:55:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash -116254489, now seen corresponding path program 1 times [2018-01-21 08:55:44,821 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:44,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:44,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,823 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:55:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:55:44,855 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:55:44,858 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,859 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,859 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,860 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,860 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,860 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:55:44,864 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:55:44,864 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:55:44,864 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:55:44,865 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:55:44,865 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:55:44,865 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:55:44,865 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:55:44,865 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 08:55:44,865 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:55:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 08:55:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 08:55:44,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:44,868 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:44,868 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 08:55:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1215520132, now seen corresponding path program 1 times [2018-01-21 08:55:44,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:44,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:44,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:44,870 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:44,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:44,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:44,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:55:44,918 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:44,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:55:44,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:55:44,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:55:44,919 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-21 08:55:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:45,002 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2018-01-21 08:55:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:55:45,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-21 08:55:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:45,004 INFO L225 Difference]: With dead ends: 136 [2018-01-21 08:55:45,004 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:55:45,005 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:55:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:55:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:55:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:55:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:55:45,005 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 08:55:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:45,006 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:55:45,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:55:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:55:45,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:55:45,007 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:55:45,007 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:55:45,007 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:55:45,007 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:55:45,007 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:55:45,007 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:55:45,008 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:55:45,008 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-21 08:55:45,008 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:55:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 08:55:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 08:55:45,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:45,010 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] [2018-01-21 08:55:45,010 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-21 08:55:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash -498277862, now seen corresponding path program 1 times [2018-01-21 08:55:45,010 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:45,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:45,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,012 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:45,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:45,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:45,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:55:45,075 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:45,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:55:45,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:55:45,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:55:45,076 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 5 states. [2018-01-21 08:55:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:45,116 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-01-21 08:55:45,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:55:45,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-21 08:55:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:45,118 INFO L225 Difference]: With dead ends: 136 [2018-01-21 08:55:45,118 INFO L226 Difference]: Without dead ends: 60 [2018-01-21 08:55:45,119 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:55:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-21 08:55:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-21 08:55:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 08:55:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-01-21 08:55:45,124 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 32 [2018-01-21 08:55:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:45,124 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-01-21 08:55:45,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:55:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-01-21 08:55:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 08:55:45,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:45,126 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:45,126 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-21 08:55:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1466399899, now seen corresponding path program 1 times [2018-01-21 08:55:45,126 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:45,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:45,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:45,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:45,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:45,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 08:55:45,181 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:45,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:55:45,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:55:45,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:55:45,182 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 4 states. [2018-01-21 08:55:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:45,213 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-01-21 08:55:45,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 08:55:45,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-21 08:55:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:45,214 INFO L225 Difference]: With dead ends: 67 [2018-01-21 08:55:45,214 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:55:45,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:55:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:55:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:55:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:55:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:55:45,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-21 08:55:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:45,216 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:55:45,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:55:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:55:45,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:55:45,218 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:55:45,218 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:55:45,218 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:55:45,218 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:55:45,219 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:55:45,219 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:55:45,219 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:55:45,219 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 08:55:45,219 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:55:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 08:55:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 08:55:45,221 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:45,221 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:45,222 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 08:55:45,222 INFO L82 PathProgramCache]: Analyzing trace with hash 86180953, now seen corresponding path program 1 times [2018-01-21 08:55:45,222 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:45,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:45,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,224 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:45,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:45,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:45,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:55:45,271 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:45,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:55:45,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:55:45,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:55:45,271 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-21 08:55:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:45,361 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2018-01-21 08:55:45,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:55:45,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-21 08:55:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:45,363 INFO L225 Difference]: With dead ends: 136 [2018-01-21 08:55:45,363 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 08:55:45,364 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:55:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 08:55:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2018-01-21 08:55:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-21 08:55:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-01-21 08:55:45,380 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2018-01-21 08:55:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:45,381 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-01-21 08:55:45,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:55:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-01-21 08:55:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 08:55:45,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:45,385 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:45,385 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 08:55:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash -519965000, now seen corresponding path program 1 times [2018-01-21 08:55:45,385 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:45,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:45,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:45,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:45,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:45,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:55:45,469 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:45,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:55:45,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:55:45,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:55:45,470 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2018-01-21 08:55:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:45,487 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-01-21 08:55:45,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:55:45,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-21 08:55:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:45,490 INFO L225 Difference]: With dead ends: 110 [2018-01-21 08:55:45,490 INFO L226 Difference]: Without dead ends: 63 [2018-01-21 08:55:45,492 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:55:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-21 08:55:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-21 08:55:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-21 08:55:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-21 08:55:45,499 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 38 [2018-01-21 08:55:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:45,499 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-21 08:55:45,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:55:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-21 08:55:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 08:55:45,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:55:45,502 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:55:45,502 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 08:55:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1407131062, now seen corresponding path program 1 times [2018-01-21 08:55:45,503 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:55:45,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:55:45,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:55:45,505 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:55:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:55:45,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:55:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:55:45,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:55:45,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 08:55:45,548 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:55:45,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:55:45,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:55:45,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:55:45,549 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 4 states. [2018-01-21 08:55:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:55:45,586 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-01-21 08:55:45,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 08:55:45,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-21 08:55:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:55:45,587 INFO L225 Difference]: With dead ends: 70 [2018-01-21 08:55:45,587 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:55:45,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:55:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:55:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:55:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:55:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:55:45,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-21 08:55:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:55:45,588 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:55:45,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:55:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:55:45,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:55:45,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 08:55:45 BoogieIcfgContainer [2018-01-21 08:55:45,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 08:55:45,591 INFO L168 Benchmark]: Toolchain (without parser) took 2425.70 ms. Allocated memory was 307.2 MB in the beginning and 480.2 MB in the end (delta: 173.0 MB). Free memory was 264.5 MB in the beginning and 422.7 MB in the end (delta: -158.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 5.3 GB. [2018-01-21 08:55:45,592 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:55:45,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.94 ms. Allocated memory is still 307.2 MB. Free memory was 264.5 MB in the beginning and 251.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-21 08:55:45,592 INFO L168 Benchmark]: Boogie Preprocessor took 42.07 ms. Allocated memory is still 307.2 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:55:45,592 INFO L168 Benchmark]: RCFGBuilder took 328.27 ms. Allocated memory is still 307.2 MB. Free memory was 249.2 MB in the beginning and 227.5 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. [2018-01-21 08:55:45,593 INFO L168 Benchmark]: TraceAbstraction took 1817.14 ms. Allocated memory was 307.2 MB in the beginning and 480.2 MB in the end (delta: 173.0 MB). Free memory was 227.5 MB in the beginning and 422.7 MB in the end (delta: -195.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:55:45,594 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.21 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.94 ms. Allocated memory is still 307.2 MB. Free memory was 264.5 MB in the beginning and 251.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.07 ms. Allocated memory is still 307.2 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 328.27 ms. Allocated memory is still 307.2 MB. Free memory was 249.2 MB in the beginning and 227.5 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1817.14 ms. Allocated memory was 307.2 MB in the beginning and 480.2 MB in the end (delta: 173.0 MB). Free memory was 227.5 MB in the beginning and 422.7 MB in the end (delta: -195.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1481] CALL entry_point() [L1466] int i; [L1467] CALL, EXPR ldv_positive() [L1064] int r = __VERIFIER_nondet_int(); [L1065] COND TRUE r>0 [L1065] RET return r; VAL [\result=16777215, r=16777215] [L1467] EXPR ldv_positive() VAL [ldv_positive()=16777215] [L1467] int len = ldv_positive(); [L1469] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=67108860] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=67108860, malloc(size)={67108862:0}, size=67108860] [L1074] return malloc(size); VAL [\old(size)=67108860, \result={67108862:0}, malloc(size)={67108862:0}, size=67108860] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 8 procedures, 73 locations, 8 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 42 SDslu, 15 SDs, 0 SdLazy, 29 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 352 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 8 procedures, 73 locations, 8 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=73occurred 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: 1063]: 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: ldv_positiveErr0EnsuresViolation CFG has 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1440]: 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: alloc_17Err0EnsuresViolation CFG has 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 12 SDslu, 235 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 2414 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1481] CALL entry_point() [L1466] int i; [L1467] CALL, EXPR ldv_positive() [L1064] int r = __VERIFIER_nondet_int(); [L1065] COND TRUE r>0 [L1065] RET return r; VAL [\result=1, r=1] [L1467] EXPR ldv_positive() VAL [ldv_positive()=1] [L1467] int len = ldv_positive(); [L1469] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1469] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=1] [L1469] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1470] COND FALSE, RET !(\read(**array)) VAL [array={0:0}, len=1] [L1481] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 8 procedures, 73 locations, 8 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=73occurred 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, 25 NumberOfCodeBlocks, 25 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: 1480]: 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 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 36 SDslu, 15 SDs, 0 SdLazy, 29 SolverSat, 18 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=73occurred 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, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 1100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1458]: 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: free_17Err0EnsuresViolation CFG has 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 12 SDslu, 235 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 3433 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: 1465]: 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: entry_pointErr0EnsuresViolation CFG has 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 45 SDslu, 217 SDs, 0 SdLazy, 58 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 5086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_08-55-45-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_08-55-45-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_08-55-45-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_08-55-45-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_08-55-45-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_08-55-45-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_08-55-45-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_08-55-45-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_08-55-45-605.csv Received shutdown request...