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/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:24:09,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:24:09,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:24:09,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:24:09,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:24:09,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:24:09,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:24:09,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:24:09,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:24:09,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:24:09,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:24:09,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:24:09,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:24:09,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:24:09,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:24:09,661 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:24:09,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:24:09,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:24:09,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:24:09,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:24:09,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:24:09,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:24:09,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:24:09,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:24:09,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:24:09,674 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:24:09,674 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:24:09,674 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:24:09,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:24:09,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:24:09,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:24:09,676 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:24:09,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:24:09,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:24:09,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:24:09,686 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:24:09,687 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:24:09,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:24:09,687 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:24:09,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:24:09,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:24:09,688 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:24:09,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:24:09,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:24:09,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:24:09,689 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:24:09,689 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:24:09,689 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:24:09,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:24:09,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:24:09,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:24:09,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:24:09,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:24:09,690 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:24:09,691 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:24:09,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:24:09,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:24:09,691 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:24:09,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:24:09,692 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:24:09,692 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:24:09,692 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:24:09,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:24:09,692 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:24:09,693 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:24:09,693 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:24:09,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:24:09,741 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:24:09,745 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:24:09,746 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:24:09,747 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:24:09,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-01-24 13:24:09,948 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:24:09,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:24:09,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:24:09,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:24:09,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:24:09,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:24:09" (1/1) ... [2018-01-24 13:24:09,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b331d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:09, skipping insertion in model container [2018-01-24 13:24:09,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:24:09" (1/1) ... [2018-01-24 13:24:09,983 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:24:10,031 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:24:10,140 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:24:10,157 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:24:10,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10 WrapperNode [2018-01-24 13:24:10,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:24:10,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:24:10,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:24:10,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:24:10,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (1/1) ... [2018-01-24 13:24:10,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (1/1) ... [2018-01-24 13:24:10,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (1/1) ... [2018-01-24 13:24:10,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (1/1) ... [2018-01-24 13:24:10,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (1/1) ... [2018-01-24 13:24:10,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (1/1) ... [2018-01-24 13:24:10,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (1/1) ... [2018-01-24 13:24:10,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:24:10,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:24:10,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:24:10,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:24:10,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (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-24 13:24:10,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:24:10,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:24:10,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 13:24:10,260 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 13:24:10,260 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 13:24:10,260 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 13:24:10,261 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:24:10,261 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:24:10,261 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:24:10,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:24:10,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:24:10,261 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:24:10,262 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:24:10,262 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:24:10,262 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:24:10,262 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 13:24:10,262 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 13:24:10,262 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 13:24:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 13:24:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:24:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:24:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:24:10,518 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:24:10,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:24:10 BoogieIcfgContainer [2018-01-24 13:24:10,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:24:10,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:24:10,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:24:10,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:24:10,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:24:09" (1/3) ... [2018-01-24 13:24:10,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795bba2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:24:10, skipping insertion in model container [2018-01-24 13:24:10,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:24:10" (2/3) ... [2018-01-24 13:24:10,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795bba2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:24:10, skipping insertion in model container [2018-01-24 13:24:10,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:24:10" (3/3) ... [2018-01-24 13:24:10,524 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-01-24 13:24:10,531 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:24:10,537 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 13:24:10,587 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:24:10,587 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:24:10,587 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:24:10,587 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:24:10,587 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:24:10,588 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:24:10,588 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:24:10,588 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:24:10,589 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:24:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-24 13:24:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:24:10,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:24:10,617 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:24:10,617 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 13:24:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-01-24 13:24:10,623 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:24:10,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:10,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:10,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:10,671 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:24:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:10,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:24:10,822 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-24 13:24:10,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:24:10,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:24:10,825 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:24:10,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:24:10,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:24:10,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:24:10,840 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-24 13:24:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:24:11,094 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-24 13:24:11,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:24:11,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 13:24:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:24:11,107 INFO L225 Difference]: With dead ends: 178 [2018-01-24 13:24:11,107 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 13:24:11,110 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-24 13:24:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 13:24:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-01-24 13:24:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 13:24:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-01-24 13:24:11,161 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-01-24 13:24:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:24:11,162 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-01-24 13:24:11,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:24:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-01-24 13:24:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:24:11,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:24:11,163 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:24:11,164 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 13:24:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-01-24 13:24:11,164 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:24:11,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:11,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:11,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:11,167 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:24:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:11,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:24:11,257 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-24 13:24:11,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:24:11,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:24:11,257 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:24:11,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:24:11,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:24:11,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:24:11,260 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-01-24 13:24:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:24:11,306 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2018-01-24 13:24:11,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:24:11,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:24:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:24:11,309 INFO L225 Difference]: With dead ends: 176 [2018-01-24 13:24:11,309 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 13:24:11,310 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-24 13:24:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 13:24:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-01-24 13:24:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 13:24:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-01-24 13:24:11,320 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-01-24 13:24:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:24:11,320 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-01-24 13:24:11,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:24:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-01-24 13:24:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:24:11,321 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:24:11,321 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-24 13:24:11,321 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 13:24:11,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-01-24 13:24:11,322 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:24:11,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:11,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:11,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:11,324 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:24:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:11,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:24:11,404 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-24 13:24:11,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:24:11,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:24:11,404 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:24:11,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:24:11,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:24:11,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:24:11,405 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-01-24 13:24:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:24:11,438 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-24 13:24:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:24:11,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:24:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:24:11,439 INFO L225 Difference]: With dead ends: 76 [2018-01-24 13:24:11,440 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 13:24:11,440 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:24:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 13:24:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-24 13:24:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 13:24:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-24 13:24:11,449 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-01-24 13:24:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:24:11,449 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-24 13:24:11,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:24:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-24 13:24:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:24:11,450 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:24:11,451 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-24 13:24:11,451 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 13:24:11,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-01-24 13:24:11,451 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:24:11,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:11,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:11,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:11,453 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:24:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:11,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:24:11,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-24 13:24:11,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:24:11,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:24:11,512 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:24:11,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:24:11,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:24:11,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:24:11,513 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-01-24 13:24:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:24:11,605 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-01-24 13:24:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:24:11,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:24:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:24:11,606 INFO L225 Difference]: With dead ends: 72 [2018-01-24 13:24:11,607 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 13:24:11,607 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:24:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 13:24:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 13:24:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 13:24:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-24 13:24:11,615 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-24 13:24:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:24:11,616 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-24 13:24:11,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:24:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-24 13:24:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:24:11,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:24:11,617 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-24 13:24:11,617 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 13:24:11,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-01-24 13:24:11,618 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:24:11,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:11,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:11,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:11,619 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:24:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:11,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:24:11,987 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-24 13:24:11,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:24:11,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:24:11,988 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:24:11,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:24:11,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:24:11,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:24:11,989 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-01-24 13:24:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:24:12,213 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-01-24 13:24:12,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:24:12,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 13:24:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:24:12,215 INFO L225 Difference]: With dead ends: 132 [2018-01-24 13:24:12,216 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 13:24:12,216 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:24:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 13:24:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-01-24 13:24:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 13:24:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-24 13:24:12,224 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-01-24 13:24:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:24:12,225 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-24 13:24:12,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:24:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-24 13:24:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:24:12,226 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:24:12,226 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:24:12,226 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 13:24:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-01-24 13:24:12,227 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:24:12,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:12,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:12,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:12,228 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:24:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:12,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:24:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:12,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:24:12,609 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:24:12,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:12,615 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:24:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:12,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:24:12,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:24:12,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:12,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:24:12,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:12,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:24:12,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:24:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:13,035 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:24:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:13,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:24:13,628 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:24:13,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:13,641 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:24:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:13,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:24:13,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:24:13,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:13,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:24:13,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:13,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:24:13,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:24:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:13,798 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:24:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:14,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:24:14,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-24 13:24:14,295 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:24:14,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 13:24:14,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 13:24:14,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-24 13:24:14,296 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 18 states. [2018-01-24 13:24:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:24:14,708 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-24 13:24:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:24:14,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-24 13:24:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:24:14,710 INFO L225 Difference]: With dead ends: 136 [2018-01-24 13:24:14,710 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 13:24:14,711 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 13:24:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 13:24:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-24 13:24:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 13:24:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-24 13:24:14,721 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-01-24 13:24:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:24:14,721 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-24 13:24:14,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 13:24:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-24 13:24:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:24:14,723 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:24:14,723 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:24:14,723 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 13:24:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-01-24 13:24:14,723 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:24:14,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:14,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:24:14,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:14,725 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:24:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:14,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:24:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:15,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:24:15,086 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:24:15,091 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:24:15,091 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:24:15,101 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:24:15,105 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:24:15,106 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:24:15,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:24:15,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:24:15,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:15,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:24:15,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:15,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:24:15,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:24:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:15,437 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:24:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:18,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:24:18,282 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:24:18,285 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:24:18,285 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:24:18,299 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:24:18,311 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:24:18,321 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:24:18,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:24:18,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:24:18,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:18,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:24:18,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:18,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:24:18,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:24:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:18,489 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:24:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:19,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:24:19,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11, 10, 11] total 38 [2018-01-24 13:24:19,179 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:24:19,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 13:24:19,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 13:24:19,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1323, Unknown=1, NotChecked=0, Total=1482 [2018-01-24 13:24:19,180 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 21 states. [2018-01-24 13:24:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:24:19,634 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-24 13:24:19,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:24:19,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-01-24 13:24:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:24:19,635 INFO L225 Difference]: With dead ends: 140 [2018-01-24 13:24:19,635 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 13:24:19,636 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=260, Invalid=1809, Unknown=1, NotChecked=0, Total=2070 [2018-01-24 13:24:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 13:24:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-01-24 13:24:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 13:24:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-24 13:24:19,644 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 27 [2018-01-24 13:24:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:24:19,645 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-24 13:24:19,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 13:24:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-24 13:24:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 13:24:19,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:24:19,645 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:24:19,646 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 13:24:19,646 INFO L82 PathProgramCache]: Analyzing trace with hash -449495888, now seen corresponding path program 3 times [2018-01-24 13:24:19,646 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:24:19,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:19,647 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:24:19,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:24:19,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:24:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:24:19,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:24:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:24:19,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:24:19,977 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:24:19,984 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:24:19,984 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:24:19,996 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:24:19,999 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:24:20,004 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:24:20,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:24:20,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:24:20,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:20,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:24:20,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:24:20,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:24:20,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:24:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 13:24:24,474 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:24:27,312 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 150 [2018-01-24 13:24:31,982 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 252 Received shutdown request... [2018-01-24 13:25:23,362 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:25:23,362 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:25:23,367 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:25:23,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:25:23 BoogieIcfgContainer [2018-01-24 13:25:23,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:25:23,368 INFO L168 Benchmark]: Toolchain (without parser) took 73420.08 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 849.3 MB). Free memory was 268.4 MB in the beginning and 561.9 MB in the end (delta: -293.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 13:25:23,369 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 309.3 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:25:23,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.89 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 254.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:25:23,370 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 309.3 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:25:23,371 INFO L168 Benchmark]: RCFGBuilder took 310.70 ms. Allocated memory is still 309.3 MB. Free memory was 252.5 MB in the beginning and 229.8 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-01-24 13:25:23,371 INFO L168 Benchmark]: TraceAbstraction took 72848.29 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 849.3 MB). Free memory was 229.8 MB in the beginning and 561.9 MB in the end (delta: -332.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-24 13:25:23,373 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 309.3 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.89 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 254.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory is still 309.3 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 310.70 ms. Allocated memory is still 309.3 MB. Free memory was 252.5 MB in the beginning and 229.8 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 72848.29 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 849.3 MB). Free memory was 229.8 MB in the beginning and 561.9 MB in the end (delta: -332.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 252 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 72.7s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 482 SDtfs, 210 SDslu, 2145 SDs, 0 SdLazy, 733 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 142 SyntacticMatches, 20 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=1, 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, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 326 ConstructedInterpolants, 64 QuantifiedInterpolants, 134280 SizeOfPredicates, 20 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 0/65 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-25-23-381.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-25-23-381.csv Completed graceful shutdown