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_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:24:51,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:24:51,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:24:51,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:24:51,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:24:51,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:24:51,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:24:51,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:24:51,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:24:51,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:24:51,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:24:51,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:24:51,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:24:51,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:24:51,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:24:51,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:24:51,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:24:51,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:24:51,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:24:51,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:24:51,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:24:51,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:24:51,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:24:51,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:24:51,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:24:51,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:24:51,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:24:51,118 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:24:51,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:24:51,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:24:51,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:24:51,120 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_imprecise.epf [2018-01-24 17:24:51,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:24:51,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:24:51,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:24:51,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:24:51,131 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:24:51,131 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:24:51,132 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:24:51,132 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:24:51,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:24:51,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:24:51,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:24:51,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:24:51,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:24:51,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:24:51,134 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:24:51,134 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:24:51,134 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:24:51,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:24:51,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:24:51,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:24:51,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:24:51,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:24:51,135 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:24:51,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:24:51,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:24:51,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:24:51,136 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:24:51,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:24:51,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:24:51,137 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:24:51,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:24:51,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:24:51,137 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:24:51,138 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:24:51,138 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:24:51,139 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:24:51,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:24:51,188 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:24:51,192 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:24:51,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:24:51,194 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:24:51,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-24 17:24:51,380 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:24:51,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:24:51,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:24:51,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:24:51,394 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:24:51,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51, skipping insertion in model container [2018-01-24 17:24:51,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,418 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:24:51,468 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:24:51,590 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:24:51,615 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:24:51,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51 WrapperNode [2018-01-24 17:24:51,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:24:51,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:24:51,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:24:51,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:24:51,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (1/1) ... [2018-01-24 17:24:51,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:24:51,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:24:51,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:24:51,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:24:51,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (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 17:24:51,722 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:24:51,723 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:24:51,723 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-01-24 17:24:51,723 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:24:51,723 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 17:24:51,723 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 17:24:51,723 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:24:51,723 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:24:51,723 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:24:51,723 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:24:51,723 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-24 17:24:51,724 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 17:24:51,725 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 17:24:51,725 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:24:51,725 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:24:51,725 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:24:51,725 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:24:52,008 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:24:52,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:24:52 BoogieIcfgContainer [2018-01-24 17:24:52,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:24:52,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:24:52,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:24:52,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:24:52,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:24:51" (1/3) ... [2018-01-24 17:24:52,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300ce48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:24:52, skipping insertion in model container [2018-01-24 17:24:52,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:51" (2/3) ... [2018-01-24 17:24:52,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300ce48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:24:52, skipping insertion in model container [2018-01-24 17:24:52,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:24:52" (3/3) ... [2018-01-24 17:24:52,017 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-24 17:24:52,027 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:24:52,034 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 17:24:52,079 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:24:52,079 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:24:52,080 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:24:52,080 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:24:52,080 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:24:52,080 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:24:52,080 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:24:52,080 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:24:52,081 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:24:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-24 17:24:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:24:52,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:52,107 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:52,107 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-01-24 17:24:52,113 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:52,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:52,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:52,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:52,161 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:52,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:52,338 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 17:24:52,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:52,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:24:52,341 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:52,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:24:52,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:24:52,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:24:52,443 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-24 17:24:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:52,665 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2018-01-24 17:24:52,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:24:52,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-24 17:24:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:52,679 INFO L225 Difference]: With dead ends: 193 [2018-01-24 17:24:52,679 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 17:24:52,684 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 17:24:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 17:24:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-01-24 17:24:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 17:24:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-24 17:24:52,731 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-01-24 17:24:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:52,732 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-24 17:24:52,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:24:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-24 17:24:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:24:52,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:52,735 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:52,735 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-01-24 17:24:52,735 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:52,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:52,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:52,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:52,738 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:52,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:52,843 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 17:24:52,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:52,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:24:52,844 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:52,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:24:52,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:24:52,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:24:52,846 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-01-24 17:24:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:52,875 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2018-01-24 17:24:52,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:24:52,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 17:24:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:52,877 INFO L225 Difference]: With dead ends: 150 [2018-01-24 17:24:52,877 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 17:24:52,878 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 17:24:52,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 17:24:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-01-24 17:24:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 17:24:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-01-24 17:24:52,885 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-01-24 17:24:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:52,885 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-01-24 17:24:52,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:24:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-01-24 17:24:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:24:52,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:52,886 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:52,886 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:52,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-01-24 17:24:52,887 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:52,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:52,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:52,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:52,888 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:52,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:52,952 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 17:24:52,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:52,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:24:52,953 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:52,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:24:52,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:24:52,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:24:52,954 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-01-24 17:24:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:53,023 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-24 17:24:53,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:24:53,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 17:24:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:53,025 INFO L225 Difference]: With dead ends: 85 [2018-01-24 17:24:53,025 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 17:24:53,025 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 17:24:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 17:24:53,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-24 17:24:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 17:24:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-24 17:24:53,032 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-01-24 17:24:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:53,032 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-24 17:24:53,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:24:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-24 17:24:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:24:53,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:53,033 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:53,033 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-01-24 17:24:53,033 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:53,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:53,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:53,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:53,035 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:53,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:53,102 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 17:24:53,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:53,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:24:53,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:53,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:24:53,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:24:53,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:24:53,104 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-01-24 17:24:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:53,214 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-01-24 17:24:53,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:24:53,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 17:24:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:53,216 INFO L225 Difference]: With dead ends: 81 [2018-01-24 17:24:53,217 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 17:24:53,217 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 17:24:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 17:24:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 17:24:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 17:24:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-24 17:24:53,226 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-01-24 17:24:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:53,227 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-24 17:24:53,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:24:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-24 17:24:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:24:53,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:53,228 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:53,228 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-01-24 17:24:53,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:53,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:53,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:53,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:53,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:53,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:53,627 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 17:24:53,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:53,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 17:24:53,628 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:53,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:24:53,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:24:53,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:24:53,629 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-01-24 17:24:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:53,877 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-24 17:24:53,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:24:53,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-24 17:24:53,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:53,881 INFO L225 Difference]: With dead ends: 144 [2018-01-24 17:24:53,881 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 17:24:53,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:24:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 17:24:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-01-24 17:24:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 17:24:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-24 17:24:53,896 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-01-24 17:24:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:53,896 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-24 17:24:53,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:24:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-24 17:24:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:24:53,897 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:53,898 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, 1, 1, 1, 1, 1, 1] [2018-01-24 17:24:53,898 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, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:53,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-01-24 17:24:53,899 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:53,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:53,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:53,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:53,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:53,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:54,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:54,161 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:54,162 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 17:24:54,163 INFO L201 CegarAbsIntRunner]: [0], [3], [5], [9], [12], [13], [14], [16], [17], [18], [98], [100], [102], [105], [109], [114], [115], [117], [119], [133], [137], [138], [139], [141], [142], [143], [144] [2018-01-24 17:24:54,206 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:54,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:54,355 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:24:54,357 INFO L268 AbstractInterpreter]: Visited 27 different actions 32 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 17:24:54,383 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:24:54,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:54,384 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 17:24:54,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:54,391 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:54,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:54,477 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 17:24:54,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:54,492 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 17:24:54,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:54,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:54,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:24:55,015 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 17:24:55,015 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:55,397 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 125 [2018-01-24 17:24:59,044 WARN L143 SmtUtils]: Spent 443ms on a formula simplification that was a NOOP. DAG size: 66 [2018-01-24 17:24:59,066 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 125 [2018-01-24 17:25:00,237 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 125 [2018-01-24 17:25:02,401 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 16128 conjuctions. This might take some time... [2018-01-24 17:25:14,074 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 16128 conjuctions. [2018-01-24 17:25:15,315 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16128 Received shutdown request... [2018-01-24 17:26:01,088 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:26:01,088 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:26:01,093 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:26:01,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:26:01 BoogieIcfgContainer [2018-01-24 17:26:01,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:26:01,095 INFO L168 Benchmark]: Toolchain (without parser) took 69713.66 ms. Allocated memory was 303.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 262.1 MB in the beginning and 579.6 MB in the end (delta: -317.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-01-24 17:26:01,096 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:26:01,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.85 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 248.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:26:01,096 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 ms. Allocated memory is still 303.0 MB. Free memory was 248.1 MB in the beginning and 247.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 17:26:01,097 INFO L168 Benchmark]: RCFGBuilder took 345.05 ms. Allocated memory is still 303.0 MB. Free memory was 247.1 MB in the beginning and 223.6 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:26:01,097 INFO L168 Benchmark]: TraceAbstraction took 69084.31 ms. Allocated memory was 303.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 223.6 MB in the beginning and 579.6 MB in the end (delta: -356.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-01-24 17:26:01,099 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 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.85 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 248.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.11 ms. Allocated memory is still 303.0 MB. Free memory was 248.1 MB in the beginning and 247.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 345.05 ms. Allocated memory is still 303.0 MB. Free memory was 247.1 MB in the beginning and 223.6 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69084.31 ms. Allocated memory was 303.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 223.6 MB in the beginning and 579.6 MB in the end (delta: -356.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 128 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 53 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 39 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.501279 RENAME_VARIABLES(MILLISECONDS) : 0.592841 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.442444 PROJECTAWAY(MILLISECONDS) : 0.350135 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000947 DISJOIN(MILLISECONDS) : 2.375995 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.639559 ADD_EQUALITY(MILLISECONDS) : 0.054742 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010839 #CONJOIN_DISJUNCTIVE : 51 #RENAME_VARIABLES : 86 #UNFREEZE : 0 #CONJOIN : 100 #PROJECTAWAY : 86 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 83 #ADD_EQUALITY : 54 #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 1452). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 69.0s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 393 SDtfs, 104 SDslu, 1363 SDs, 0 SdLazy, 344 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 47 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 8616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-26-01-109.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-26-01-109.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-26-01-109.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-26-01-109.csv Completed graceful shutdown