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_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:02:27,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:02:27,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:02:27,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:02:27,548 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:02:27,549 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:02:27,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:02:27,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:02:27,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:02:27,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:02:27,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:02:27,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:02:27,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:02:27,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:02:27,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:02:27,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:02:27,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:02:27,564 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:02:27,565 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:02:27,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:02:27,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:02:27,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:02:27,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:02:27,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:02:27,571 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:02:27,573 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:02:27,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:02:27,574 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:02:27,574 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:02:27,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:02:27,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:02:27,575 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-25 00:02:27,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:02:27,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:02:27,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:02:27,586 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:02:27,586 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:02:27,586 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:02:27,587 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:02:27,587 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:02:27,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:02:27,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:02:27,588 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:02:27,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:02:27,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:02:27,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:02:27,589 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:02:27,589 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:02:27,589 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:02:27,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:02:27,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:02:27,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:02:27,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:02:27,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:02:27,590 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:02:27,590 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:02:27,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:02:27,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:02:27,591 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:02:27,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:02:27,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:02:27,591 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:02:27,591 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:02:27,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:02:27,592 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:02:27,592 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:02:27,593 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:02:27,593 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:02:27,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:02:27,641 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:02:27,645 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:02:27,646 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:02:27,646 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:02:27,647 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-25 00:02:27,826 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:02:27,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:02:27,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:02:27,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:02:27,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:02:27,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:02:27" (1/1) ... [2018-01-25 00:02:27,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d3d535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:27, skipping insertion in model container [2018-01-25 00:02:27,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:02:27" (1/1) ... [2018-01-25 00:02:27,856 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:02:27,905 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:02:28,018 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:02:28,037 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:02:28,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28 WrapperNode [2018-01-25 00:02:28,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:02:28,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:02:28,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:02:28,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:02:28,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (1/1) ... [2018-01-25 00:02:28,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (1/1) ... [2018-01-25 00:02:28,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (1/1) ... [2018-01-25 00:02:28,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (1/1) ... [2018-01-25 00:02:28,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (1/1) ... [2018-01-25 00:02:28,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (1/1) ... [2018-01-25 00:02:28,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (1/1) ... [2018-01-25 00:02:28,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:02:28,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:02:28,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:02:28,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:02:28,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (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-25 00:02:28,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:02:28,134 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:02:28,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:02:28,135 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-25 00:02:28,135 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-25 00:02:28,135 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:02:28,135 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:02:28,135 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:02:28,135 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:02:28,135 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:02:28,135 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:02:28,135 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:02:28,136 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:02:28,136 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:02:28,136 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:02:28,136 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:02:28,136 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-25 00:02:28,136 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-25 00:02:28,136 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:02:28,137 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:02:28,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:02:28,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:02:28,399 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:02:28,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:02:28 BoogieIcfgContainer [2018-01-25 00:02:28,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:02:28,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:02:28,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:02:28,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:02:28,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:02:27" (1/3) ... [2018-01-25 00:02:28,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92fb3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:02:28, skipping insertion in model container [2018-01-25 00:02:28,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:02:28" (2/3) ... [2018-01-25 00:02:28,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92fb3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:02:28, skipping insertion in model container [2018-01-25 00:02:28,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:02:28" (3/3) ... [2018-01-25 00:02:28,406 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-01-25 00:02:28,414 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:02:28,421 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 00:02:28,463 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:02:28,463 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:02:28,464 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:02:28,464 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:02:28,464 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:02:28,464 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:02:28,464 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:02:28,464 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:02:28,465 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:02:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-25 00:02:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:02:28,486 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:02:28,487 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:02:28,487 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-25 00:02:28,492 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-01-25 00:02:28,495 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:02:28,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:28,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:28,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:28,543 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:02:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:28,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:02:28,682 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-25 00:02:28,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:02:28,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:02:28,685 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:02:28,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:02:28,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:02:28,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:02:28,777 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-25 00:02:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:02:28,956 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-25 00:02:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:02:28,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 00:02:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:02:28,977 INFO L225 Difference]: With dead ends: 178 [2018-01-25 00:02:28,977 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 00:02:28,981 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-25 00:02:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 00:02:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-01-25 00:02:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 00:02:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-01-25 00:02:29,038 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-01-25 00:02:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:02:29,039 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-01-25 00:02:29,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:02:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-01-25 00:02:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:02:29,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:02:29,041 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:02:29,041 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-25 00:02:29,041 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-01-25 00:02:29,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:02:29,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:29,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:29,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:29,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:02:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:29,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:02:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:02:29,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:02:29,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:02:29,166 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:02:29,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:02:29,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:02:29,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:02:29,168 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-01-25 00:02:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:02:29,193 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2018-01-25 00:02:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:02:29,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 00:02:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:02:29,196 INFO L225 Difference]: With dead ends: 176 [2018-01-25 00:02:29,196 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 00:02:29,197 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-25 00:02:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 00:02:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-01-25 00:02:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 00:02:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-01-25 00:02:29,204 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-01-25 00:02:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:02:29,204 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-01-25 00:02:29,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:02:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-01-25 00:02:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:02:29,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:02:29,205 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-25 00:02:29,205 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-25 00:02:29,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-01-25 00:02:29,206 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:02:29,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:29,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:29,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:29,207 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:02:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:29,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:02:29,268 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-25 00:02:29,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:02:29,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:02:29,268 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:02:29,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:02:29,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:02:29,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:02:29,269 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-01-25 00:02:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:02:29,302 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-25 00:02:29,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:02:29,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:02:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:02:29,304 INFO L225 Difference]: With dead ends: 76 [2018-01-25 00:02:29,304 INFO L226 Difference]: Without dead ends: 72 [2018-01-25 00:02:29,304 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-25 00:02:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-25 00:02:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-25 00:02:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 00:02:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-25 00:02:29,311 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-01-25 00:02:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:02:29,311 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-25 00:02:29,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:02:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-25 00:02:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:02:29,312 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:02:29,312 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-25 00:02:29,312 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-25 00:02:29,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-01-25 00:02:29,313 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:02:29,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:29,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:29,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:29,314 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:02:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:29,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:02:29,374 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-25 00:02:29,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:02:29,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:02:29,375 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:02:29,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:02:29,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:02:29,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:02:29,376 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-01-25 00:02:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:02:29,475 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-01-25 00:02:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:02:29,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:02:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:02:29,477 INFO L225 Difference]: With dead ends: 72 [2018-01-25 00:02:29,477 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 00:02:29,477 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-25 00:02:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 00:02:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-25 00:02:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 00:02:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-25 00:02:29,486 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-25 00:02:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:02:29,487 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-25 00:02:29,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:02:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-25 00:02:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:02:29,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:02:29,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] [2018-01-25 00:02:29,488 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-25 00:02:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-01-25 00:02:29,488 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:02:29,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:29,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:29,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:29,490 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:02:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:29,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:02:29,767 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-25 00:02:29,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:02:29,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:02:29,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:02:29,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:02:29,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:02:29,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:02:29,769 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-01-25 00:02:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:02:30,021 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-01-25 00:02:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 00:02:30,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 00:02:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:02:30,023 INFO L225 Difference]: With dead ends: 132 [2018-01-25 00:02:30,023 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 00:02:30,024 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:02:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 00:02:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-01-25 00:02:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 00:02:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-25 00:02:30,037 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-01-25 00:02:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:02:30,037 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-25 00:02:30,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:02:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-25 00:02:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 00:02:30,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:02:30,039 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-25 00:02:30,039 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-25 00:02:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-01-25 00:02:30,039 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:02:30,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:30,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:30,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:30,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:02:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:30,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:02:30,389 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-25 00:02:30,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:02:30,389 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:02:30,390 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 00:02:30,392 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [92], [94], [98], [102], [107], [108], [110], [112], [120], [124], [125], [126], [128], [129] [2018-01-25 00:02:30,434 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:02:30,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:02:48,884 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 00:02:48,885 INFO L268 AbstractInterpreter]: Visited 21 different actions 26 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-25 00:02:48,897 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 00:02:48,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:02:48,897 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-25 00:02:48,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:48,906 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:02:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:48,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:02:48,981 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-25 00:02:48,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:49,005 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-25 00:02:49,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:49,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:02:49,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:02:49,284 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-25 00:02:49,284 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:02:49,737 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-25 00:02:49,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:02:49,758 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-25 00:02:49,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:49,762 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:02:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:49,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:02:49,802 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-25 00:02:49,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:49,814 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-25 00:02:49,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:49,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:02:49,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:02:49,893 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-25 00:02:49,893 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:02:50,563 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-25 00:02:50,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 00:02:50,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-25 00:02:50,565 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 00:02:50,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 00:02:50,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 00:02:50,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-25 00:02:50,566 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 18 states. [2018-01-25 00:02:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:02:50,974 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-25 00:02:50,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:02:50,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-25 00:02:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:02:50,975 INFO L225 Difference]: With dead ends: 136 [2018-01-25 00:02:50,975 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 00:02:50,976 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-25 00:02:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 00:02:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-25 00:02:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-25 00:02:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-25 00:02:50,983 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-01-25 00:02:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:02:50,984 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-25 00:02:50,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 00:02:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-25 00:02:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 00:02:50,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:02:50,984 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-25 00:02:50,984 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-25 00:02:50,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-01-25 00:02:50,985 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:02:50,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:50,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:02:50,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:50,986 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:02:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:51,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:02:51,351 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-25 00:02:51,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:02:51,352 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:02:51,352 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 00:02:51,352 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 00:02:51,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:02:51,352 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-25 00:02:51,359 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 00:02:51,359 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 00:02:51,370 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 00:02:51,375 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 00:02:51,387 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 00:02:51,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:02:51,408 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-25 00:02:51,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:51,421 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-25 00:02:51,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:51,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:02:51,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:02:51,805 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-25 00:02:51,806 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:02:54,678 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-25 00:02:54,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:02:54,732 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-25 00:02:54,735 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 00:02:54,736 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 00:02:54,749 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 00:02:54,761 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 00:02:54,772 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 00:02:54,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:02:54,783 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-25 00:02:54,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:54,804 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-25 00:02:54,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:54,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:02:54,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:02:54,937 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-25 00:02:54,938 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:02:55,563 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-25 00:02:55,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 00:02:55,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11, 10, 11] total 38 [2018-01-25 00:02:55,565 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 00:02:55,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 00:02:55,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 00:02:55,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 00:02:55,566 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 21 states. [2018-01-25 00:02:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:02:56,036 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-25 00:02:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 00:02:56,037 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-01-25 00:02:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:02:56,037 INFO L225 Difference]: With dead ends: 140 [2018-01-25 00:02:56,037 INFO L226 Difference]: Without dead ends: 83 [2018-01-25 00:02:56,038 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=260, Invalid=1810, Unknown=0, NotChecked=0, Total=2070 [2018-01-25 00:02:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-25 00:02:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-01-25 00:02:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 00:02:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-25 00:02:56,047 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 27 [2018-01-25 00:02:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:02:56,048 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-25 00:02:56,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 00:02:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-25 00:02:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 00:02:56,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:02:56,049 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-25 00:02:56,049 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-25 00:02:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -449495888, now seen corresponding path program 3 times [2018-01-25 00:02:56,049 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:02:56,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:56,050 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 00:02:56,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:02:56,051 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:02:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:02:56,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:02:56,373 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-25 00:02:56,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:02:56,373 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:02:56,374 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 00:02:56,374 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 00:02:56,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:02:56,374 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-25 00:02:56,382 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 00:02:56,382 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 00:02:56,392 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 00:02:56,395 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 00:02:56,396 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 00:02:56,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:02:56,427 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-25 00:02:56,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:56,441 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-25 00:02:56,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:02:56,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:02:56,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:02:58,903 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-25 00:02:58,904 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:02:59,218 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 216 [2018-01-25 00:03:18,732 WARN L152 XnfTransformerHelper]: Simplifying conjuction of 9839 disjunctions. This might take some time... [2018-01-25 00:03:18,762 INFO L170 XnfTransformerHelper]: Simplified to conjuction of 3 disjunctions. [2018-01-25 00:03:18,960 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 125 [2018-01-25 00:03:19,874 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 216 Received shutdown request... [2018-01-25 00:03:27,184 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 00:03:27,184 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:03:27,187 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:03:27,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:03:27 BoogieIcfgContainer [2018-01-25 00:03:27,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:03:27,188 INFO L168 Benchmark]: Toolchain (without parser) took 59361.83 ms. Allocated memory was 305.1 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 262.1 MB in the beginning and 521.7 MB in the end (delta: -259.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-25 00:03:27,189 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 305.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:03:27,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.73 ms. Allocated memory is still 305.1 MB. Free memory was 262.1 MB in the beginning and 249.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:03:27,189 INFO L168 Benchmark]: Boogie Preprocessor took 37.37 ms. Allocated memory is still 305.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:03:27,190 INFO L168 Benchmark]: RCFGBuilder took 315.83 ms. Allocated memory is still 305.1 MB. Free memory was 247.0 MB in the beginning and 224.8 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. [2018-01-25 00:03:27,190 INFO L168 Benchmark]: TraceAbstraction took 58787.77 ms. Allocated memory was 305.1 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 223.8 MB in the beginning and 521.7 MB in the end (delta: -297.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-25 00:03:27,192 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.14 ms. Allocated memory is still 305.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.73 ms. Allocated memory is still 305.1 MB. Free memory was 262.1 MB in the beginning and 249.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.37 ms. Allocated memory is still 305.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 315.83 ms. Allocated memory is still 305.1 MB. Free memory was 247.0 MB in the beginning and 224.8 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58787.77 ms. Allocated memory was 305.1 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 223.8 MB in the beginning and 521.7 MB in the end (delta: -297.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 123 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.344462 RENAME_VARIABLES(MILLISECONDS) : 0.783448 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.289781 PROJECTAWAY(MILLISECONDS) : 2.216293 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.067860 DISJOIN(MILLISECONDS) : 1.376763 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.807001 ADD_EQUALITY(MILLISECONDS) : 0.029442 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006060 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 69 #UNFREEZE : 0 #CONJOIN : 82 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 66 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * 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 216 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 216 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 216 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 216 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 216 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 216 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 216 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 216 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 216 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 216 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 216 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 216 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 216 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 216 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 216 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 58.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, 1027 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, 18.5s AbstIntTime, 1 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.9s 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_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-03-27-202.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_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_00-03-27-202.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_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_00-03-27-202.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_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-03-27-202.csv Completed graceful shutdown