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_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:25:39,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:25:39,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:25:39,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:25:39,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:25:39,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:25:39,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:25:39,362 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:25:39,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:25:39,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:25:39,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:25:39,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:25:39,368 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:25:39,369 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:25:39,370 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:25:39,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:25:39,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:25:39,389 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:25:39,390 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:25:39,391 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:25:39,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:25:39,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:25:39,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:25:39,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:25:39,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:25:39,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:25:39,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:25:39,403 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:25:39,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:25:39,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:25:39,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:25:39,407 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_preciseopt.epf [2018-01-25 03:25:39,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:25:39,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:25:39,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:25:39,425 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:25:39,425 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:25:39,425 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:25:39,426 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:25:39,426 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:25:39,427 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:25:39,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:25:39,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:25:39,428 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:25:39,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:25:39,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:25:39,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:25:39,429 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:25:39,429 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:25:39,429 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:25:39,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:25:39,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:25:39,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:25:39,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:25:39,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:25:39,430 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:25:39,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:25:39,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:25:39,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:25:39,431 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:25:39,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:25:39,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:25:39,431 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:25:39,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:25:39,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:25:39,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:25:39,432 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:25:39,433 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:25:39,433 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:25:39,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:25:39,484 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:25:39,491 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:25:39,493 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:25:39,494 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:25:39,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-25 03:25:39,766 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:25:39,772 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:25:39,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:25:39,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:25:39,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:25:39,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:25:39" (1/1) ... [2018-01-25 03:25:39,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7617fe7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:39, skipping insertion in model container [2018-01-25 03:25:39,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:25:39" (1/1) ... [2018-01-25 03:25:39,803 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:25:39,883 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:25:40,046 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:25:40,072 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:25:40,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40 WrapperNode [2018-01-25 03:25:40,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:25:40,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:25:40,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:25:40,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:25:40,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (1/1) ... [2018-01-25 03:25:40,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (1/1) ... [2018-01-25 03:25:40,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (1/1) ... [2018-01-25 03:25:40,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (1/1) ... [2018-01-25 03:25:40,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (1/1) ... [2018-01-25 03:25:40,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (1/1) ... [2018-01-25 03:25:40,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (1/1) ... [2018-01-25 03:25:40,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:25:40,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:25:40,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:25:40,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:25:40,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (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 03:25:40,196 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:25:40,197 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:25:40,197 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:25:40,197 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-25 03:25:40,197 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-25 03:25:40,197 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:25:40,197 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:25:40,198 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:25:40,198 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:25:40,198 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:25:40,198 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:25:40,198 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:25:40,198 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:25:40,199 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:25:40,199 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:25:40,199 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:25:40,199 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-25 03:25:40,199 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-25 03:25:40,199 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:25:40,200 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:25:40,200 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:25:40,200 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:25:40,511 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:25:40,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:25:40 BoogieIcfgContainer [2018-01-25 03:25:40,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:25:40,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:25:40,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:25:40,515 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:25:40,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:25:39" (1/3) ... [2018-01-25 03:25:40,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aac979c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:25:40, skipping insertion in model container [2018-01-25 03:25:40,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:25:40" (2/3) ... [2018-01-25 03:25:40,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aac979c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:25:40, skipping insertion in model container [2018-01-25 03:25:40,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:25:40" (3/3) ... [2018-01-25 03:25:40,520 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-25 03:25:40,528 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:25:40,536 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 03:25:40,579 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:25:40,579 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:25:40,579 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:25:40,579 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:25:40,579 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:25:40,580 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:25:40,580 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:25:40,580 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:25:40,581 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:25:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-25 03:25:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:25:40,609 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:25:40,610 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 03:25:40,610 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:25:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-01-25 03:25:40,619 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:25:40,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:40,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:25:40,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:40,677 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:25:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:25:40,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:25:40,860 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 03:25:40,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:25:40,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:25:40,863 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:25:40,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:25:40,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:25:40,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:25:40,887 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-01-25 03:25:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:25:41,340 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-25 03:25:41,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:25:41,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 03:25:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:25:41,355 INFO L225 Difference]: With dead ends: 178 [2018-01-25 03:25:41,356 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 03:25:41,360 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 03:25:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 03:25:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-01-25 03:25:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 03:25:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-01-25 03:25:41,414 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-01-25 03:25:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:25:41,414 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-01-25 03:25:41,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:25:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-01-25 03:25:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:25:41,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:25:41,418 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 03:25:41,418 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:25:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-01-25 03:25:41,419 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:25:41,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:41,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:25:41,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:41,423 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:25:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:25:41,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:25:41,546 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 03:25:41,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:25:41,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:25:41,546 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:25:41,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:25:41,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:25:41,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:25:41,549 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-01-25 03:25:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:25:41,623 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-01-25 03:25:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:25:41,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 03:25:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:25:41,627 INFO L225 Difference]: With dead ends: 136 [2018-01-25 03:25:41,628 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 03:25:41,631 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 03:25:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 03:25:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-25 03:25:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 03:25:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-01-25 03:25:41,642 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-01-25 03:25:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:25:41,643 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-01-25 03:25:41,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:25:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-01-25 03:25:41,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:25:41,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:25:41,644 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 03:25:41,644 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:25:41,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-01-25 03:25:41,645 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:25:41,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:41,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:25:41,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:41,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:25:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:25:41,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:25:41,793 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 03:25:41,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:25:41,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:25:41,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:25:41,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:25:41,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:25:41,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:25:41,795 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-01-25 03:25:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:25:41,911 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-25 03:25:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:25:41,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:25:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:25:41,913 INFO L225 Difference]: With dead ends: 75 [2018-01-25 03:25:41,913 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 03:25:41,913 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:25:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 03:25:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-25 03:25:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 03:25:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-25 03:25:41,922 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-25 03:25:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:25:41,923 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-25 03:25:41,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:25:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-25 03:25:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:25:41,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:25:41,924 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 03:25:41,924 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:25:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-01-25 03:25:41,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:25:41,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:41,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:25:41,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:41,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:25:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:25:41,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:25:42,013 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 03:25:42,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:25:42,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:25:42,013 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:25:42,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:25:42,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:25:42,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:25:42,014 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-01-25 03:25:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:25:42,300 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-25 03:25:42,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:25:42,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:25:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:25:42,302 INFO L225 Difference]: With dead ends: 71 [2018-01-25 03:25:42,303 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 03:25:42,303 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 03:25:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 03:25:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-25 03:25:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 03:25:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 03:25:42,313 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-01-25 03:25:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:25:42,313 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 03:25:42,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:25:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 03:25:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:25:42,314 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:25:42,314 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 03:25:42,315 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:25:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-01-25 03:25:42,315 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:25:42,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:42,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:25:42,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:42,317 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:25:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:25:42,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:25:42,632 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-25 03:25:42,766 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 03:25:42,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:25:42,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:25:42,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:25:42,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:25:42,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:25:42,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:25:42,772 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-25 03:25:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:25:43,263 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-25 03:25:43,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:25:43,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 03:25:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:25:43,266 INFO L225 Difference]: With dead ends: 130 [2018-01-25 03:25:43,266 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 03:25:43,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:25:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 03:25:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-01-25 03:25:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 03:25:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-01-25 03:25:43,276 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-01-25 03:25:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:25:43,276 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-01-25 03:25:43,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:25:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-01-25 03:25:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:25:43,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:25:43,278 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 03:25:43,278 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:25:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-01-25 03:25:43,278 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:25:43,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:43,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:25:43,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:25:43,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:25:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:25:43,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:25:43,772 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-25 03:25:43,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:25:43,772 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:25:43,774 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 03:25:43,775 INFO L201 CegarAbsIntRunner]: [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [103], [104], [106], [108], [119], [123], [124], [125], [127], [128] [2018-01-25 03:25:43,825 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:25:43,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:25:59,315 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:25:59,316 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 03:25:59,336 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:25:59,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:25:59,336 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 03:25:59,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:25:59,345 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:25:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:25:59,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:25:59,497 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 03:25:59,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:25:59,528 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 03:25:59,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:25:59,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:25:59,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 03:25:59,786 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 03:25:59,787 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:26:00,169 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-25 03:26:00,646 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 03:26:00,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:26:00,667 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 03:26:00,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:00,899 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:26:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:00,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:26:00,944 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 03:26:00,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:26:00,958 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 03:26:00,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:26:01,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:26:01,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 03:26:01,043 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 03:26:01,043 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:26:01,862 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 03:26:03,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:26:03,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 32 [2018-01-25 03:26:03,220 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:26:03,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 03:26:03,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 03:26:03,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 03:26:03,221 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-01-25 03:26:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:03,807 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2018-01-25 03:26:03,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:26:03,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-01-25 03:26:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:03,809 INFO L225 Difference]: With dead ends: 135 [2018-01-25 03:26:03,809 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 03:26:03,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2018-01-25 03:26:03,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 03:26:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-25 03:26:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 03:26:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-25 03:26:03,816 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-01-25 03:26:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:03,817 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-25 03:26:03,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 03:26:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-25 03:26:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 03:26:03,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:03,818 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-25 03:26:03,819 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:26:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-01-25 03:26:03,819 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:03,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:03,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:03,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:03,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:03,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 03:26:03,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:03,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:26:03,912 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:03,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:26:03,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:26:03,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:26:03,913 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-25 03:26:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:04,057 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-01-25 03:26:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:26:04,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-25 03:26:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:04,059 INFO L225 Difference]: With dead ends: 104 [2018-01-25 03:26:04,059 INFO L226 Difference]: Without dead ends: 103 [2018-01-25 03:26:04,060 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:26:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-25 03:26:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-01-25 03:26:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-25 03:26:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-25 03:26:04,070 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-01-25 03:26:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:04,071 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-25 03:26:04,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:26:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-25 03:26:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 03:26:04,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:04,072 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-25 03:26:04,073 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:26:04,073 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-01-25 03:26:04,073 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:04,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:04,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:04,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:04,075 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:04,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:26:04,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:26:04,157 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:26:04,157 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 03:26:04,157 INFO L201 CegarAbsIntRunner]: [3], [7], [10], [28], [32], [37], [40], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [123], [124], [125], [127], [128], [129] [2018-01-25 03:26:04,158 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:26:04,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:26:19,019 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:26:19,020 INFO L268 AbstractInterpreter]: Visited 29 different actions 42 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 03:26:19,021 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:26:19,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:26:19,021 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 03:26:19,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:19,028 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:26:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:19,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:26:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:26:19,107 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:26:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:26:19,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:26:19,172 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 03:26:19,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:19,175 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:26:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:19,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:26:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 03:26:19,276 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:26:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 03:26:19,306 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-25 03:26:19,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 18 [2018-01-25 03:26:19,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:19,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:26:19,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:26:19,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:26:19,308 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2018-01-25 03:26:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:19,370 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-01-25 03:26:19,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:26:19,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-25 03:26:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:19,374 INFO L225 Difference]: With dead ends: 137 [2018-01-25 03:26:19,374 INFO L226 Difference]: Without dead ends: 101 [2018-01-25 03:26:19,374 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-01-25 03:26:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-25 03:26:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-01-25 03:26:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-25 03:26:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-01-25 03:26:19,389 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 38 [2018-01-25 03:26:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:19,389 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-01-25 03:26:19,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:26:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-01-25 03:26:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 03:26:19,391 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:19,391 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-25 03:26:19,391 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:26:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash -435840666, now seen corresponding path program 1 times [2018-01-25 03:26:19,392 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:19,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:19,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:19,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:19,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:19,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-25 03:26:19,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:26:19,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:26:19,480 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:26:19,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:26:19,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:26:19,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:26:19,481 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2018-01-25 03:26:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:26:19,502 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-01-25 03:26:19,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:26:19,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-25 03:26:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:26:19,506 INFO L225 Difference]: With dead ends: 168 [2018-01-25 03:26:19,506 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 03:26:19,506 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 03:26:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 03:26:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2018-01-25 03:26:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 03:26:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-25 03:26:19,516 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 42 [2018-01-25 03:26:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:26:19,516 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-25 03:26:19,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:26:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-25 03:26:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 03:26:19,518 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:26:19,518 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:26:19,518 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 03:26:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash 946633512, now seen corresponding path program 1 times [2018-01-25 03:26:19,518 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:26:19,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:19,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:19,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:26:19,520 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:26:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:19,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:26:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 03:26:19,598 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:26:19,598 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:26:19,598 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-25 03:26:19,598 INFO L201 CegarAbsIntRunner]: [3], [7], [12], [14], [19], [21], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [121], [122], [123], [124], [125], [127], [128], [129] [2018-01-25 03:26:19,600 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:26:19,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 03:26:32,155 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 03:26:32,156 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 03:26:32,156 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:26:32,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:26:32,156 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 03:26:32,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:26:32,162 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:26:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:26:32,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:26:32,183 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:26:32,183 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:26:32,186 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:26:32,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:26:32 BoogieIcfgContainer [2018-01-25 03:26:32,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:26:32,188 INFO L168 Benchmark]: Toolchain (without parser) took 52421.50 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 265.0 MB in the beginning and 1.0 GB in the end (delta: -754.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-25 03:26:32,188 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 308.3 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:26:32,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.64 ms. Allocated memory is still 308.3 MB. Free memory was 265.0 MB in the beginning and 251.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:26:32,189 INFO L168 Benchmark]: Boogie Preprocessor took 44.50 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 250.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 03:26:32,189 INFO L168 Benchmark]: RCFGBuilder took 377.81 ms. Allocated memory is still 308.3 MB. Free memory was 250.1 MB in the beginning and 227.8 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:26:32,189 INFO L168 Benchmark]: TraceAbstraction took 51674.13 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 227.8 MB in the beginning and 1.0 GB in the end (delta: -791.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-25 03:26:32,191 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.20 ms. Allocated memory is still 308.3 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 312.64 ms. Allocated memory is still 308.3 MB. Free memory was 265.0 MB in the beginning and 251.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 44.50 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 250.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 377.81 ms. Allocated memory is still 308.3 MB. Free memory was 250.1 MB in the beginning and 227.8 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51674.13 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 227.8 MB in the beginning and 1.0 GB in the end (delta: -791.2 MB). Peak memory consumption was 1.2 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) : 2.400922 RENAME_VARIABLES(MILLISECONDS) : 1.362790 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.330053 PROJECTAWAY(MILLISECONDS) : 3.322192 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.091330 DISJOIN(MILLISECONDS) : 2.159134 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.489556 ADD_EQUALITY(MILLISECONDS) : 0.031954 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009647 #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 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 241 LocStat_NO_SUPPORTING_DISEQUALITIES : 21 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.413629 RENAME_VARIABLES(MILLISECONDS) : 0.072345 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.169910 PROJECTAWAY(MILLISECONDS) : 0.031531 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.062424 DISJOIN(MILLISECONDS) : 0.195447 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.091987 ADD_EQUALITY(MILLISECONDS) : 0.017643 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005740 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 105 #UNFREEZE : 0 #CONJOIN : 113 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 102 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 51.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 625 SDtfs, 230 SDslu, 2251 SDs, 0 SdLazy, 696 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 217 SyntacticMatches, 8 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 42.9s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 92 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 459 ConstructedInterpolants, 10 QuantifiedInterpolants, 72501 SizeOfPredicates, 14 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 78/145 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_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-26-32-199.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-26-32-199.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-26-32-199.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_03-26-32-199.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_03-26-32-199.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-26-32-199.csv Completed graceful shutdown