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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:53:00,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:53:00,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:53:00,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:53:00,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:53:00,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:53:00,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:53:00,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:53:00,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:53:00,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:53:00,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:53:00,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:53:00,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:53:00,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:53:00,906 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:53:00,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:53:00,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:53:00,912 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:53:00,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:53:00,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:53:00,917 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:53:00,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:53:00,918 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:53:00,919 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:53:00,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:53:00,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:53:00,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:53:00,922 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:53:00,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:53:00,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:53:00,923 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:53:00,923 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.epf [2018-01-24 15:53:00,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:53:00,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:53:00,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:53:00,932 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:53:00,932 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:53:00,932 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:53:00,932 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:53:00,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:53:00,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:53:00,933 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:53:00,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:53:00,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:53:00,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:53:00,934 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:53:00,934 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:53:00,934 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:53:00,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:53:00,934 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:53:00,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:53:00,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:53:00,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:53:00,935 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:53:00,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:53:00,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:53:00,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:53:00,936 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:53:00,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:53:00,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:53:00,936 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:53:00,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:53:00,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:53:00,937 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:53:00,937 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:53:00,937 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:53:00,938 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:53:00,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:53:00,987 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:53:00,991 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:53:00,992 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:53:00,993 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:53:00,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-24 15:53:01,180 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:53:01,185 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:53:01,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:53:01,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:53:01,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:53:01,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5209c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01, skipping insertion in model container [2018-01-24 15:53:01,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,209 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:53:01,258 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:53:01,389 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:53:01,412 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:53:01,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01 WrapperNode [2018-01-24 15:53:01,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:53:01,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:53:01,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:53:01,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:53:01,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (1/1) ... [2018-01-24 15:53:01,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:53:01,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:53:01,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:53:01,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:53:01,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (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 15:53:01,510 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:53:01,510 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:53:01,510 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 15:53:01,510 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-24 15:53:01,510 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 15:53:01,510 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 15:53:01,511 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:53:01,511 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 15:53:01,512 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-24 15:53:01,512 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 15:53:01,512 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 15:53:01,512 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:53:01,512 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:53:01,512 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:53:01,806 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:53:01,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:53:01 BoogieIcfgContainer [2018-01-24 15:53:01,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:53:01,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:53:01,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:53:01,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:53:01,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:53:01" (1/3) ... [2018-01-24 15:53:01,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bbbe75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:53:01, skipping insertion in model container [2018-01-24 15:53:01,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:53:01" (2/3) ... [2018-01-24 15:53:01,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bbbe75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:53:01, skipping insertion in model container [2018-01-24 15:53:01,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:53:01" (3/3) ... [2018-01-24 15:53:01,813 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-24 15:53:01,820 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:53:01,828 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 15:53:01,884 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:53:01,884 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:53:01,884 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:53:01,884 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:53:01,884 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:53:01,885 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:53:01,885 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:53:01,885 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:53:01,886 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:53:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-24 15:53:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:53:01,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:01,909 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 15:53:01,910 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-01-24 15:53:01,916 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:01,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:01,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:01,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:01,964 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:02,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:02,098 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 15:53:02,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:53:02,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:53:02,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:02,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:53:02,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:53:02,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:53:02,125 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-01-24 15:53:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:02,395 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-24 15:53:02,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:53:02,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 15:53:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:02,408 INFO L225 Difference]: With dead ends: 178 [2018-01-24 15:53:02,409 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 15:53:02,413 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 15:53:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 15:53:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-01-24 15:53:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 15:53:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-01-24 15:53:02,461 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-01-24 15:53:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:02,461 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-01-24 15:53:02,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:53:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-01-24 15:53:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:53:02,463 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:02,463 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 15:53:02,464 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-01-24 15:53:02,464 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:02,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:02,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:02,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:02,466 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:02,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:02,577 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 15:53:02,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:53:02,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:53:02,578 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:02,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:53:02,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:53:02,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:53:02,583 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-01-24 15:53:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:02,643 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-01-24 15:53:02,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:53:02,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:53:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:02,645 INFO L225 Difference]: With dead ends: 136 [2018-01-24 15:53:02,646 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 15:53:02,647 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 15:53:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 15:53:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-24 15:53:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 15:53:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-01-24 15:53:02,658 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-01-24 15:53:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:02,658 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-01-24 15:53:02,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:53:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-01-24 15:53:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:53:02,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:02,659 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 15:53:02,659 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:02,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-01-24 15:53:02,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:02,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:02,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:02,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:02,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:02,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:02,731 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 15:53:02,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:53:02,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:53:02,731 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:02,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:53:02,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:53:02,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:53:02,732 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-01-24 15:53:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:02,792 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 15:53:02,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:53:02,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 15:53:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:02,794 INFO L225 Difference]: With dead ends: 75 [2018-01-24 15:53:02,794 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 15:53:02,794 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 15:53:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 15:53:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 15:53:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 15:53:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-24 15:53:02,804 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-24 15:53:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:02,805 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-24 15:53:02,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:53:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-24 15:53:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:53:02,806 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:02,806 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 15:53:02,806 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-01-24 15:53:02,806 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:02,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:02,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:02,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:02,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:02,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:02,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 15:53:02,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:53:02,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:53:02,870 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:02,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:53:02,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:53:02,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:53:02,871 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-01-24 15:53:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:03,009 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-24 15:53:03,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:53:03,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 15:53:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:03,011 INFO L225 Difference]: With dead ends: 71 [2018-01-24 15:53:03,011 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 15:53:03,011 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 15:53:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 15:53:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 15:53:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 15:53:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 15:53:03,020 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-01-24 15:53:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:03,021 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 15:53:03,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:53:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 15:53:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:53:03,022 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:03,022 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 15:53:03,022 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-01-24 15:53:03,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:03,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:03,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:03,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:03,024 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:03,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:03,373 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 15:53:03,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:53:03,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:53:03,374 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:03,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:53:03,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:53:03,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:53:03,375 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-24 15:53:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:03,606 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-24 15:53:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:53:03,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 15:53:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:03,608 INFO L225 Difference]: With dead ends: 130 [2018-01-24 15:53:03,608 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 15:53:03,609 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 15:53:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 15:53:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-01-24 15:53:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 15:53:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-01-24 15:53:03,617 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-01-24 15:53:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:03,617 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-01-24 15:53:03,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:53:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-01-24 15:53:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:53:03,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:03,619 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 15:53:03,619 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-01-24 15:53:03,619 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:03,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:03,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:03,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:03,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:03,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:53:03,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:03,920 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:53:03,920 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 15:53:03,922 INFO L201 CegarAbsIntRunner]: [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [103], [104], [106], [108], [119], [123], [124], [125], [127], [128] [2018-01-24 15:53:03,967 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:53:03,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:53:04,681 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:53:04,682 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 15:53:04,726 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:53:04,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:04,727 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 15:53:04,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:04,743 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:53:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:04,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:04,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 15:53:04,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:04,984 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 15:53:04,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:05,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:53:05,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 15:53:05,220 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 15:53:05,220 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:05,984 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 15:53:06,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:06,007 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 15:53:06,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:06,011 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:53:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:06,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:06,044 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 15:53:06,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:06,057 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 15:53:06,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:06,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:53:06,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 15:53:06,118 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 15:53:06,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:06,801 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 15:53:06,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:53:06,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 32 [2018-01-24 15:53:06,804 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:53:06,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 15:53:06,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 15:53:06,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 15:53:06,805 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-01-24 15:53:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:07,378 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2018-01-24 15:53:07,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 15:53:07,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-01-24 15:53:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:07,379 INFO L225 Difference]: With dead ends: 135 [2018-01-24 15:53:07,380 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 15:53:07,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2018-01-24 15:53:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 15:53:07,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-24 15:53:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 15:53:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 15:53:07,390 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-01-24 15:53:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:07,390 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 15:53:07,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 15:53:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 15:53:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 15:53:07,391 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:07,392 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:53:07,392 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:07,392 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-01-24 15:53:07,392 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:07,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:07,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:07,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:07,394 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:07,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 15:53:07,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:53:07,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:53:07,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:07,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:53:07,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:53:07,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:53:07,490 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-24 15:53:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:07,635 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-01-24 15:53:07,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:53:07,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-24 15:53:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:07,637 INFO L225 Difference]: With dead ends: 104 [2018-01-24 15:53:07,637 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 15:53:07,638 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:53:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 15:53:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-01-24 15:53:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 15:53:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-24 15:53:07,648 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-01-24 15:53:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:07,649 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-24 15:53:07,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:53:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-24 15:53:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 15:53:07,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:07,650 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:53:07,650 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:07,651 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-01-24 15:53:07,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:07,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:07,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:07,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:07,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:07,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:53:07,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:07,734 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:53:07,734 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 15:53:07,735 INFO L201 CegarAbsIntRunner]: [3], [7], [10], [28], [32], [37], [40], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [123], [124], [125], [127], [128], [129] [2018-01-24 15:53:07,736 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:53:07,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:53:08,233 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:53:08,234 INFO L268 AbstractInterpreter]: Visited 29 different actions 42 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-24 15:53:08,248 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:53:08,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:08,248 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 15:53:08,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:08,256 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:53:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:08,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:53:08,387 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:53:08,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:08,511 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:53:08,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:08,521 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:53:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:08,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 15:53:08,622 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 15:53:08,668 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-24 15:53:08,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 18 [2018-01-24 15:53:08,668 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:08,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:53:08,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:53:08,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-01-24 15:53:08,669 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2018-01-24 15:53:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:08,787 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-01-24 15:53:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:53:08,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-24 15:53:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:08,789 INFO L225 Difference]: With dead ends: 137 [2018-01-24 15:53:08,789 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 15:53:08,789 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:53:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 15:53:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-01-24 15:53:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-24 15:53:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-01-24 15:53:08,799 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 38 [2018-01-24 15:53:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:08,800 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-01-24 15:53:08,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:53:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-01-24 15:53:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 15:53:08,801 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:08,802 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:53:08,802 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash -435840666, now seen corresponding path program 1 times [2018-01-24 15:53:08,802 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:08,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:08,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:08,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:08,804 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:08,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:53:08,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:53:08,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:53:08,934 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:08,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:53:08,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:53:08,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:53:08,934 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2018-01-24 15:53:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:08,988 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-01-24 15:53:08,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:53:08,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-24 15:53:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:08,991 INFO L225 Difference]: With dead ends: 168 [2018-01-24 15:53:08,991 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 15:53:08,991 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 15:53:08,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 15:53:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2018-01-24 15:53:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 15:53:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-24 15:53:09,002 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 42 [2018-01-24 15:53:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:09,003 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-24 15:53:09,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:53:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-24 15:53:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 15:53:09,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:09,005 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:53:09,005 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 946633512, now seen corresponding path program 1 times [2018-01-24 15:53:09,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:09,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:09,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:09,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:09,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:09,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:53:09,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:09,117 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:53:09,117 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-24 15:53:09,118 INFO L201 CegarAbsIntRunner]: [3], [7], [12], [14], [19], [21], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [121], [122], [123], [124], [125], [127], [128], [129] [2018-01-24 15:53:09,119 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:53:09,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:53:09,550 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 15:53:09,550 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 15:53:09,557 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 15:53:09,892 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 79.59% of their original sizes. [2018-01-24 15:53:09,892 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 15:53:09,955 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_entry_point_~array~12.base) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_entry_point_~array~12.base) .cse3)) (.cse0 (select |c_#valid| 0))) (and (= c_entry_point_~array~12.offset .cse0) (= 0 .cse1) (forall ((v_weq0_3 Int) (v_weq1_3 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| v_weq0_3) v_weq1_3) (select (select |c_#memory_$Pointer$.base| v_weq0_3) v_weq1_3)) (not (= v_weq0_3 c_entry_point_~array~12.base)) (not (= v_weq1_3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))))) (= |c_#NULL.offset| |c_#NULL.base|) (= 1 (select |c_#valid| c_entry_point_~array~12.base)) (forall ((v_weq0_3 Int)) (or (not (= v_weq0_3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))) (= (select (select |c_#memory_$Pointer$.offset| c_entry_point_~array~12.base) v_weq0_3) (select (select |c_#memory_$Pointer$.base| c_entry_point_~array~12.base) v_weq0_3)))) (= c_entry_point_~len~12 10) (= .cse1 .cse2) (not (= 0 c_entry_point_~array~12.base)) (= .cse2 c_entry_point_~array~12.offset) (= .cse0 |c_#NULL.offset|)))) is different from false [2018-01-24 15:53:10,349 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 15:53:10,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:53:10,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [7] total 24 [2018-01-24 15:53:10,350 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:53:10,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 15:53:10,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 15:53:10,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=246, Unknown=1, NotChecked=32, Total=342 [2018-01-24 15:53:10,351 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 19 states. [2018-01-24 15:53:11,576 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_entry_point_~array~12.base) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_entry_point_~array~12.base) .cse3)) (.cse0 (select |c_#valid| 0))) (and (= c_entry_point_~array~12.offset .cse0) (= 0 .cse1) (forall ((v_weq0_3 Int) (v_weq1_3 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| v_weq0_3) v_weq1_3) (select (select |c_#memory_$Pointer$.base| v_weq0_3) v_weq1_3)) (not (= v_weq0_3 c_entry_point_~array~12.base)) (not (= v_weq1_3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))))) (= |c_#NULL.offset| |c_#NULL.base|) (= 1 (select |c_#valid| c_entry_point_~array~12.base)) (forall ((v_weq0_3 Int)) (or (not (= v_weq0_3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))) (= (select (select |c_#memory_$Pointer$.offset| c_entry_point_~array~12.base) v_weq0_3) (select (select |c_#memory_$Pointer$.base| c_entry_point_~array~12.base) v_weq0_3)))) (= c_entry_point_~len~12 10) (= 0 c_entry_point_~array~12.offset) (= .cse1 .cse2) (not (= 0 c_entry_point_~array~12.base)) (= .cse2 c_entry_point_~array~12.offset) (= .cse0 |c_#NULL.offset|)))) is different from false [2018-01-24 15:53:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:14,665 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-01-24 15:53:14,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 15:53:14,665 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-01-24 15:53:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:14,667 INFO L225 Difference]: With dead ends: 159 [2018-01-24 15:53:14,667 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 15:53:14,667 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=277, Unknown=2, NotChecked=70, Total=420 [2018-01-24 15:53:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 15:53:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2018-01-24 15:53:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 15:53:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-01-24 15:53:14,681 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 44 [2018-01-24 15:53:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:14,682 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-01-24 15:53:14,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 15:53:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-01-24 15:53:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 15:53:14,683 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:14,683 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:53:14,683 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash 946633513, now seen corresponding path program 1 times [2018-01-24 15:53:14,684 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:14,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:14,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:14,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:14,685 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:14,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:53:14,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:14,781 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:53:14,781 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-24 15:53:14,781 INFO L201 CegarAbsIntRunner]: [3], [7], [12], [14], [19], [22], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [121], [122], [123], [124], [125], [127], [128], [129] [2018-01-24 15:53:14,783 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:53:14,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:53:15,127 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:53:15,127 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 15:53:15,170 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:53:15,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:15,170 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:53:15,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:15,175 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:53:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:15,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:53:15,243 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:53:15,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:15,347 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:53:15,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:15,350 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:53:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:15,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:53:15,397 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:53:15,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:53:15,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-24 15:53:15,431 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:53:15,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 15:53:15,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 15:53:15,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:53:15,432 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 11 states. [2018-01-24 15:53:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:15,528 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2018-01-24 15:53:15,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:53:15,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-24 15:53:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:15,530 INFO L225 Difference]: With dead ends: 202 [2018-01-24 15:53:15,530 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 15:53:15,531 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:53:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 15:53:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-24 15:53:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 15:53:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-01-24 15:53:15,543 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 44 [2018-01-24 15:53:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:15,543 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-01-24 15:53:15,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 15:53:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-01-24 15:53:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 15:53:15,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:15,545 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:53:15,545 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash -108654542, now seen corresponding path program 2 times [2018-01-24 15:53:15,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:15,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:15,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:53:15,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:15,546 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:15,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:53:15,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:15,636 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:53:15,636 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:53:15,636 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:53:15,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:15,636 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:53:15,648 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:53:15,649 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:53:15,664 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:53:15,676 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:53:15,689 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:53:15,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:53:15,754 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:53:15,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:15,840 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:53:15,843 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:53:15,843 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:53:15,857 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:53:15,875 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:53:15,889 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:53:15,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:53:15,899 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:53:15,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:53:15,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 19 [2018-01-24 15:53:15,923 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:53:15,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:53:15,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:53:15,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:53:15,925 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 13 states. [2018-01-24 15:53:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:53:16,006 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2018-01-24 15:53:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:53:16,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-24 15:53:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:53:16,007 INFO L225 Difference]: With dead ends: 206 [2018-01-24 15:53:16,007 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 15:53:16,008 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:53:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 15:53:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-24 15:53:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 15:53:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-01-24 15:53:16,024 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 48 [2018-01-24 15:53:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:53:16,024 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-01-24 15:53:16,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:53:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-01-24 15:53:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 15:53:16,025 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:53:16,025 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:53:16,026 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 15:53:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426245, now seen corresponding path program 3 times [2018-01-24 15:53:16,026 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:53:16,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:16,027 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:53:16,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:53:16,027 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:53:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:53:16,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:53:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:53:16,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:16,148 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:53:16,148 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:53:16,148 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:53:16,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:16,149 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:53:16,157 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:53:16,157 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:53:16,173 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:53:16,181 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:53:16,185 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:53:16,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:16,230 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 26 treesize of output 25 [2018-01-24 15:53:16,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:16,254 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 25 treesize of output 24 [2018-01-24 15:53:16,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:16,257 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 23 treesize of output 22 [2018-01-24 15:53:16,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:16,278 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 22 treesize of output 21 [2018-01-24 15:53:16,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:16,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:53:16,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 15:53:16,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:16,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:16,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-24 15:53:16,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:16,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:16,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-01-24 15:53:16,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:16,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:16,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-24 15:53:16,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:16,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:16,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:16,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 15:53:16,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:16,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 15:53:16,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 15:53:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 15:53:16,669 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:16,792 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 15:53:19,485 WARN L146 SmtUtils]: Spent 2569ms on a formula simplification. DAG size of input: 80 DAG size of output 31 [2018-01-24 15:53:19,499 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 15:53:23,865 WARN L143 SmtUtils]: Spent 4260ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-24 15:53:23,874 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 15:53:23,889 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 15:53:24,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 15:53:24,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:24,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 15:53:24,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:24,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-01-24 15:53:24,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 15:53:24,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:24,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:53:24,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:53:24,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 15:53:24,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 15:53:24,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:24,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 15:53:24,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:24,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 15:53:24,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 15:53:24,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:24,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:53:24,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:53:24,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 15:53:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 15:53:25,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:53:25,034 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:53:25,037 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:53:25,037 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:53:25,050 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:53:25,063 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:53:25,080 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:53:25,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:53:25,089 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 23 treesize of output 22 [2018-01-24 15:53:25,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:25,105 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 22 treesize of output 21 [2018-01-24 15:53:25,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:25,109 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 26 treesize of output 25 [2018-01-24 15:53:25,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:25,124 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 25 treesize of output 24 [2018-01-24 15:53:25,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:25,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:53:25,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 15:53:25,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:25,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:25,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-24 15:53:25,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:25,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:25,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-24 15:53:25,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:25,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:25,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:25,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 15:53:25,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:25,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:53:25,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-01-24 15:53:25,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:25,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 15:53:25,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 15:53:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 15:53:25,311 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:53:25,392 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 15:53:38,815 WARN L146 SmtUtils]: Spent 11073ms on a formula simplification. DAG size of input: 80 DAG size of output 31 [2018-01-24 15:53:38,822 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 15:53:43,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 15:53:43,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:43,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 15:53:43,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:43,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-01-24 15:53:43,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 15:53:43,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:43,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:53:43,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:53:43,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 15:53:46,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 15:53:46,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:46,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 15:53:46,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:46,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 15:53:46,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 15:53:46,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:53:46,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:53:46,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 15:53:46,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 15:53:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 15:53:47,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:53:47,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12, 12, 12] total 33 [2018-01-24 15:53:47,005 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:53:47,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 15:53:47,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 15:53:47,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=956, Unknown=5, NotChecked=0, Total=1056 [2018-01-24 15:53:47,006 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 20 states. Received shutdown request... [2018-01-24 15:53:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 15:53:56,458 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:53:56,461 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:53:56,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:53:56 BoogieIcfgContainer [2018-01-24 15:53:56,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:53:56,462 INFO L168 Benchmark]: Toolchain (without parser) took 55280.91 ms. Allocated memory was 307.8 MB in the beginning and 830.5 MB in the end (delta: 522.7 MB). Free memory was 266.8 MB in the beginning and 765.8 MB in the end (delta: -498.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:53:56,462 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 307.8 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:53:56,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.26 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 252.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:53:56,463 INFO L168 Benchmark]: Boogie Preprocessor took 36.55 ms. Allocated memory is still 307.8 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:53:56,463 INFO L168 Benchmark]: RCFGBuilder took 348.34 ms. Allocated memory is still 307.8 MB. Free memory was 250.9 MB in the beginning and 230.1 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:53:56,463 INFO L168 Benchmark]: TraceAbstraction took 54653.53 ms. Allocated memory was 307.8 MB in the beginning and 830.5 MB in the end (delta: 522.7 MB). Free memory was 230.1 MB in the beginning and 765.8 MB in the end (delta: -535.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:53:56,465 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.16 ms. Allocated memory is still 307.8 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.26 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 252.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.55 ms. Allocated memory is still 307.8 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 348.34 ms. Allocated memory is still 307.8 MB. Free memory was 250.9 MB in the beginning and 230.1 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54653.53 ms. Allocated memory was 307.8 MB in the beginning and 830.5 MB in the end (delta: 522.7 MB). Free memory was 230.1 MB in the beginning and 765.8 MB in the end (delta: -535.7 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 123 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.416851 RENAME_VARIABLES(MILLISECONDS) : 1.682464 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.311893 PROJECTAWAY(MILLISECONDS) : 1.538322 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.152363 DISJOIN(MILLISECONDS) : 1.798317 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.749757 ADD_EQUALITY(MILLISECONDS) : 0.055001 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014046 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 69 #UNFREEZE : 0 #CONJOIN : 82 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 66 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 241 LocStat_NO_SUPPORTING_DISEQUALITIES : 21 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.752463 RENAME_VARIABLES(MILLISECONDS) : 0.117951 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.342487 PROJECTAWAY(MILLISECONDS) : 0.051693 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.073869 DISJOIN(MILLISECONDS) : 0.240714 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.143248 ADD_EQUALITY(MILLISECONDS) : 0.025888 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008987 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 105 #UNFREEZE : 0 #CONJOIN : 113 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 102 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 215 LocStat_NO_SUPPORTING_DISEQUALITIES : 26 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.371333 RENAME_VARIABLES(MILLISECONDS) : 0.068983 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.346660 PROJECTAWAY(MILLISECONDS) : 0.036328 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.090465 DISJOIN(MILLISECONDS) : 0.391291 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.085424 ADD_EQUALITY(MILLISECONDS) : 0.010678 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018623 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 139 #UNFREEZE : 0 #CONJOIN : 139 #PROJECTAWAY : 114 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 136 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 227 LocStat_NO_SUPPORTING_DISEQUALITIES : 29 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 43 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.263349 RENAME_VARIABLES(MILLISECONDS) : 0.062161 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.112327 PROJECTAWAY(MILLISECONDS) : 0.023836 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054731 DISJOIN(MILLISECONDS) : 0.334103 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.074483 ADD_EQUALITY(MILLISECONDS) : 0.016500 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004353 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 141 #UNFREEZE : 0 #CONJOIN : 141 #PROJECTAWAY : 119 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 22 #RENAME_VARIABLES_DISJUNCTIVE : 136 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 52. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 54.5s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 843 SDtfs, 471 SDslu, 3267 SDs, 0 SdLazy, 1059 SolverSat, 119 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 973 GetRequests, 767 SyntacticMatches, 17 SemanticMatches, 188 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 34.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.91791944185925 AbsIntWeakeningRatio, 0.8837209302325582 AbsIntAvgWeakeningVarsNumRemoved, 5.255813953488372 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 116 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 34.8s InterpolantComputationTime, 830 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1207 ConstructedInterpolants, 102 QuantifiedInterpolants, 441408 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 33 InterpolantComputations, 9 PerfectInterpolantSequences, 354/759 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-53-56-478.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-53-56-478.csv Completed graceful shutdown