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_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:28:41,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:28:41,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:28:41,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:28:41,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:28:41,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:28:41,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:28:41,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:28:41,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:28:41,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:28:41,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:28:41,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:28:41,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:28:41,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:28:41,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:28:41,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:28:41,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:28:41,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:28:41,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:28:41,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:28:41,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:28:41,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:28:41,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:28:41,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:28:41,271 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:28:41,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:28:41,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:28:41,273 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:28:41,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:28:41,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:28:41,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:28:41,276 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:28:41,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:28:41,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:28:41,298 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:28:41,298 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:28:41,298 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:28:41,298 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:28:41,299 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:28:41,299 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:28:41,299 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:28:41,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:28:41,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:28:41,304 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:28:41,305 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:28:41,305 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:28:41,305 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:28:41,305 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:28:41,305 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:28:41,306 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:28:41,306 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:28:41,306 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:28:41,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:28:41,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:28:41,307 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:28:41,307 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:28:41,307 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:28:41,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:28:41,307 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:28:41,307 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:28:41,308 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:28:41,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:28:41,308 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:28:41,308 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:28:41,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:28:41,308 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:28:41,308 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:28:41,309 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:28:41,310 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:28:41,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:28:41,356 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:28:41,360 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:28:41,362 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:28:41,363 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:28:41,363 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 03:28:41,570 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:28:41,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:28:41,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:28:41,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:28:41,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:28:41,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64253dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41, skipping insertion in model container [2018-01-25 03:28:41,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,611 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:28:41,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:28:41,775 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:28:41,794 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:28:41,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41 WrapperNode [2018-01-25 03:28:41,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:28:41,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:28:41,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:28:41,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:28:41,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (1/1) ... [2018-01-25 03:28:41,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:28:41,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:28:41,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:28:41,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:28:41,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (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:28:41,905 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:28:41,905 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:28:41,905 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:28:41,906 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-25 03:28:41,906 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:28:41,906 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:28:41,906 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:28:41,906 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:28:41,906 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:28:41,906 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:28:41,906 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:28:41,906 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:28:41,906 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:28:41,907 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:28:41,907 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:28:41,907 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-25 03:28:41,907 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:28:41,907 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:28:41,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:28:41,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:28:42,141 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:28:42,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:28:42 BoogieIcfgContainer [2018-01-25 03:28:42,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:28:42,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:28:42,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:28:42,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:28:42,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:28:41" (1/3) ... [2018-01-25 03:28:42,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a236ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:28:42, skipping insertion in model container [2018-01-25 03:28:42,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:28:41" (2/3) ... [2018-01-25 03:28:42,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a236ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:28:42, skipping insertion in model container [2018-01-25 03:28:42,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:28:42" (3/3) ... [2018-01-25 03:28:42,150 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-25 03:28:42,157 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:28:42,163 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 03:28:42,202 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:28:42,202 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:28:42,202 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:28:42,202 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:28:42,202 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:28:42,202 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:28:42,203 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:28:42,203 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:28:42,203 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:28:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-25 03:28:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:28:42,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:42,230 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:28:42,230 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 03:28:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-01-25 03:28:42,236 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:42,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:42,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:42,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:42,284 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:42,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:42,437 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:28:42,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:42,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:28:42,439 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:42,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:28:42,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:28:42,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:28:42,538 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-25 03:28:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:42,738 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2018-01-25 03:28:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:28:42,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 03:28:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:42,753 INFO L225 Difference]: With dead ends: 148 [2018-01-25 03:28:42,753 INFO L226 Difference]: Without dead ends: 96 [2018-01-25 03:28:42,756 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:28:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-25 03:28:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-01-25 03:28:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 03:28:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-25 03:28:42,796 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-01-25 03:28:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:42,797 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-25 03:28:42,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:28:42,797 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-25 03:28:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:28:42,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:42,799 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:28:42,799 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 03:28:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-01-25 03:28:42,799 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:42,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:42,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:42,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:42,802 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:42,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:42,885 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:28:42,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:42,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:28:42,885 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:42,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:28:42,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:28:42,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:28:42,888 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-01-25 03:28:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:42,920 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-01-25 03:28:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:28:42,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 03:28:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:42,922 INFO L225 Difference]: With dead ends: 116 [2018-01-25 03:28:42,922 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 03:28:42,924 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:28:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 03:28:42,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-01-25 03:28:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 03:28:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-01-25 03:28:42,933 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-01-25 03:28:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:42,933 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-01-25 03:28:42,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:28:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-01-25 03:28:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:28:42,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:42,934 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:28:42,935 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 03:28:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-01-25 03:28:42,935 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:42,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:42,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:42,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:42,937 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:42,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:43,021 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:28:43,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:43,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:28:43,021 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:43,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:28:43,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:28:43,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:28:43,023 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-01-25 03:28:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:43,192 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-25 03:28:43,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:28:43,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:28:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:43,194 INFO L225 Difference]: With dead ends: 65 [2018-01-25 03:28:43,195 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 03:28:43,195 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 03:28:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 03:28:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 03:28:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 03:28:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-25 03:28:43,204 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-01-25 03:28:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:43,204 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-25 03:28:43,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:28:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-25 03:28:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:28:43,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:43,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:28:43,205 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 03:28:43,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-01-25 03:28:43,206 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:43,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:43,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:43,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:43,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:43,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:43,279 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:28:43,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:43,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:28:43,279 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:43,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:28:43,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:28:43,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:28:43,280 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-01-25 03:28:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:43,394 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-25 03:28:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:28:43,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:28:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:43,395 INFO L225 Difference]: With dead ends: 61 [2018-01-25 03:28:43,396 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 03:28:43,396 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:28:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 03:28:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 03:28:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 03:28:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-25 03:28:43,404 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-01-25 03:28:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:43,404 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-25 03:28:43,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:28:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-25 03:28:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:28:43,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:43,406 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:28:43,406 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 03:28:43,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-01-25 03:28:43,406 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:43,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:43,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:43,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:43,408 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:43,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:43,764 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 17 DAG size of output 15 [2018-01-25 03:28:43,825 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:28:43,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:28:43,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:28:43,826 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:28:43,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:28:43,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:28:43,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:28:43,827 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-01-25 03:28:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:44,049 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-25 03:28:44,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:28:44,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 03:28:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:44,051 INFO L225 Difference]: With dead ends: 110 [2018-01-25 03:28:44,051 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 03:28:44,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:28:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 03:28:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-01-25 03:28:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 03:28:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-25 03:28:44,067 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-01-25 03:28:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:44,067 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-25 03:28:44,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:28:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-25 03:28:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:28:44,068 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:44,068 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:28:44,068 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 03:28:44,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-01-25 03:28:44,069 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:44,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:44,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:44,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:44,070 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:44,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:44,407 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:28:44,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:28:44,408 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:28:44,409 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 03:28:44,411 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 03:28:44,473 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:28:44,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:28:54,931 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:28:54,933 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:28:54,953 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:28:54,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:28:54,954 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:28:54,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:54,961 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:28:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:55,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:28:55,110 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:28:55,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:28:55,196 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:28:55,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:28:55,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:28:55,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 03:28:55,489 WARN L143 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-25 03:28:55,824 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:28:55,824 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:28:56,497 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 36 DAG size of output 27 [2018-01-25 03:28:56,511 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:28:56,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:28:56,532 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:28:56,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:56,536 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:28:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:56,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:28:56,573 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:28:56,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:28:56,591 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:28:56,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:28:56,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:28:56,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 03:28:56,696 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:28:56,697 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:28:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (3)] Exception during sending of exit command (exit): Broken pipe [2018-01-25 03:28:57,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:28:57,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-25 03:28:57,579 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:28:57,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 03:28:57,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 03:28:57,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-25 03:28:57,581 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 18 states. [2018-01-25 03:28:58,131 WARN L143 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-25 03:28:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:28:58,792 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-01-25 03:28:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:28:58,792 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-25 03:28:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:28:58,794 INFO L225 Difference]: With dead ends: 114 [2018-01-25 03:28:58,794 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 03:28:58,795 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 03:28:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 03:28:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-01-25 03:28:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 03:28:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-25 03:28:58,805 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 23 [2018-01-25 03:28:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:28:58,806 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-25 03:28:58,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 03:28:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-25 03:28:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:28:58,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:28:58,807 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 03:28:58,807 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 03:28:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-01-25 03:28:58,808 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:28:58,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:58,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:28:58,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:28:58,810 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:28:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:28:58,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:28:59,455 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 03:28:59,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:28:59,456 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:28:59,456 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:28:59,457 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:28:59,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:28:59,457 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:28:59,470 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:28:59,470 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:28:59,499 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:28:59,508 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:28:59,510 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:28:59,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:28:59,627 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:28:59,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:28:59,669 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:28:59,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:28:59,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:28:59,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 03:29:00,138 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 03:29:00,139 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:29:01,294 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 1296 Received shutdown request... [2018-01-25 03:29:43,472 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:29:43,473 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:29:43,476 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:29:43,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:29:43 BoogieIcfgContainer [2018-01-25 03:29:43,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:29:43,477 INFO L168 Benchmark]: Toolchain (without parser) took 61906.37 ms. Allocated memory was 307.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 264.5 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 03:29:43,478 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:29:43,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.28 ms. Allocated memory is still 307.2 MB. Free memory was 264.5 MB in the beginning and 251.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 03:29:43,478 INFO L168 Benchmark]: Boogie Preprocessor took 34.27 ms. Allocated memory is still 307.2 MB. Free memory was 251.5 MB in the beginning and 249.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 03:29:43,479 INFO L168 Benchmark]: RCFGBuilder took 305.14 ms. Allocated memory is still 307.2 MB. Free memory was 249.5 MB in the beginning and 229.9 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:29:43,479 INFO L168 Benchmark]: TraceAbstraction took 61334.07 ms. Allocated memory was 307.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 228.9 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 03:29:43,481 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.19 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.28 ms. Allocated memory is still 307.2 MB. Free memory was 264.5 MB in the beginning and 251.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 34.27 ms. Allocated memory is still 307.2 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 305.14 ms. Allocated memory is still 307.2 MB. Free memory was 249.5 MB in the beginning and 229.9 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61334.07 ms. Allocated memory was 307.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 228.9 MB in the beginning and 1.5 GB in the end (delta: -1.2 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.691318 RENAME_VARIABLES(MILLISECONDS) : 2.773829 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.634188 PROJECTAWAY(MILLISECONDS) : 1.931222 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.070477 DISJOIN(MILLISECONDS) : 1.844148 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.894521 ADD_EQUALITY(MILLISECONDS) : 0.041158 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008876 #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, 61.2s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 2.0s 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.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 3.4s 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, 10.5s 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, 3.5s 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_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-29-43-490.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_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-29-43-490.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_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-29-43-490.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_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-29-43-490.csv Completed graceful shutdown