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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:30:41,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:30:41,345 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:30:41,361 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:30:41,361 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:30:41,362 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:30:41,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:30:41,364 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:30:41,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:30:41,367 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:30:41,368 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:30:41,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:30:41,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:30:41,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:30:41,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:30:41,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:30:41,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:30:41,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:30:41,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:30:41,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:30:41,383 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:30:41,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:30:41,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:30:41,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:30:41,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:30:41,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:30:41,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:30:41,388 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:30:41,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:30:41,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:30:41,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:30:41,389 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:30:41,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:30:41,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:30:41,399 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:30:41,400 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:30:41,400 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:30:41,400 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:30:41,400 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:30:41,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:30:41,401 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:30:41,401 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:30:41,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:30:41,401 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:30:41,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:30:41,402 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:30:41,402 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:30:41,402 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:30:41,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:30:41,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:30:41,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:30:41,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:30:41,403 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:30:41,403 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:30:41,404 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:30:41,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:30:41,404 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:30:41,404 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:30:41,404 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:30:41,405 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:30:41,405 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:30:41,405 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:30:41,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:30:41,405 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:30:41,406 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:30:41,406 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:30:41,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:30:41,451 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:30:41,454 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:30:41,456 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:30:41,456 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:30:41,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-24 13:30:41,663 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:30:41,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:30:41,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:30:41,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:30:41,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:30:41,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:30:41" (1/1) ... [2018-01-24 13:30:41,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2871eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:41, skipping insertion in model container [2018-01-24 13:30:41,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:30:41" (1/1) ... [2018-01-24 13:30:41,703 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:30:41,784 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:30:41,976 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:30:42,006 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:30:42,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42 WrapperNode [2018-01-24 13:30:42,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:30:42,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:30:42,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:30:42,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:30:42,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (1/1) ... [2018-01-24 13:30:42,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (1/1) ... [2018-01-24 13:30:42,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (1/1) ... [2018-01-24 13:30:42,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (1/1) ... [2018-01-24 13:30:42,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (1/1) ... [2018-01-24 13:30:42,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (1/1) ... [2018-01-24 13:30:42,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (1/1) ... [2018-01-24 13:30:42,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:30:42,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:30:42,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:30:42,064 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:30:42,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:30:42,122 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:30:42,122 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:30:42,122 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 13:30:42,122 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 13:30:42,122 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 13:30:42,123 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 13:30:42,123 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:30:42,123 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:30:42,123 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:30:42,123 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:30:42,123 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:30:42,124 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:30:42,124 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:30:42,124 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:30:42,124 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:30:42,124 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 13:30:42,124 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 13:30:42,125 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 13:30:42,125 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 13:30:42,125 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:30:42,125 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:30:42,125 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:30:42,389 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:30:42,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:30:42 BoogieIcfgContainer [2018-01-24 13:30:42,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:30:42,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:30:42,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:30:42,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:30:42,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:30:41" (1/3) ... [2018-01-24 13:30:42,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b5800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:30:42, skipping insertion in model container [2018-01-24 13:30:42,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:30:42" (2/3) ... [2018-01-24 13:30:42,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b5800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:30:42, skipping insertion in model container [2018-01-24 13:30:42,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:30:42" (3/3) ... [2018-01-24 13:30:42,396 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-24 13:30:42,403 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:30:42,410 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 13:30:42,460 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:30:42,461 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:30:42,461 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:30:42,461 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:30:42,461 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:30:42,461 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:30:42,462 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:30:42,462 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:30:42,463 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:30:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 13:30:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:30:42,487 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:30:42,488 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:30:42,488 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:30:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-01-24 13:30:42,493 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:30:42,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:42,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:42,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:42,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:30:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:42,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:30:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:42,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:30:42,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:30:42,801 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:30:42,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:30:42,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:30:42,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:30:42,881 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-01-24 13:30:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:30:42,942 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2018-01-24 13:30:42,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:30:42,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:30:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:30:42,952 INFO L225 Difference]: With dead ends: 148 [2018-01-24 13:30:42,952 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 13:30:42,955 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:30:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 13:30:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-01-24 13:30:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 13:30:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-01-24 13:30:42,998 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-01-24 13:30:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:30:42,999 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-01-24 13:30:42,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:30:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-01-24 13:30:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:30:43,000 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:30:43,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:30:43,001 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:30:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-01-24 13:30:43,001 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:30:43,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:43,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:43,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:43,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:30:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:43,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:30:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:43,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:30:43,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:30:43,061 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:30:43,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:30:43,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:30:43,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:30:43,063 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-01-24 13:30:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:30:43,174 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-24 13:30:43,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:30:43,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 13:30:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:30:43,177 INFO L225 Difference]: With dead ends: 113 [2018-01-24 13:30:43,177 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 13:30:43,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:30:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 13:30:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-01-24 13:30:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 13:30:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 13:30:43,190 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-01-24 13:30:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:30:43,191 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 13:30:43,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:30:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 13:30:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:30:43,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:30:43,192 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-24 13:30:43,192 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:30:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-01-24 13:30:43,193 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:30:43,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:43,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:43,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:43,195 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:30:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:43,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:30:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:43,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:30:43,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:30:43,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:30:43,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:30:43,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:30:43,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:30:43,265 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-01-24 13:30:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:30:43,411 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-01-24 13:30:43,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:30:43,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:30:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:30:43,413 INFO L225 Difference]: With dead ends: 77 [2018-01-24 13:30:43,413 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 13:30:43,413 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:30:43,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 13:30:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-01-24 13:30:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 13:30:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-24 13:30:43,423 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-01-24 13:30:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:30:43,423 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-24 13:30:43,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:30:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-24 13:30:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:30:43,425 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:30:43,425 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-24 13:30:43,425 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:30:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-01-24 13:30:43,426 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:30:43,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:43,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:43,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:43,428 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:30:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:43,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:30:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:43,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:30:43,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:30:43,758 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:30:43,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:30:43,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:30:43,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:30:43,758 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-01-24 13:30:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:30:44,002 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-24 13:30:44,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:30:44,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 13:30:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:30:44,004 INFO L225 Difference]: With dead ends: 140 [2018-01-24 13:30:44,004 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 13:30:44,005 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:30:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 13:30:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-24 13:30:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 13:30:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-01-24 13:30:44,012 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-01-24 13:30:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:30:44,012 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-01-24 13:30:44,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:30:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-01-24 13:30:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:30:44,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:30:44,013 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-24 13:30:44,014 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:30:44,014 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-01-24 13:30:44,014 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:30:44,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:44,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:44,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:44,016 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:30:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:44,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:30:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:44,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:30:44,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:30:44,093 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:30:44,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:30:44,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:30:44,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:30:44,094 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-01-24 13:30:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:30:44,164 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-24 13:30:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:30:44,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:30:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:30:44,168 INFO L225 Difference]: With dead ends: 81 [2018-01-24 13:30:44,168 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 13:30:44,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:30:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 13:30:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 13:30:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 13:30:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-24 13:30:44,196 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-01-24 13:30:44,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:30:44,197 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-24 13:30:44,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:30:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-24 13:30:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:30:44,198 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:30:44,198 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-24 13:30:44,198 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:30:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-01-24 13:30:44,198 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:30:44,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:44,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:44,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:44,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:30:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:44,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:30:44,541 WARN L143 SmtUtils]: Spent 168ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-24 13:30:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:44,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:30:44,708 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:30:44,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:44,718 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:30:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:44,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:30:44,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:30:44,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:30:44,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:30:44,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:30:44,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:30:44,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:30:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:45,156 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:30:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:45,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:30:45,963 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-24 13:30:45,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:45,991 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:30:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:46,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:30:46,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:30:46,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:30:46,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:30:46,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:30:46,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:30:46,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:30:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:46,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:30:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:46,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:30:46,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-24 13:30:46,670 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:30:46,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 13:30:46,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 13:30:46,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-24 13:30:46,671 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 18 states. [2018-01-24 13:30:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:30:47,034 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-24 13:30:47,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:30:47,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-24 13:30:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:30:47,036 INFO L225 Difference]: With dead ends: 142 [2018-01-24 13:30:47,036 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 13:30:47,038 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 13:30:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 13:30:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-01-24 13:30:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 13:30:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-24 13:30:47,046 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-01-24 13:30:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:30:47,047 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-24 13:30:47,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 13:30:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-24 13:30:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:30:47,047 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:30:47,048 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-24 13:30:47,048 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:30:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-01-24 13:30:47,048 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:30:47,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:47,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:30:47,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:30:47,050 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:30:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:30:47,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:30:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:30:47,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:30:47,317 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-24 13:30:47,322 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:30:47,322 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:30:47,331 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:30:47,335 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:30:47,336 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:30:47,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:30:47,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 13:30:47,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:30:47,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 13:30:47,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:30:47,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:30:47,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 13:30:47,567 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-24 13:30:47,567 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:30:48,341 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-01-24 13:30:51,427 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 570635 conjuctions. This might take some time... Received shutdown request... [2018-01-24 13:31:49,353 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:31:49,353 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:31:49,358 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:31:49,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:31:49 BoogieIcfgContainer [2018-01-24 13:31:49,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:31:49,359 INFO L168 Benchmark]: Toolchain (without parser) took 67695.58 ms. Allocated memory was 296.7 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 255.8 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-01-24 13:31:49,360 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 296.7 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:31:49,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.00 ms. Allocated memory is still 296.7 MB. Free memory was 255.8 MB in the beginning and 242.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:31:49,360 INFO L168 Benchmark]: Boogie Preprocessor took 45.30 ms. Allocated memory is still 296.7 MB. Free memory was 242.7 MB in the beginning and 240.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:31:49,360 INFO L168 Benchmark]: RCFGBuilder took 326.05 ms. Allocated memory is still 296.7 MB. Free memory was 240.7 MB in the beginning and 217.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. [2018-01-24 13:31:49,361 INFO L168 Benchmark]: TraceAbstraction took 66967.99 ms. Allocated memory was 296.7 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 217.9 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-01-24 13:31:49,363 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.22 ms. Allocated memory is still 296.7 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 347.00 ms. Allocated memory is still 296.7 MB. Free memory was 255.8 MB in the beginning and 242.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.30 ms. Allocated memory is still 296.7 MB. Free memory was 242.7 MB in the beginning and 240.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 326.05 ms. Allocated memory is still 296.7 MB. Free memory was 240.7 MB in the beginning and 217.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66967.99 ms. Allocated memory was 296.7 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 217.9 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. * 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). 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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 570635 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 66.9s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 432 SDtfs, 142 SDslu, 1566 SDs, 0 SdLazy, 507 SolverSat, 20 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.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 196 ConstructedInterpolants, 28 QuantifiedInterpolants, 56312 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_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-31-49-370.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-31-49-370.csv Completed graceful shutdown