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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:36:10,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:36:10,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:36:10,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:36:10,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:36:10,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:36:10,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:36:10,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:36:10,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:36:10,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:36:10,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:36:10,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:36:10,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:36:10,221 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:36:10,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:36:10,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:36:10,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:36:10,228 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:36:10,229 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:36:10,231 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:36:10,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:36:10,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:36:10,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:36:10,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:36:10,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:36:10,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:36:10,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:36:10,237 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:36:10,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:36:10,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:36:10,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:36:10,238 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:36:10,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:36:10,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:36:10,249 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:36:10,249 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:36:10,249 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:36:10,249 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:36:10,249 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:36:10,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:36:10,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:36:10,250 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:36:10,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:36:10,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:36:10,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:36:10,251 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:36:10,251 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:36:10,252 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:36:10,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:36:10,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:36:10,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:36:10,252 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:36:10,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:36:10,253 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:36:10,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:36:10,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:36:10,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:36:10,254 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:36:10,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:36:10,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:36:10,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:36:10,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:36:10,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:36:10,255 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:36:10,255 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:36:10,256 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:36:10,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:36:10,300 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:36:10,304 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:36:10,306 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:36:10,306 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:36:10,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-28 22:36:10,503 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:36:10,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:36:10,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:36:10,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:36:10,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:36:10,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c16ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10, skipping insertion in model container [2018-01-28 22:36:10,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,539 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:36:10,590 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:36:10,700 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:36:10,718 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:36:10,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10 WrapperNode [2018-01-28 22:36:10,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:36:10,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:36:10,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:36:10,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:36:10,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (1/1) ... [2018-01-28 22:36:10,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:36:10,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:36:10,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:36:10,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:36:10,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (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-28 22:36:10,809 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:36:10,809 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:36:10,809 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:36:10,810 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-28 22:36:10,810 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-28 22:36:10,810 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:36:10,810 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:36:10,810 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:36:10,810 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:36:10,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:36:10,810 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:36:10,810 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:36:10,810 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:36:10,811 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:36:10,811 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:36:10,811 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:36:10,811 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-28 22:36:10,811 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-28 22:36:10,811 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:36:10,811 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:36:10,811 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:36:10,812 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:36:11,102 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:36:11,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:36:11 BoogieIcfgContainer [2018-01-28 22:36:11,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:36:11,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:36:11,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:36:11,106 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:36:11,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:36:10" (1/3) ... [2018-01-28 22:36:11,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc02bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:36:11, skipping insertion in model container [2018-01-28 22:36:11,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:10" (2/3) ... [2018-01-28 22:36:11,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc02bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:36:11, skipping insertion in model container [2018-01-28 22:36:11,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:36:11" (3/3) ... [2018-01-28 22:36:11,110 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-28 22:36:11,119 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:36:11,127 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-28 22:36:11,176 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:36:11,176 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:36:11,177 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:36:11,177 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:36:11,177 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:36:11,177 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:36:11,177 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:36:11,177 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:36:11,178 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:36:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-01-28 22:36:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:36:11,204 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:11,205 INFO L330 BasicCegarLoop]: trace histogram [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-28 22:36:11,206 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1613960843, now seen corresponding path program 1 times [2018-01-28 22:36:11,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:11,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:11,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:11,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:11,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:11,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:11,397 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-28 22:36:11,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:11,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:36:11,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:36:11,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:36:11,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:36:11,505 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 3 states. [2018-01-28 22:36:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:11,666 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2018-01-28 22:36:11,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:36:11,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-28 22:36:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:11,679 INFO L225 Difference]: With dead ends: 239 [2018-01-28 22:36:11,679 INFO L226 Difference]: Without dead ends: 154 [2018-01-28 22:36:11,682 INFO L533 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-28 22:36:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-28 22:36:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2018-01-28 22:36:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-28 22:36:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-28 22:36:11,729 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 23 [2018-01-28 22:36:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:11,730 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-28 22:36:11,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:36:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-28 22:36:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:36:11,731 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:11,731 INFO L330 BasicCegarLoop]: trace histogram [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-28 22:36:11,731 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2079051007, now seen corresponding path program 1 times [2018-01-28 22:36:11,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:11,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:11,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:11,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:11,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:11,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:11,866 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-28 22:36:11,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:11,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:36:11,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:36:11,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:36:11,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:11,869 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 6 states. [2018-01-28 22:36:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:11,975 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-01-28 22:36:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:36:11,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 22:36:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:11,978 INFO L225 Difference]: With dead ends: 124 [2018-01-28 22:36:11,979 INFO L226 Difference]: Without dead ends: 120 [2018-01-28 22:36:11,980 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:36:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-28 22:36:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2018-01-28 22:36:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 22:36:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-28 22:36:11,992 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 24 [2018-01-28 22:36:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:11,992 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-28 22:36:11,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:36:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-28 22:36:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 22:36:11,993 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:11,993 INFO L330 BasicCegarLoop]: trace histogram [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-28 22:36:11,994 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1534520130, now seen corresponding path program 1 times [2018-01-28 22:36:11,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:11,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:11,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:11,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:11,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:12,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:12,066 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-28 22:36:12,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:12,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:36:12,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:36:12,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:36:12,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:36:12,067 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 5 states. [2018-01-28 22:36:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:12,096 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2018-01-28 22:36:12,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:36:12,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-28 22:36:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:12,098 INFO L225 Difference]: With dead ends: 188 [2018-01-28 22:36:12,098 INFO L226 Difference]: Without dead ends: 100 [2018-01-28 22:36:12,099 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-28 22:36:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-28 22:36:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-28 22:36:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-28 22:36:12,109 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 24 [2018-01-28 22:36:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:12,109 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-28 22:36:12,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:36:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-28 22:36:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:36:12,110 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:12,110 INFO L330 BasicCegarLoop]: trace histogram [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-28 22:36:12,111 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:12,111 INFO L82 PathProgramCache]: Analyzing trace with hash -53770488, now seen corresponding path program 1 times [2018-01-28 22:36:12,111 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:12,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:12,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:12,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:12,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:12,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:12,181 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-28 22:36:12,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:12,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:36:12,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:36:12,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:36:12,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:12,182 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 6 states. [2018-01-28 22:36:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:12,292 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-01-28 22:36:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:36:12,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-28 22:36:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:12,294 INFO L225 Difference]: With dead ends: 100 [2018-01-28 22:36:12,296 INFO L226 Difference]: Without dead ends: 99 [2018-01-28 22:36:12,297 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:36:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-28 22:36:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-28 22:36:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 22:36:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-28 22:36:12,308 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 25 [2018-01-28 22:36:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:12,308 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-28 22:36:12,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:36:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-28 22:36:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:36:12,309 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:12,309 INFO L330 BasicCegarLoop]: trace histogram [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-28 22:36:12,309 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash -53770487, now seen corresponding path program 1 times [2018-01-28 22:36:12,310 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:12,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:12,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:12,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:12,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:12,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:12,655 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-28 22:36:12,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:12,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:36:12,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:36:12,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:36:12,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:36:12,657 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 9 states. [2018-01-28 22:36:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:12,945 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-01-28 22:36:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:36:12,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-28 22:36:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:12,947 INFO L225 Difference]: With dead ends: 183 [2018-01-28 22:36:12,947 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 22:36:12,948 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:36:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 22:36:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-01-28 22:36:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-28 22:36:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-28 22:36:12,957 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 25 [2018-01-28 22:36:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:12,958 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-28 22:36:12,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:36:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-28 22:36:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:36:12,959 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:12,959 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-28 22:36:12,960 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:12,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1096156737, now seen corresponding path program 1 times [2018-01-28 22:36:12,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:12,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:12,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:12,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:12,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:12,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:13,306 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-28 22:36:13,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:13,336 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:36:13,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:13,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:13,445 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-28 22:36:13,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:13,459 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-28 22:36:13,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:13,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:36:13,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:36:13,860 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-28 22:36:13,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:13,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-28 22:36:13,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 22:36:13,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 22:36:13,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:36:13,882 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 20 states. [2018-01-28 22:36:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:14,368 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-28 22:36:14,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:36:14,369 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-28 22:36:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:14,370 INFO L225 Difference]: With dead ends: 189 [2018-01-28 22:36:14,370 INFO L226 Difference]: Without dead ends: 110 [2018-01-28 22:36:14,371 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:36:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-28 22:36:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-28 22:36:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-28 22:36:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-01-28 22:36:14,380 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 31 [2018-01-28 22:36:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:14,380 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-01-28 22:36:14,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 22:36:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-01-28 22:36:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:36:14,381 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:14,382 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2018-01-28 22:36:14,382 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1142492149, now seen corresponding path program 2 times [2018-01-28 22:36:14,382 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:14,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:14,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:14,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:14,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:14,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:14,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:14,764 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:36:14,774 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:36:14,794 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:36:14,798 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:36:14,800 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:36:14,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:14,820 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-28 22:36:14,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:14,834 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-28 22:36:14,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:14,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:36:14,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:36:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:15,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:15,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-28 22:36:15,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:36:15,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:36:15,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:36:15,235 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 24 states. [2018-01-28 22:36:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:15,869 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2018-01-28 22:36:15,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:36:15,869 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-28 22:36:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:15,870 INFO L225 Difference]: With dead ends: 195 [2018-01-28 22:36:15,870 INFO L226 Difference]: Without dead ends: 116 [2018-01-28 22:36:15,872 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-01-28 22:36:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-28 22:36:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-28 22:36:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-28 22:36:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-01-28 22:36:15,880 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 37 [2018-01-28 22:36:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:15,880 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-01-28 22:36:15,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:36:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-01-28 22:36:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:36:15,881 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:15,882 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-01-28 22:36:15,882 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:15,882 INFO L82 PathProgramCache]: Analyzing trace with hash 318971307, now seen corresponding path program 3 times [2018-01-28 22:36:15,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:15,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:15,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:15,883 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:36:15,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:15,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:16,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:16,228 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:36:16,238 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:36:16,249 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:36:16,252 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:36:16,253 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:36:16,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:16,283 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-28 22:36:16,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:16,294 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-28 22:36:16,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:16,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:36:16,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:36:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-28 22:36:18,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:18,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-01-28 22:36:18,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 22:36:18,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 22:36:18,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=636, Unknown=1, NotChecked=0, Total=702 [2018-01-28 22:36:18,904 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 27 states. [2018-01-28 22:36:19,674 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 61 DAG size of output 26 [2018-01-28 22:36:21,905 WARN L146 SmtUtils]: Spent 1114ms on a formula simplification. DAG size of input: 36 DAG size of output 25 [2018-01-28 22:36:23,791 WARN L146 SmtUtils]: Spent 1002ms on a formula simplification. DAG size of input: 42 DAG size of output 31 [2018-01-28 22:36:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:23,993 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-01-28 22:36:23,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:36:23,993 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-28 22:36:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:23,994 INFO L225 Difference]: With dead ends: 200 [2018-01-28 22:36:23,994 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 22:36:23,995 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=358, Invalid=1897, Unknown=1, NotChecked=0, Total=2256 [2018-01-28 22:36:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 22:36:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-01-28 22:36:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-28 22:36:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-28 22:36:24,001 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 43 [2018-01-28 22:36:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:24,002 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-28 22:36:24,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 22:36:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-28 22:36:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 22:36:24,004 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:24,004 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:24,005 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash 52914778, now seen corresponding path program 1 times [2018-01-28 22:36:24,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:24,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:24,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:24,006 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:36:24,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:24,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-28 22:36:24,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:24,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:36:24,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:36:24,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:36:24,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:36:24,076 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 5 states. [2018-01-28 22:36:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:24,108 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2018-01-28 22:36:24,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:36:24,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-28 22:36:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:24,110 INFO L225 Difference]: With dead ends: 195 [2018-01-28 22:36:24,110 INFO L226 Difference]: Without dead ends: 123 [2018-01-28 22:36:24,111 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-28 22:36:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-28 22:36:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-28 22:36:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-28 22:36:24,125 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 68 [2018-01-28 22:36:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:24,125 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-28 22:36:24,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:36:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-28 22:36:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 22:36:24,127 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:24,127 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:24,127 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:24,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1134969414, now seen corresponding path program 1 times [2018-01-28 22:36:24,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:24,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:24,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:24,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:24,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:24,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-28 22:36:24,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:24,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:36:24,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:36:24,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:36:24,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:24,206 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-01-28 22:36:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:24,348 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2018-01-28 22:36:24,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:36:24,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-01-28 22:36:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:24,350 INFO L225 Difference]: With dead ends: 170 [2018-01-28 22:36:24,351 INFO L226 Difference]: Without dead ends: 168 [2018-01-28 22:36:24,351 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:36:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-28 22:36:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-01-28 22:36:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-28 22:36:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2018-01-28 22:36:24,363 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 69 [2018-01-28 22:36:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:24,363 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-01-28 22:36:24,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:36:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2018-01-28 22:36:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 22:36:24,365 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:24,365 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:24,366 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1134969415, now seen corresponding path program 1 times [2018-01-28 22:36:24,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:24,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:24,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:24,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:24,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:24,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:24,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:24,558 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:36:24,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:24,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:24,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:24,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-28 22:36:24,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:36:24,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:36:24,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:36:24,841 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand 21 states. [2018-01-28 22:36:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:25,034 INFO L93 Difference]: Finished difference Result 271 states and 300 transitions. [2018-01-28 22:36:25,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:36:25,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-01-28 22:36:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:25,036 INFO L225 Difference]: With dead ends: 271 [2018-01-28 22:36:25,036 INFO L226 Difference]: Without dead ends: 160 [2018-01-28 22:36:25,037 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:36:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-28 22:36:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-01-28 22:36:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-28 22:36:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2018-01-28 22:36:25,049 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 69 [2018-01-28 22:36:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:25,049 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2018-01-28 22:36:25,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:36:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2018-01-28 22:36:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-28 22:36:25,051 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:25,051 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:25,051 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:25,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1251214339, now seen corresponding path program 2 times [2018-01-28 22:36:25,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:25,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:25,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:25,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:25,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:25,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:25,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:25,224 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:36:25,231 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:36:25,249 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:36:25,252 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:36:25,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-28 22:36:25,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:36:25,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2018-01-28 22:36:25,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:36:25,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:36:25,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:36:25,342 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand 17 states. [2018-01-28 22:36:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:25,684 INFO L93 Difference]: Finished difference Result 306 states and 337 transitions. [2018-01-28 22:36:25,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 22:36:25,684 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-01-28 22:36:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:25,685 INFO L225 Difference]: With dead ends: 306 [2018-01-28 22:36:25,685 INFO L226 Difference]: Without dead ends: 192 [2018-01-28 22:36:25,686 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:36:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-28 22:36:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2018-01-28 22:36:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-28 22:36:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2018-01-28 22:36:25,697 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 75 [2018-01-28 22:36:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:25,698 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2018-01-28 22:36:25,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:36:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2018-01-28 22:36:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 22:36:25,699 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:25,699 INFO L330 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:25,699 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:25,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1641778756, now seen corresponding path program 1 times [2018-01-28 22:36:25,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:25,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:25,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:25,701 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:36:25,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:25,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:36:26,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:26,172 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:36:26,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:26,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:26,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:26,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-28 22:36:26,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:36:26,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:36:26,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:36:26,409 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand 29 states. [2018-01-28 22:36:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:26,613 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2018-01-28 22:36:26,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 22:36:26,614 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-28 22:36:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:26,615 INFO L225 Difference]: With dead ends: 281 [2018-01-28 22:36:26,615 INFO L226 Difference]: Without dead ends: 171 [2018-01-28 22:36:26,616 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 22:36:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-28 22:36:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-01-28 22:36:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-28 22:36:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-01-28 22:36:26,628 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 81 [2018-01-28 22:36:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:26,628 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-01-28 22:36:26,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:36:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-01-28 22:36:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-28 22:36:26,629 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:26,629 INFO L330 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:26,629 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash -784119182, now seen corresponding path program 2 times [2018-01-28 22:36:26,630 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:26,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:26,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:26,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:26,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:26,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:36:26,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:26,825 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:36:26,831 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:36:26,842 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:36:26,853 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:36:26,855 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:36:26,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:27,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:27,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-28 22:36:27,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:36:27,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:36:27,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:36:27,052 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 33 states. [2018-01-28 22:36:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:27,362 INFO L93 Difference]: Finished difference Result 287 states and 314 transitions. [2018-01-28 22:36:27,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:36:27,364 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-01-28 22:36:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:27,365 INFO L225 Difference]: With dead ends: 287 [2018-01-28 22:36:27,365 INFO L226 Difference]: Without dead ends: 177 [2018-01-28 22:36:27,366 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2018-01-28 22:36:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-28 22:36:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2018-01-28 22:36:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-28 22:36:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-01-28 22:36:27,382 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 87 [2018-01-28 22:36:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:27,382 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-01-28 22:36:27,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 22:36:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-01-28 22:36:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-28 22:36:27,383 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:27,384 INFO L330 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:27,384 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1819393368, now seen corresponding path program 3 times [2018-01-28 22:36:27,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:27,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:27,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:27,385 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:36:27,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:27,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:36:27,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:27,649 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:36:27,654 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:36:27,667 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:36:27,673 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:36:27,674 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:36:27,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:27,681 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 6 treesize of output 5 [2018-01-28 22:36:27,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:27,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:36:27,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:36:27,805 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-28 22:36:27,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-01-28 22:36:27,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:27,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:36:27,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-28 22:36:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 3 not checked. [2018-01-28 22:36:27,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:27,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2018-01-28 22:36:27,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-28 22:36:27,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-28 22:36:27,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=586, Unknown=1, NotChecked=50, Total=756 [2018-01-28 22:36:27,871 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 28 states. [2018-01-28 22:36:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:28,634 INFO L93 Difference]: Finished difference Result 317 states and 352 transitions. [2018-01-28 22:36:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-28 22:36:28,634 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-01-28 22:36:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:28,635 INFO L225 Difference]: With dead ends: 317 [2018-01-28 22:36:28,635 INFO L226 Difference]: Without dead ends: 207 [2018-01-28 22:36:28,637 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=719, Invalid=2943, Unknown=2, NotChecked=118, Total=3782 [2018-01-28 22:36:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-28 22:36:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2018-01-28 22:36:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-28 22:36:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-01-28 22:36:28,649 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 93 [2018-01-28 22:36:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:28,649 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-01-28 22:36:28,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-28 22:36:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-01-28 22:36:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-28 22:36:28,650 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:28,650 INFO L330 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:28,650 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:28,650 INFO L82 PathProgramCache]: Analyzing trace with hash 676313695, now seen corresponding path program 1 times [2018-01-28 22:36:28,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:28,651 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:28,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:28,652 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:36:28,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:28,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:36:29,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:29,092 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 22:36:29,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:29,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:29,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:29,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-28 22:36:29,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-28 22:36:29,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-28 22:36:29,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 22:36:29,368 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 41 states. [2018-01-28 22:36:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:29,657 INFO L93 Difference]: Finished difference Result 311 states and 344 transitions. [2018-01-28 22:36:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 22:36:29,657 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-28 22:36:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:29,658 INFO L225 Difference]: With dead ends: 311 [2018-01-28 22:36:29,658 INFO L226 Difference]: Without dead ends: 195 [2018-01-28 22:36:29,660 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-28 22:36:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-28 22:36:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-01-28 22:36:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-28 22:36:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2018-01-28 22:36:29,668 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 99 [2018-01-28 22:36:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:29,669 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2018-01-28 22:36:29,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-28 22:36:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2018-01-28 22:36:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-28 22:36:29,669 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:29,669 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:29,670 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash 160043413, now seen corresponding path program 2 times [2018-01-28 22:36:29,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:29,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:29,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:29,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:29,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:29,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-28 22:36:30,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:30,456 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:36:30,462 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:36:30,478 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:36:30,492 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:36:30,498 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:36:30,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:30,509 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-28 22:36:30,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:30,529 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-28 22:36:30,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:30,532 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-28 22:36:30,533 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:30,556 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 19 treesize of output 18 [2018-01-28 22:36:30,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:30,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:36:30,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-28 22:36:33,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:33,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:33,060 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 57 treesize of output 70 [2018-01-28 22:36:33,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:33,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:33,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:33,104 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 56 treesize of output 50 [2018-01-28 22:36:33,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:33,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:33,144 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 55 treesize of output 58 [2018-01-28 22:36:33,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:33,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:33,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:33,178 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 54 treesize of output 48 [2018-01-28 22:36:33,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:33,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-28 22:36:33,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-28 22:36:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:33,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:33,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 54 [2018-01-28 22:36:33,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-28 22:36:33,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-28 22:36:33,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2744, Unknown=3, NotChecked=0, Total=2970 [2018-01-28 22:36:33,436 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand 55 states. [2018-01-28 22:36:37,702 WARN L146 SmtUtils]: Spent 4090ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-01-28 22:36:41,923 WARN L146 SmtUtils]: Spent 4135ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-01-28 22:36:44,018 WARN L143 SmtUtils]: Spent 2030ms on a formula simplification that was a NOOP. DAG size: 55 [2018-01-28 22:36:46,198 WARN L146 SmtUtils]: Spent 2101ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-28 22:36:47,286 WARN L146 SmtUtils]: Spent 932ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-01-28 22:36:49,687 WARN L146 SmtUtils]: Spent 2127ms on a formula simplification. DAG size of input: 77 DAG size of output 64 [2018-01-28 22:36:52,167 WARN L146 SmtUtils]: Spent 2073ms on a formula simplification. DAG size of input: 71 DAG size of output 65 [2018-01-28 22:36:52,519 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 83 DAG size of output 75 [2018-01-28 22:36:54,647 WARN L146 SmtUtils]: Spent 2071ms on a formula simplification. DAG size of input: 71 DAG size of output 66 [2018-01-28 22:36:56,979 WARN L146 SmtUtils]: Spent 2097ms on a formula simplification. DAG size of input: 80 DAG size of output 71 [2018-01-28 22:36:58,312 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-28 22:36:58,957 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 77 DAG size of output 70 [2018-01-28 22:36:59,457 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-28 22:37:40,545 WARN L146 SmtUtils]: Spent 28895ms on a formula simplification. DAG size of input: 82 DAG size of output 79 [2018-01-28 22:38:09,681 WARN L146 SmtUtils]: Spent 29030ms on a formula simplification. DAG size of input: 86 DAG size of output 83 [2018-01-28 22:38:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:10,457 INFO L93 Difference]: Finished difference Result 296 states and 323 transitions. [2018-01-28 22:38:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-28 22:38:10,457 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2018-01-28 22:38:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:10,459 INFO L225 Difference]: With dead ends: 296 [2018-01-28 22:38:10,459 INFO L226 Difference]: Without dead ends: 294 [2018-01-28 22:38:10,462 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3121 ImplicationChecksByTransitivity, 88.6s TimeCoverageRelationStatistics Valid=1498, Invalid=11152, Unknown=6, NotChecked=0, Total=12656 [2018-01-28 22:38:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-28 22:38:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 195. [2018-01-28 22:38:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-28 22:38:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2018-01-28 22:38:10,489 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 105 [2018-01-28 22:38:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:10,489 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2018-01-28 22:38:10,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-28 22:38:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2018-01-28 22:38:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-28 22:38:10,490 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:10,490 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:38:10,491 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash 18432984, now seen corresponding path program 1 times [2018-01-28 22:38:10,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:10,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:10,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:10,492 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:38:10,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:10,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-28 22:38:10,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:10,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:38:10,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:38:10,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:38:10,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:38:10,592 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand 4 states. [2018-01-28 22:38:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:10,644 INFO L93 Difference]: Finished difference Result 253 states and 273 transitions. [2018-01-28 22:38:10,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:38:10,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-28 22:38:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:10,645 INFO L225 Difference]: With dead ends: 253 [2018-01-28 22:38:10,645 INFO L226 Difference]: Without dead ends: 205 [2018-01-28 22:38:10,646 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:38:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-28 22:38:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 198. [2018-01-28 22:38:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-28 22:38:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-01-28 22:38:10,664 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 107 [2018-01-28 22:38:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:10,665 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-01-28 22:38:10,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:38:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-01-28 22:38:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-28 22:38:10,666 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:10,666 INFO L330 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 2, 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, 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, 1, 1] [2018-01-28 22:38:10,666 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:10,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1617005259, now seen corresponding path program 1 times [2018-01-28 22:38:10,667 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:10,667 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:10,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:10,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:10,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:10,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 1 proven. 126 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-28 22:38:11,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:11,315 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:38:11,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:11,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:11,356 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 14 treesize of output 13 [2018-01-28 22:38:11,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:11,367 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-28 22:38:11,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:11,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:38:11,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-28 22:38:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 211 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:21,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:21,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 47 [2018-01-28 22:38:21,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-28 22:38:21,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-28 22:38:21,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2050, Unknown=2, NotChecked=0, Total=2256 [2018-01-28 22:38:21,514 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 48 states. [2018-01-28 22:38:25,826 WARN L143 SmtUtils]: Spent 4033ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-28 22:38:31,949 WARN L143 SmtUtils]: Spent 6076ms on a formula simplification that was a NOOP. DAG size: 53 [2018-01-28 22:38:34,013 WARN L143 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-28 22:38:38,106 WARN L143 SmtUtils]: Spent 4041ms on a formula simplification that was a NOOP. DAG size: 52 Received shutdown request... [2018-01-28 22:38:40,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:38:40,178 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:38:40,183 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:38:40,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:38:40 BoogieIcfgContainer [2018-01-28 22:38:40,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:38:40,184 INFO L168 Benchmark]: Toolchain (without parser) took 149680.80 ms. Allocated memory was 302.0 MB in the beginning and 608.7 MB in the end (delta: 306.7 MB). Free memory was 260.9 MB in the beginning and 336.2 MB in the end (delta: -75.4 MB). Peak memory consumption was 231.3 MB. Max. memory is 5.3 GB. [2018-01-28 22:38:40,185 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 302.0 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:38:40,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.51 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 246.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:38:40,186 INFO L168 Benchmark]: Boogie Preprocessor took 35.15 ms. Allocated memory is still 302.0 MB. Free memory was 246.9 MB in the beginning and 244.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:38:40,186 INFO L168 Benchmark]: RCFGBuilder took 340.07 ms. Allocated memory is still 302.0 MB. Free memory was 244.9 MB in the beginning and 220.0 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:38:40,187 INFO L168 Benchmark]: TraceAbstraction took 149079.89 ms. Allocated memory was 302.0 MB in the beginning and 608.7 MB in the end (delta: 306.7 MB). Free memory was 220.0 MB in the beginning and 336.2 MB in the end (delta: -116.3 MB). Peak memory consumption was 190.4 MB. Max. memory is 5.3 GB. [2018-01-28 22:38:40,189 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.24 ms. Allocated memory is still 302.0 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.51 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 246.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 35.15 ms. Allocated memory is still 302.0 MB. Free memory was 246.9 MB in the beginning and 244.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 340.07 ms. Allocated memory is still 302.0 MB. Free memory was 244.9 MB in the beginning and 220.0 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 149079.89 ms. Allocated memory was 302.0 MB in the beginning and 608.7 MB in the end (delta: 306.7 MB). Free memory was 220.0 MB in the beginning and 336.2 MB in the end (delta: -116.3 MB). Peak memory consumption was 190.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (198states) and interpolant automaton (currently 10 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 101 locations, 17 error locations. TIMEOUT Result, 149.0s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 125.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1762 SDtfs, 1856 SDslu, 14227 SDs, 0 SdLazy, 6521 SolverSat, 352 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1292 GetRequests, 712 SyntacticMatches, 5 SemanticMatches, 575 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7873 ImplicationChecksByTransitivity, 128.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 2043 NumberOfCodeBlocks, 1953 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2013 ConstructedInterpolants, 201 QuantifiedInterpolants, 1713279 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 1451/3270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-38-40-197.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-38-40-197.csv Completed graceful shutdown