java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:03:07,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:03:07,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:03:07,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:03:07,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:03:07,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:03:07,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:03:07,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:03:07,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:03:07,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:03:07,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:03:07,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:03:07,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:03:07,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:03:07,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:03:07,257 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:03:07,259 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:03:07,261 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:03:07,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:03:07,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:03:07,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:03:07,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:03:07,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:03:07,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:03:07,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:03:07,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:03:07,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:03:07,270 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:03:07,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:03:07,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:03:07,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:03:07,271 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-25 00:03:07,280 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:03:07,280 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:03:07,281 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:03:07,281 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:03:07,281 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:03:07,281 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:03:07,281 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:03:07,282 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:03:07,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:03:07,282 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:03:07,282 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:03:07,282 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:03:07,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:03:07,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:03:07,283 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:03:07,283 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:03:07,283 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:03:07,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:03:07,283 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:03:07,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:03:07,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:03:07,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:03:07,284 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:03:07,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:03:07,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:03:07,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:03:07,285 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:03:07,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:03:07,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:03:07,285 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:03:07,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:03:07,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:03:07,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:03:07,286 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:03:07,286 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:03:07,286 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:03:07,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:03:07,329 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:03:07,333 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:03:07,334 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:03:07,334 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:03:07,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-01-25 00:03:07,511 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:03:07,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:03:07,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:03:07,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:03:07,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:03:07,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07, skipping insertion in model container [2018-01-25 00:03:07,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,539 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:03:07,587 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:03:07,701 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:03:07,716 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:03:07,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07 WrapperNode [2018-01-25 00:03:07,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:03:07,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:03:07,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:03:07,724 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:03:07,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (1/1) ... [2018-01-25 00:03:07,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:03:07,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:03:07,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:03:07,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:03:07,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:03:07,808 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:03:07,808 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:03:07,808 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:03:07,808 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-25 00:03:07,808 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:03:07,808 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:03:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:03:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:03:07,808 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:03:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:03:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:03:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:03:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:03:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:03:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:03:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-25 00:03:07,809 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:03:07,810 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:03:07,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:03:07,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:03:08,026 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:03:08,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:03:08 BoogieIcfgContainer [2018-01-25 00:03:08,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:03:08,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:03:08,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:03:08,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:03:08,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:03:07" (1/3) ... [2018-01-25 00:03:08,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c01cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:03:08, skipping insertion in model container [2018-01-25 00:03:08,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:07" (2/3) ... [2018-01-25 00:03:08,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c01cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:03:08, skipping insertion in model container [2018-01-25 00:03:08,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:03:08" (3/3) ... [2018-01-25 00:03:08,032 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-25 00:03:08,038 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:03:08,045 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 00:03:08,087 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:03:08,087 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:03:08,087 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:03:08,088 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:03:08,088 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:03:08,088 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:03:08,088 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:03:08,088 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:03:08,089 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:03:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-25 00:03:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:03:08,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:08,115 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:03:08,115 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:08,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-01-25 00:03:08,120 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:08,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:08,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:08,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:08,167 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:08,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:08,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:08,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:03:08,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:08,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:03:08,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:03:08,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:03:08,329 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-25 00:03:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:08,565 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2018-01-25 00:03:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:03:08,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 00:03:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:08,580 INFO L225 Difference]: With dead ends: 148 [2018-01-25 00:03:08,581 INFO L226 Difference]: Without dead ends: 96 [2018-01-25 00:03:08,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:03:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-25 00:03:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-01-25 00:03:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 00:03:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-25 00:03:08,635 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-01-25 00:03:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:08,636 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-25 00:03:08,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:03:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-25 00:03:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:03:08,638 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:08,638 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:03:08,638 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-01-25 00:03:08,639 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:08,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:08,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:08,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:08,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:08,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:08,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:08,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:03:08,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:08,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:03:08,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:03:08,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:03:08,734 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-01-25 00:03:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:08,777 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-01-25 00:03:08,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:03:08,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 00:03:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:08,779 INFO L225 Difference]: With dead ends: 116 [2018-01-25 00:03:08,779 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 00:03:08,780 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:03:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 00:03:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-01-25 00:03:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 00:03:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-01-25 00:03:08,790 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-01-25 00:03:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:08,790 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-01-25 00:03:08,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:03:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-01-25 00:03:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:03:08,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:08,791 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:03:08,791 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-01-25 00:03:08,792 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:08,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:08,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:08,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:08,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:08,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:08,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:08,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:03:08,860 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:08,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:03:08,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:03:08,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:03:08,861 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-01-25 00:03:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:08,908 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-25 00:03:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:03:08,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:03:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:08,910 INFO L225 Difference]: With dead ends: 65 [2018-01-25 00:03:08,910 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 00:03:08,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:03:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 00:03:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 00:03:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 00:03:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-25 00:03:08,919 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-01-25 00:03:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:08,919 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-25 00:03:08,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:03:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-25 00:03:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:03:08,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:08,920 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:03:08,921 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-01-25 00:03:08,921 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:08,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:08,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:08,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:08,923 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:08,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:08,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:08,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:03:08,987 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:08,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:03:08,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:03:08,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:03:08,988 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-01-25 00:03:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:09,120 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-25 00:03:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:03:09,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:03:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:09,122 INFO L225 Difference]: With dead ends: 61 [2018-01-25 00:03:09,122 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 00:03:09,122 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:03:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 00:03:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 00:03:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 00:03:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-25 00:03:09,127 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-01-25 00:03:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:09,128 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-25 00:03:09,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:03:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-25 00:03:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:03:09,128 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:09,128 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:03:09,128 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-01-25 00:03:09,129 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:09,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:09,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:09,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:09,130 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:09,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:09,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:09,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:03:09,411 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:09,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:03:09,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:03:09,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:03:09,412 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-01-25 00:03:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:09,630 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-25 00:03:09,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 00:03:09,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 00:03:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:09,632 INFO L225 Difference]: With dead ends: 110 [2018-01-25 00:03:09,632 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 00:03:09,633 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:03:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 00:03:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-01-25 00:03:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 00:03:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-25 00:03:09,641 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-01-25 00:03:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:09,642 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-25 00:03:09,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:03:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-25 00:03:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 00:03:09,643 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:09,643 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:03:09,643 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-01-25 00:03:09,644 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:09,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:09,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:09,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:09,650 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:09,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:10,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:10,092 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:03:10,093 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 00:03:10,094 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [69], [71], [74], [78], [83], [84], [86], [88], [101], [105], [106], [107], [109], [110] [2018-01-25 00:03:10,135 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:03:10,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:03:19,068 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 00:03:19,070 INFO L268 AbstractInterpreter]: Visited 21 different actions 26 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-25 00:03:19,085 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 00:03:19,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:19,085 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 00:03:19,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:19,092 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:03:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:19,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:03:19,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 00:03:19,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:19,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 00:03:19,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:19,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:03:19,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:03:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:19,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:03:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:20,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:20,132 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 00:03:20,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:20,137 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:03:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:20,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:03:20,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 00:03:20,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:20,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 00:03:20,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:20,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:03:20,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:03:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:20,268 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:03:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:20,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 00:03:20,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-25 00:03:20,695 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 00:03:20,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 00:03:20,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 00:03:20,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-25 00:03:20,697 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 18 states. [2018-01-25 00:03:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:21,097 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-01-25 00:03:21,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:03:21,097 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-25 00:03:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:21,098 INFO L225 Difference]: With dead ends: 114 [2018-01-25 00:03:21,098 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 00:03:21,098 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 00:03:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 00:03:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-01-25 00:03:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 00:03:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-25 00:03:21,105 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 23 [2018-01-25 00:03:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:21,105 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-25 00:03:21,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 00:03:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-25 00:03:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 00:03:21,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:21,106 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:03:21,106 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:21,106 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-01-25 00:03:21,107 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:21,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:21,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:21,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:21,108 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:21,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:21,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:21,381 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:03:21,381 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 00:03:21,381 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 00:03:21,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:21,381 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 00:03:21,386 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 00:03:21,387 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 00:03:21,396 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 00:03:21,400 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 00:03:21,401 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 00:03:21,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:03:21,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 00:03:21,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:21,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 00:03:21,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:21,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:03:21,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:03:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:03:21,707 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:03:22,573 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 1296 Received shutdown request... [2018-01-25 00:04:11,042 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 00:04:11,042 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:04:11,045 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:04:11,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:04:11 BoogieIcfgContainer [2018-01-25 00:04:11,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:04:11,046 INFO L168 Benchmark]: Toolchain (without parser) took 63534.95 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 262.6 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 00:04:11,047 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:04:11,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.46 ms. Allocated memory is still 305.7 MB. Free memory was 262.6 MB in the beginning and 249.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:04:11,047 INFO L168 Benchmark]: Boogie Preprocessor took 35.33 ms. Allocated memory is still 305.7 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:04:11,048 INFO L168 Benchmark]: RCFGBuilder took 267.06 ms. Allocated memory is still 305.7 MB. Free memory was 247.5 MB in the beginning and 227.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:04:11,048 INFO L168 Benchmark]: TraceAbstraction took 63018.75 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 226.5 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 00:04:11,049 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.12 ms. Allocated memory is still 305.7 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.46 ms. Allocated memory is still 305.7 MB. Free memory was 262.6 MB in the beginning and 249.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.33 ms. Allocated memory is still 305.7 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 267.06 ms. Allocated memory is still 305.7 MB. Free memory was 247.5 MB in the beginning and 227.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63018.75 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 226.5 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 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 : 4 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 : 4 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.481788 RENAME_VARIABLES(MILLISECONDS) : 1.930331 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.429217 PROJECTAWAY(MILLISECONDS) : 1.870299 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.075904 DISJOIN(MILLISECONDS) : 1.446941 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.973933 ADD_EQUALITY(MILLISECONDS) : 0.028575 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008837 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 69 #UNFREEZE : 0 #CONJOIN : 82 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 66 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 1296 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 13 error locations. TIMEOUT Result, 62.9s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 343 SDtfs, 150 SDslu, 1135 SDs, 0 SdLazy, 409 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 37 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 196 ConstructedInterpolants, 28 QuantifiedInterpolants, 56510 SizeOfPredicates, 10 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 0/15 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_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-04-11-059.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_00-04-11-059.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_00-04-11-059.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-04-11-059.csv Completed graceful shutdown