java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:57:04,422 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:57:04,424 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:57:04,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:57:04,440 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:57:04,441 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:57:04,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:57:04,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:57:04,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:57:04,447 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:57:04,448 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:57:04,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:57:04,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:57:04,451 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:57:04,452 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:57:04,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:57:04,457 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:57:04,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:57:04,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:57:04,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:57:04,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:57:04,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:57:04,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:57:04,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:57:04,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:57:04,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:57:04,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:57:04,471 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:57:04,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:57:04,471 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:57:04,472 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:57:04,472 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:57:04,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:57:04,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:57:04,484 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:57:04,484 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:57:04,485 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:57:04,485 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:57:04,485 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:57:04,485 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:57:04,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:57:04,486 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:57:04,487 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:57:04,487 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:57:04,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:57:04,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:57:04,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:57:04,488 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:57:04,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:57:04,488 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:57:04,488 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:57:04,488 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:57:04,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:57:04,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:57:04,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:57:04,489 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:57:04,489 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:57:04,489 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:57:04,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:57:04,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:57:04,490 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:57:04,490 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:57:04,491 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:57:04,491 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:57:04,491 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:57:04,491 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:57:04,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:57:04,491 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:57:04,492 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:57:04,492 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:57:04,493 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:57:04,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:57:04,543 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:57:04,548 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:57:04,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:57:04,550 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:57:04,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-21 00:57:04,753 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:57:04,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:57:04,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:57:04,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:57:04,763 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:57:04,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:04,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2844af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04, skipping insertion in model container [2018-01-21 00:57:04,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:04,782 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:57:04,832 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:57:04,965 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:57:04,983 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:57:04,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04 WrapperNode [2018-01-21 00:57:04,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:57:04,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:57:04,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:57:04,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:57:05,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:05,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:05,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:05,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:05,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:05,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:05,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (1/1) ... [2018-01-21 00:57:05,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:57:05,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:57:05,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:57:05,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:57:05,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:57:05,081 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:57:05,082 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:57:05,082 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 00:57:05,082 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 00:57:05,082 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-21 00:57:05,082 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 00:57:05,082 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:57:05,082 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:57:05,082 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:57:05,083 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:57:05,083 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:57:05,083 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:57:05,083 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:57:05,083 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:57:05,083 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:57:05,083 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 00:57:05,084 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 00:57:05,084 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-21 00:57:05,084 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 00:57:05,084 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:57:05,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:57:05,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:57:05,332 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:57:05,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:57:05 BoogieIcfgContainer [2018-01-21 00:57:05,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:57:05,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:57:05,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:57:05,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:57:05,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:57:04" (1/3) ... [2018-01-21 00:57:05,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c7bf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:57:05, skipping insertion in model container [2018-01-21 00:57:05,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:04" (2/3) ... [2018-01-21 00:57:05,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c7bf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:57:05, skipping insertion in model container [2018-01-21 00:57:05,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:57:05" (3/3) ... [2018-01-21 00:57:05,338 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-21 00:57:05,344 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:57:05,352 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 00:57:05,398 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:05,398 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:05,399 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:05,399 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:05,399 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:05,399 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:05,399 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:05,399 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 00:57:05,400 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 00:57:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 00:57:05,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:05,424 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:05,424 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:57:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1267872988, now seen corresponding path program 1 times [2018-01-21 00:57:05,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:05,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:05,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:05,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:05,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:05,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:05,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:05,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:57:05,582 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:05,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:57:05,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:57:05,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:57:05,597 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-21 00:57:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:05,822 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-21 00:57:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:57:05,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 00:57:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:05,831 INFO L225 Difference]: With dead ends: 129 [2018-01-21 00:57:05,832 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 00:57:05,835 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 00:57:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 00:57:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 00:57:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 00:57:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 00:57:05,866 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-21 00:57:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:05,866 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 00:57:05,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:57:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 00:57:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 00:57:05,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:05,868 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:05,868 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:57:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1344677638, now seen corresponding path program 1 times [2018-01-21 00:57:05,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:05,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:05,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:05,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:05,871 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:57:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:57:05,931 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:57:05,939 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:05,941 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:05,955 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:05,955 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:05,955 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:05,955 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:05,955 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:05,956 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:05,956 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:05,956 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:57:05,956 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 00:57:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:57:05,959 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:05,959 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:57:05,959 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:57:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash 144536, now seen corresponding path program 1 times [2018-01-21 00:57:05,959 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:05,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:05,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:05,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:05,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:57:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:57:05,970 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:57:05,971 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:05,972 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:05,972 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:05,973 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:05,973 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:05,973 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:05,973 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:05,973 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:05,973 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 00:57:05,973 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 00:57:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:57:05,975 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:05,975 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] [2018-01-21 00:57:05,975 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 00:57:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash 149863804, now seen corresponding path program 1 times [2018-01-21 00:57:05,976 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:05,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:05,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:05,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:05,977 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:05,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:57:06,011 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:57:06,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:57:06,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:57:06,012 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-21 00:57:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,020 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-01-21 00:57:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:57:06,021 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 00:57:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,022 INFO L225 Difference]: With dead ends: 117 [2018-01-21 00:57:06,022 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 00:57:06,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:57:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 00:57:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 00:57:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 00:57:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 00:57:06,030 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-21 00:57:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,032 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 00:57:06,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:57:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 00:57:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:57:06,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,033 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:06,033 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 00:57:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1790905482, now seen corresponding path program 1 times [2018-01-21 00:57:06,034 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,036 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:57:06,134 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:57:06,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:57:06,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:57:06,136 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-21 00:57:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,158 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-21 00:57:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:06,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 00:57:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,161 INFO L225 Difference]: With dead ends: 76 [2018-01-21 00:57:06,161 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 00:57:06,162 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 00:57:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 00:57:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-21 00:57:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 00:57:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 00:57:06,169 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-21 00:57:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,169 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 00:57:06,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:57:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 00:57:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 00:57:06,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,170 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:06,171 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 00:57:06,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1130115224, now seen corresponding path program 1 times [2018-01-21 00:57:06,171 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:57:06,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:57:06,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:57:06,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:57:06,243 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 00:57:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,275 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-21 00:57:06,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:57:06,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 00:57:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,276 INFO L225 Difference]: With dead ends: 50 [2018-01-21 00:57:06,277 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:06,277 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 00:57:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:06,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 00:57:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,278 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:06,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:57:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:06,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:06,281 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:06,282 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:06,282 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:06,282 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:06,282 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:06,282 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:06,282 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:06,282 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:57:06,282 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 00:57:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:57:06,285 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,285 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:06,286 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:57:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1879772685, now seen corresponding path program 1 times [2018-01-21 00:57:06,286 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,288 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:57:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:57:06,310 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:57:06,312 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:06,313 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:06,313 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:06,314 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:06,314 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:06,317 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:06,317 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:06,317 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:06,317 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:06,318 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:06,318 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:06,318 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:06,318 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:57:06,318 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 00:57:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 00:57:06,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,320 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 00:57:06,321 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:57:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1816479186, now seen corresponding path program 1 times [2018-01-21 00:57:06,321 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:57:06,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:57:06,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:57:06,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:57:06,367 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-21 00:57:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,481 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-21 00:57:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:57:06,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 00:57:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,482 INFO L225 Difference]: With dead ends: 129 [2018-01-21 00:57:06,482 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:06,482 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 00:57:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:06,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 00:57:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,483 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:06,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:57:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:06,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:06,485 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:06,485 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:06,485 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:06,485 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:06,485 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:06,485 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:06,485 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:06,486 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-21 00:57:06,486 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 00:57:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:57:06,487 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,488 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:06,488 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-21 00:57:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1609342893, now seen corresponding path program 1 times [2018-01-21 00:57:06,488 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,489 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:57:06,512 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:57:06,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:57:06,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:57:06,513 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-21 00:57:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,519 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-01-21 00:57:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:57:06,520 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 00:57:06,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,521 INFO L225 Difference]: With dead ends: 117 [2018-01-21 00:57:06,521 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 00:57:06,522 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:57:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 00:57:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 00:57:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 00:57:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-01-21 00:57:06,529 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 26 [2018-01-21 00:57:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,530 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-01-21 00:57:06,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:57:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-01-21 00:57:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 00:57:06,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,532 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] [2018-01-21 00:57:06,532 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-21 00:57:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1124045575, now seen corresponding path program 1 times [2018-01-21 00:57:06,532 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:57:06,616 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:57:06,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:57:06,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:57:06,617 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 5 states. [2018-01-21 00:57:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,630 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-01-21 00:57:06,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:06,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-21 00:57:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,632 INFO L225 Difference]: With dead ends: 98 [2018-01-21 00:57:06,632 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 00:57:06,633 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 00:57:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 00:57:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 00:57:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 00:57:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-21 00:57:06,638 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 29 [2018-01-21 00:57:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,638 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-21 00:57:06,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:57:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-21 00:57:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:57:06,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,639 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] [2018-01-21 00:57:06,639 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_17Err0EnsuresViolation]=== [2018-01-21 00:57:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash -69053349, now seen corresponding path program 1 times [2018-01-21 00:57:06,640 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:57:06,684 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:57:06,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:57:06,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:57:06,686 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2018-01-21 00:57:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,712 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-21 00:57:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:57:06,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-21 00:57:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,712 INFO L225 Difference]: With dead ends: 61 [2018-01-21 00:57:06,712 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:06,713 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 00:57:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:06,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-21 00:57:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,714 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:06,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:57:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:06,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:06,715 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:06,715 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:06,715 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:06,715 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:06,715 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:06,715 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:06,715 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:06,715 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 00:57:06,715 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 00:57:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 00:57:06,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,717 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:06,717 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:57:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash -457755615, now seen corresponding path program 1 times [2018-01-21 00:57:06,718 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,719 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:57:06,740 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:57:06,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:57:06,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:57:06,741 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-21 00:57:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,836 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-21 00:57:06,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:57:06,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 00:57:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,838 INFO L225 Difference]: With dead ends: 129 [2018-01-21 00:57:06,838 INFO L226 Difference]: Without dead ends: 67 [2018-01-21 00:57:06,838 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:57:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-21 00:57:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-01-21 00:57:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 00:57:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-21 00:57:06,845 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 15 [2018-01-21 00:57:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,846 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-21 00:57:06,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:57:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-21 00:57:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:57:06,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,848 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 00:57:06,848 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:57:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1418378797, now seen corresponding path program 1 times [2018-01-21 00:57:06,848 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,850 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:06,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:06,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:57:06,923 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:06,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:57:06,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:57:06,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:57:06,925 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-01-21 00:57:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:06,948 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-01-21 00:57:06,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:06,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-21 00:57:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:06,950 INFO L225 Difference]: With dead ends: 104 [2018-01-21 00:57:06,950 INFO L226 Difference]: Without dead ends: 57 [2018-01-21 00:57:06,950 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 00:57:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-21 00:57:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-21 00:57:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-21 00:57:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-21 00:57:06,957 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 32 [2018-01-21 00:57:06,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:06,958 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-21 00:57:06,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:57:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-21 00:57:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 00:57:06,967 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:06,967 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] [2018-01-21 00:57:06,967 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:57:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash 121111435, now seen corresponding path program 1 times [2018-01-21 00:57:06,968 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:06,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:06,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:06,970 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:06,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:07,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:07,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 00:57:07,008 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:07,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:57:07,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:57:07,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:57:07,009 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 4 states. [2018-01-21 00:57:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:07,028 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-21 00:57:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 00:57:07,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-21 00:57:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:07,029 INFO L225 Difference]: With dead ends: 64 [2018-01-21 00:57:07,029 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:07,030 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 00:57:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:07,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-01-21 00:57:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:07,031 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:07,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:57:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:07,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:07,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:57:07 BoogieIcfgContainer [2018-01-21 00:57:07,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:57:07,035 INFO L168 Benchmark]: Toolchain (without parser) took 2282.14 ms. Allocated memory was 304.1 MB in the beginning and 479.2 MB in the end (delta: 175.1 MB). Free memory was 261.2 MB in the beginning and 438.9 MB in the end (delta: -177.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:57:07,037 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:57:07,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.55 ms. Allocated memory is still 304.1 MB. Free memory was 261.2 MB in the beginning and 247.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:57:07,037 INFO L168 Benchmark]: Boogie Preprocessor took 38.84 ms. Allocated memory is still 304.1 MB. Free memory was 247.2 MB in the beginning and 245.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 00:57:07,038 INFO L168 Benchmark]: RCFGBuilder took 301.52 ms. Allocated memory is still 304.1 MB. Free memory was 245.2 MB in the beginning and 224.1 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:57:07,038 INFO L168 Benchmark]: TraceAbstraction took 1701.44 ms. Allocated memory was 304.1 MB in the beginning and 479.2 MB in the end (delta: 175.1 MB). Free memory was 224.1 MB in the beginning and 438.9 MB in the end (delta: -214.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:57:07,040 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.18 ms. Allocated memory is still 304.1 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.55 ms. Allocated memory is still 304.1 MB. Free memory was 261.2 MB in the beginning and 247.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.84 ms. Allocated memory is still 304.1 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 301.52 ms. Allocated memory is still 304.1 MB. Free memory was 245.2 MB in the beginning and 224.1 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1701.44 ms. Allocated memory was 304.1 MB in the beginning and 479.2 MB in the end (delta: 175.1 MB). Free memory was 224.1 MB in the beginning and 438.9 MB in the end (delta: -214.8 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) * 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: [L1479] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 37 SDslu, 15 SDs, 0 SdLazy, 28 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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=66occurred 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, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 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 7 procedures, 66 locations, 7 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=66occurred 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: 1439]: 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 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 3 SDslu, 136 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1479] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1467] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND FALSE, RET !(\read(**array)) VAL [array={0:0}, len=10] [L1479] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 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=66occurred 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, 19 NumberOfCodeBlocks, 19 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: 1478]: 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 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 28 SolverSat, 17 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=66occurred 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, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 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: 1457]: 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 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 141 SDtfs, 3 SDslu, 172 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 3341 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 - PositiveResult [Line: 1464]: 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 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 36 SDslu, 195 SDs, 0 SdLazy, 50 SolverSat, 23 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=66occurred 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, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 3638 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_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-57-07-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-57-07-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-57-07-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-57-07-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-57-07-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-57-07-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-57-07-051.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_00-57-07-051.csv Received shutdown request...