java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:24:46,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:24:46,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:24:46,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:24:46,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:24:46,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:24:46,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:24:46,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:24:46,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:24:46,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:24:46,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:24:46,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:24:46,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:24:46,458 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:24:46,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:24:46,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:24:46,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:24:46,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:24:46,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:24:46,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:24:46,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:24:46,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:24:46,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:24:46,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:24:46,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:24:46,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:24:46,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:24:46,476 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:24:46,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:24:46,477 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:24:46,478 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:24:46,478 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:24:46,489 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:24:46,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:24:46,490 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:24:46,490 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:24:46,490 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:24:46,491 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:24:46,491 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:24:46,491 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:24:46,492 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:24:46,492 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:24:46,492 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:24:46,492 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:24:46,492 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:24:46,493 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:24:46,493 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:24:46,493 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:24:46,493 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:24:46,493 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:24:46,494 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:24:46,494 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:24:46,494 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:24:46,494 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:24:46,494 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:24:46,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:24:46,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:24:46,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:24:46,495 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:24:46,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:24:46,496 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:24:46,496 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:24:46,496 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:24:46,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:24:46,496 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:24:46,497 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:24:46,498 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:24:46,498 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:24:46,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:24:46,550 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:24:46,554 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:24:46,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:24:46,556 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:24:46,557 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 17:24:46,749 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:24:46,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:24:46,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:24:46,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:24:46,766 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:24:46,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:46,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7424c019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46, skipping insertion in model container [2018-01-24 17:24:46,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:46,792 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:24:46,845 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:24:46,968 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:24:46,987 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:24:46,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46 WrapperNode [2018-01-24 17:24:46,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:24:46,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:24:46,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:24:46,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:24:47,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:47,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:47,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:47,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:47,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:47,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:47,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (1/1) ... [2018-01-24 17:24:47,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:24:47,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:24:47,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:24:47,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:24:47,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:24:47,082 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:24:47,082 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:24:47,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:24:47,083 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 17:24:47,083 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 17:24:47,083 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:24:47,083 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:24:47,083 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:24:47,083 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:24:47,083 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:24:47,083 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:24:47,083 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:24:47,084 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:24:47,374 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:24:47,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:24:47 BoogieIcfgContainer [2018-01-24 17:24:47,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:24:47,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:24:47,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:24:47,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:24:47,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:24:46" (1/3) ... [2018-01-24 17:24:47,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aac979c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:24:47, skipping insertion in model container [2018-01-24 17:24:47,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:24:46" (2/3) ... [2018-01-24 17:24:47,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aac979c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:24:47, skipping insertion in model container [2018-01-24 17:24:47,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:24:47" (3/3) ... [2018-01-24 17:24:47,382 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-24 17:24:47,392 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:24:47,400 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 17:24:47,444 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:24:47,444 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:24:47,444 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:24:47,445 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:24:47,445 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:24:47,445 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:24:47,445 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:24:47,445 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:24:47,446 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:24:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 17:24:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:24:47,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:47,471 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 17:24:47,471 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:47,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-01-24 17:24:47,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:47,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:47,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:47,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:47,526 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:47,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:47,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:47,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:24:47,772 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:47,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:24:47,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:24:47,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:24:47,880 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-01-24 17:24:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:47,964 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2018-01-24 17:24:47,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:24:47,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 17:24:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:47,980 INFO L225 Difference]: With dead ends: 148 [2018-01-24 17:24:47,980 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 17:24:47,984 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:24:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 17:24:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-01-24 17:24:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 17:24:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-01-24 17:24:48,038 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-01-24 17:24:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:48,039 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-01-24 17:24:48,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:24:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-01-24 17:24:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:24:48,041 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:48,041 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 17:24:48,041 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:48,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-01-24 17:24:48,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:48,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:48,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:48,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:48,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:48,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:48,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:48,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:24:48,097 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:48,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:24:48,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:24:48,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:24:48,100 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-01-24 17:24:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:48,213 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-24 17:24:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:24:48,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 17:24:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:48,215 INFO L225 Difference]: With dead ends: 113 [2018-01-24 17:24:48,215 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 17:24:48,216 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:24:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 17:24:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-01-24 17:24:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 17:24:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 17:24:48,224 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-01-24 17:24:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:48,224 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 17:24:48,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:24:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 17:24:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:24:48,225 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:48,225 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 17:24:48,225 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-01-24 17:24:48,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:48,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:48,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:48,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:48,228 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:48,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:48,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:48,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:24:48,312 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:48,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:24:48,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:24:48,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:24:48,313 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-01-24 17:24:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:48,449 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-01-24 17:24:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:24:48,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:24:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:48,450 INFO L225 Difference]: With dead ends: 77 [2018-01-24 17:24:48,450 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 17:24:48,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:24:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 17:24:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-01-24 17:24:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 17:24:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-24 17:24:48,458 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-01-24 17:24:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:48,458 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-24 17:24:48,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:24:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-24 17:24:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:24:48,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:48,459 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 17:24:48,459 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:48,460 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-01-24 17:24:48,460 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:48,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:48,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:48,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:48,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:48,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:48,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:48,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:24:48,871 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:48,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:24:48,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:24:48,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:24:48,872 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-01-24 17:24:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:49,114 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-24 17:24:49,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:24:49,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 17:24:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:49,116 INFO L225 Difference]: With dead ends: 140 [2018-01-24 17:24:49,116 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 17:24:49,117 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-24 17:24:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 17:24:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-24 17:24:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 17:24:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-01-24 17:24:49,125 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-01-24 17:24:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:49,125 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-01-24 17:24:49,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:24:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-01-24 17:24:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:24:49,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:49,126 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 17:24:49,126 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-01-24 17:24:49,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:49,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:49,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:49,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:49,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:49,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:49,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:24:49,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:24:49,187 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:24:49,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:24:49,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:24:49,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:24:49,194 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-01-24 17:24:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:49,232 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-24 17:24:49,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:24:49,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:24:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:49,234 INFO L225 Difference]: With dead ends: 81 [2018-01-24 17:24:49,234 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 17:24:49,235 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:24:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 17:24:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 17:24:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 17:24:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-24 17:24:49,244 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-01-24 17:24:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:49,245 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-24 17:24:49,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:24:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-24 17:24:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:24:49,246 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:49,246 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 17:24:49,246 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 17:24:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-01-24 17:24:49,247 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:49,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:49,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:49,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:49,249 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:49,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:49,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:49,525 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:49,526 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 17:24:49,528 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [92], [94], [97], [101], [106], [107], [109], [111], [125], [129], [130], [131], [133], [134] [2018-01-24 17:24:49,586 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:24:49,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:24:49,727 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:24:49,728 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-24 17:24:49,746 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:24:49,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:49,747 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:24:49,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:49,757 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:49,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:49,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 17:24:49,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:49,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:24:49,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:49,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:49,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:24:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:50,278 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:50,848 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 52 DAG size of output 27 [2018-01-24 17:24:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:50,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:50,886 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 17:24:50,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:50,890 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:24:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:50,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:50,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:24:50,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:50,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 17:24:50,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:50,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:50,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:24:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:51,038 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:51,409 WARN L143 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-24 17:24:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:24:51,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:24:51,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-24 17:24:51,747 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:24:51,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 17:24:51,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 17:24:51,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-24 17:24:51,748 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 18 states. [2018-01-24 17:24:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:24:52,217 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-24 17:24:52,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:24:52,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-24 17:24:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:24:52,219 INFO L225 Difference]: With dead ends: 142 [2018-01-24 17:24:52,219 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 17:24:52,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 17:24:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 17:24:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-01-24 17:24:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 17:24:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-24 17:24:52,229 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-01-24 17:24:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:24:52,230 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-24 17:24:52,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 17:24:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-24 17:24:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:24:52,231 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:24:52,231 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 17:24:52,231 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 17:24:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-01-24 17:24:52,231 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:24:52,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:52,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:24:52,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:24:52,233 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:24:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:24:52,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:24:52,775 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 17:24:52,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:52,775 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:24:52,775 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:24:52,775 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:24:52,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:24:52,776 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 17:24:52,781 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:24:52,781 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:24:52,793 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:24:52,797 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:24:52,798 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:24:52,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:24:52,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 17:24:52,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:52,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:24:52,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:24:52,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:24:52,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:24:53,052 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 17:24:53,052 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:24:53,519 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-01-24 17:24:56,393 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 450304 conjuctions. This might take some time... Received shutdown request... [2018-01-24 17:25:53,989 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:25:53,990 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:25:53,993 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:25:53,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:25:53 BoogieIcfgContainer [2018-01-24 17:25:53,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:25:53,995 INFO L168 Benchmark]: Toolchain (without parser) took 67244.80 ms. Allocated memory was 303.0 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 262.0 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-01-24 17:25:53,996 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:25:53,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.81 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 248.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:25:53,996 INFO L168 Benchmark]: Boogie Preprocessor took 37.77 ms. Allocated memory is still 303.0 MB. Free memory was 248.0 MB in the beginning and 247.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 17:25:53,997 INFO L168 Benchmark]: RCFGBuilder took 340.93 ms. Allocated memory is still 303.0 MB. Free memory was 247.0 MB in the beginning and 223.9 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. [2018-01-24 17:25:53,997 INFO L168 Benchmark]: TraceAbstraction took 66618.63 ms. Allocated memory was 303.0 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 223.9 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-01-24 17:25:53,999 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.21 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.81 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 248.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.77 ms. Allocated memory is still 303.0 MB. Free memory was 248.0 MB in the beginning and 247.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 340.93 ms. Allocated memory is still 303.0 MB. Free memory was 247.0 MB in the beginning and 223.9 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66618.63 ms. Allocated memory was 303.0 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 223.9 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.1 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 : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 116 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.447349 RENAME_VARIABLES(MILLISECONDS) : 0.295117 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.408277 PROJECTAWAY(MILLISECONDS) : 0.366149 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001372 DISJOIN(MILLISECONDS) : 1.631666 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.325132 ADD_EQUALITY(MILLISECONDS) : 0.053472 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020348 #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 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 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 450304 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 66.5s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.2s 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.5s 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.2s AbstIntTime, 1 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.8s 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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-25-54-009.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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-25-54-009.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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-25-54-009.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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-25-54-009.csv Completed graceful shutdown