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-5f7ec6e [2018-01-31 08:42:34,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:42:34,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:42:34,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:42:34,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:42:34,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:42:34,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:42:34,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:42:34,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:42:34,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:42:34,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:42:34,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:42:34,692 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:42:34,694 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:42:34,695 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:42:34,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:42:34,708 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:42:34,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:42:34,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:42:34,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:42:34,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:42:34,727 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:42:34,727 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:42:34,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:42:34,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:42:34,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:42:34,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:42:34,735 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:42:34,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:42:34,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:42:34,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:42:34,736 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-31 08:42:34,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:42:34,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:42:34,756 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:42:34,757 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:42:34,758 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:42:34,758 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:42:34,758 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:42:34,759 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:42:34,759 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:42:34,759 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:42:34,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:42:34,760 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:42:34,760 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:42:34,760 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:42:34,760 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:42:34,760 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:42:34,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:42:34,761 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:42:34,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:42:34,761 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:42:34,762 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:42:34,762 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:42:34,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:42:34,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:42:34,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:42:34,763 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:42:34,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:42:34,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:42:34,763 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:42:34,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:42:34,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:42:34,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:42:34,764 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:42:34,765 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:42:34,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:42:34,843 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:42:34,846 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:42:34,847 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:42:34,848 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:42:34,848 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-31 08:42:35,106 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:42:35,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:42:35,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:42:35,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:42:35,122 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:42:35,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573beb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35, skipping insertion in model container [2018-01-31 08:42:35,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,146 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:42:35,220 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:42:35,413 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:42:35,453 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:42:35,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35 WrapperNode [2018-01-31 08:42:35,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:42:35,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:42:35,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:42:35,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:42:35,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (1/1) ... [2018-01-31 08:42:35,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:42:35,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:42:35,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:42:35,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:42:35,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (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-31 08:42:35,573 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:42:35,573 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:42:35,573 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:42:35,573 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-31 08:42:35,573 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-31 08:42:35,573 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:42:35,573 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:42:35,573 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:42:35,574 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:42:35,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:42:35,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:42:35,574 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:42:35,574 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:42:35,574 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:42:35,574 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:42:35,575 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:42:35,575 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-31 08:42:35,575 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-31 08:42:35,575 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:42:35,575 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:42:35,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:42:35,576 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:42:36,218 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:42:36,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:42:36 BoogieIcfgContainer [2018-01-31 08:42:36,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:42:36,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:42:36,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:42:36,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:42:36,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:42:35" (1/3) ... [2018-01-31 08:42:36,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2b86b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:42:36, skipping insertion in model container [2018-01-31 08:42:36,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:42:35" (2/3) ... [2018-01-31 08:42:36,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2b86b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:42:36, skipping insertion in model container [2018-01-31 08:42:36,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:42:36" (3/3) ... [2018-01-31 08:42:36,226 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-31 08:42:36,235 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:42:36,245 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-31 08:42:36,302 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:42:36,302 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:42:36,302 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:42:36,303 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:42:36,303 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:42:36,303 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:42:36,303 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:42:36,303 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:42:36,304 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:42:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-01-31 08:42:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:42:36,339 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:36,340 INFO L351 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-31 08:42:36,340 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-31 08:42:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1613960843, now seen corresponding path program 1 times [2018-01-31 08:42:36,348 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:36,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:36,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:36,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:36,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:36,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:36,654 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-31 08:42:36,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:36,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:42:36,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:42:36,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:42:36,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:42:36,772 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 3 states. [2018-01-31 08:42:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:37,253 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2018-01-31 08:42:37,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:42:37,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-31 08:42:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:37,266 INFO L225 Difference]: With dead ends: 239 [2018-01-31 08:42:37,267 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 08:42:37,271 INFO L554 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-31 08:42:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 08:42:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2018-01-31 08:42:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-31 08:42:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-31 08:42:37,329 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 23 [2018-01-31 08:42:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:37,329 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-31 08:42:37,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:42:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-31 08:42:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:42:37,331 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:37,332 INFO L351 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-31 08:42:37,333 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-31 08:42:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2079051007, now seen corresponding path program 1 times [2018-01-31 08:42:37,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:37,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:37,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:37,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:37,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:37,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:37,496 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-31 08:42:37,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:37,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:42:37,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:42:37,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:42:37,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:37,500 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 6 states. [2018-01-31 08:42:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:37,683 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-01-31 08:42:37,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:42:37,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 08:42:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:37,686 INFO L225 Difference]: With dead ends: 124 [2018-01-31 08:42:37,686 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 08:42:37,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:42:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 08:42:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2018-01-31 08:42:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:42:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-31 08:42:37,700 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 24 [2018-01-31 08:42:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:37,701 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-31 08:42:37,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:42:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-31 08:42:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:42:37,702 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:37,702 INFO L351 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-31 08:42:37,702 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-31 08:42:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1534520130, now seen corresponding path program 1 times [2018-01-31 08:42:37,702 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:37,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:37,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:37,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:37,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:37,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:37,794 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-31 08:42:37,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:37,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:37,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:42:37,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:42:37,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:42:37,796 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 5 states. [2018-01-31 08:42:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:37,869 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2018-01-31 08:42:37,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:42:37,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-31 08:42:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:37,873 INFO L225 Difference]: With dead ends: 188 [2018-01-31 08:42:37,873 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:42:37,874 INFO L554 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-31 08:42:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:42:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-31 08:42:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-31 08:42:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-31 08:42:37,883 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 24 [2018-01-31 08:42:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:37,883 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-31 08:42:37,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:42:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-31 08:42:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:42:37,885 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:37,885 INFO L351 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-31 08:42:37,885 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-31 08:42:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash -53770488, now seen corresponding path program 1 times [2018-01-31 08:42:37,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:37,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:37,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:37,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:37,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:37,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:38,117 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-31 08:42:38,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:38,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:38,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:42:38,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:42:38,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:38,119 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 6 states. [2018-01-31 08:42:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:38,665 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-01-31 08:42:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:42:38,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 08:42:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:38,667 INFO L225 Difference]: With dead ends: 100 [2018-01-31 08:42:38,667 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 08:42:38,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:42:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 08:42:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-31 08:42:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:42:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-31 08:42:38,677 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 25 [2018-01-31 08:42:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:38,677 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-31 08:42:38,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:42:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-31 08:42:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:42:38,679 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:38,679 INFO L351 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-31 08:42:38,679 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-31 08:42:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash -53770487, now seen corresponding path program 1 times [2018-01-31 08:42:38,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:38,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:38,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:38,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:38,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:38,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:39,094 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:42:39,246 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-31 08:42:39,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:39,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:42:39,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:42:39,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:42:39,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:42:39,248 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 9 states. [2018-01-31 08:42:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:40,043 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-01-31 08:42:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:42:40,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-31 08:42:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:40,045 INFO L225 Difference]: With dead ends: 183 [2018-01-31 08:42:40,045 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 08:42:40,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:42:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 08:42:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-01-31 08:42:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 08:42:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-31 08:42:40,057 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 25 [2018-01-31 08:42:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:40,057 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-31 08:42:40,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:42:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-31 08:42:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:42:40,058 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:40,059 INFO L351 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-31 08:42:40,059 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-31 08:42:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1096156737, now seen corresponding path program 1 times [2018-01-31 08:42:40,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:40,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:40,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:40,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:40,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:40,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:40,490 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-31 08:42:40,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:40,491 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-31 08:42:40,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:40,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:40,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:42:40,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:40,642 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-31 08:42:40,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:40,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:42:40,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:42:41,203 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-31 08:42:41,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:41,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-31 08:42:41,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:42:41,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:42:41,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:42:41,236 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 20 states. [2018-01-31 08:42:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:42,116 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-31 08:42:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:42:42,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-31 08:42:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:42,117 INFO L225 Difference]: With dead ends: 189 [2018-01-31 08:42:42,117 INFO L226 Difference]: Without dead ends: 110 [2018-01-31 08:42:42,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:42:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-31 08:42:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-31 08:42:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-31 08:42:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-01-31 08:42:42,129 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 31 [2018-01-31 08:42:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:42,129 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-01-31 08:42:42,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:42:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-01-31 08:42:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:42:42,131 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:42,131 INFO L351 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-31 08:42:42,131 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-31 08:42:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1142492149, now seen corresponding path program 2 times [2018-01-31 08:42:42,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:42,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:42,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:42,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:42,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:42,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:42,585 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-31 08:42:42,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:42,585 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-31 08:42:42,602 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:42:42,620 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:42,640 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:42,655 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:42,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:42,695 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-31 08:42:42,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:42,709 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-31 08:42:42,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:42,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:42:42,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:42:43,238 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-31 08:42:43,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:43,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-31 08:42:43,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:42:43,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:42:43,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:42:43,273 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 24 states. [2018-01-31 08:42:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:44,558 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2018-01-31 08:42:44,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:42:44,558 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-31 08:42:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:44,559 INFO L225 Difference]: With dead ends: 195 [2018-01-31 08:42:44,559 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:42:44,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:42:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:42:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-31 08:42:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-31 08:42:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-01-31 08:42:44,573 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 37 [2018-01-31 08:42:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:44,573 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-01-31 08:42:44,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:42:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-01-31 08:42:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:42:44,575 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:44,575 INFO L351 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-31 08:42:44,575 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-31 08:42:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash 318971307, now seen corresponding path program 3 times [2018-01-31 08:42:44,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:44,575 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:44,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:44,577 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:44,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:44,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:45,094 WARN L143 SmtUtils]: Spent 166ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:42:45,504 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-31 08:42:45,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:45,504 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-31 08:42:45,509 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:42:45,524 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:42:45,537 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:42:45,541 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:45,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:45,578 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-31 08:42:45,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:45,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:42:45,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:45,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:42:45,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:42:48,120 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-31 08:42:48,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:48,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-01-31 08:42:48,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:42:48,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:42:48,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=636, Unknown=1, NotChecked=0, Total=702 [2018-01-31 08:42:48,144 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 27 states. [2018-01-31 08:42:49,040 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 61 DAG size of output 26 [2018-01-31 08:42:49,825 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 53 DAG size of output 30 [2018-01-31 08:42:50,610 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 47 DAG size of output 30 [2018-01-31 08:42:51,907 WARN L146 SmtUtils]: Spent 1095ms on a formula simplification. DAG size of input: 36 DAG size of output 25 [2018-01-31 08:42:53,737 WARN L146 SmtUtils]: Spent 979ms on a formula simplification. DAG size of input: 42 DAG size of output 31 [2018-01-31 08:42:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:54,038 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-01-31 08:42:54,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:42:54,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-31 08:42:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:54,040 INFO L225 Difference]: With dead ends: 200 [2018-01-31 08:42:54,040 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:42:54,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=358, Invalid=1897, Unknown=1, NotChecked=0, Total=2256 [2018-01-31 08:42:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:42:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-01-31 08:42:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:42:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-31 08:42:54,050 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 43 [2018-01-31 08:42:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:54,050 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-31 08:42:54,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:42:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-31 08:42:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:42:54,052 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:54,052 INFO L351 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-31 08:42:54,052 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-31 08:42:54,053 INFO L82 PathProgramCache]: Analyzing trace with hash 52914778, now seen corresponding path program 1 times [2018-01-31 08:42:54,053 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:54,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:54,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:54,054 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:54,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:54,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:54,233 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-31 08:42:54,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:54,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:54,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:42:54,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:42:54,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:42:54,234 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 5 states. [2018-01-31 08:42:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:54,355 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2018-01-31 08:42:54,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:42:54,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-31 08:42:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:54,357 INFO L225 Difference]: With dead ends: 195 [2018-01-31 08:42:54,357 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 08:42:54,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 08:42:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-31 08:42:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-31 08:42:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-31 08:42:54,371 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 68 [2018-01-31 08:42:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:54,371 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-31 08:42:54,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:42:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-31 08:42:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:42:54,372 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:54,373 INFO L351 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-31 08:42:54,373 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-31 08:42:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1134969414, now seen corresponding path program 1 times [2018-01-31 08:42:54,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:54,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:54,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:54,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:54,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:54,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:54,653 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-31 08:42:54,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:42:54,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:42:54,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:42:54,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:42:54,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:42:54,655 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-01-31 08:42:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:54,824 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2018-01-31 08:42:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:42:54,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-01-31 08:42:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:54,826 INFO L225 Difference]: With dead ends: 170 [2018-01-31 08:42:54,826 INFO L226 Difference]: Without dead ends: 168 [2018-01-31 08:42:54,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:42:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-31 08:42:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2018-01-31 08:42:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-31 08:42:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2018-01-31 08:42:54,837 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 69 [2018-01-31 08:42:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:54,838 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-01-31 08:42:54,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:42:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2018-01-31 08:42:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:42:54,839 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:54,845 INFO L351 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-31 08:42:54,845 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-31 08:42:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1134969415, now seen corresponding path program 1 times [2018-01-31 08:42:54,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:54,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:54,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:54,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:54,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:54,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:55,014 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-31 08:42:55,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:55,015 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-31 08:42:55,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:55,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:55,319 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-31 08:42:55,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:55,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-31 08:42:55,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:42:55,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:42:55,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:42:55,340 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand 21 states. [2018-01-31 08:42:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:55,486 INFO L93 Difference]: Finished difference Result 271 states and 300 transitions. [2018-01-31 08:42:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:42:55,487 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-01-31 08:42:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:55,488 INFO L225 Difference]: With dead ends: 271 [2018-01-31 08:42:55,488 INFO L226 Difference]: Without dead ends: 160 [2018-01-31 08:42:55,489 INFO L554 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-31 08:42:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-31 08:42:55,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-01-31 08:42:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-31 08:42:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2018-01-31 08:42:55,501 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 69 [2018-01-31 08:42:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:55,501 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2018-01-31 08:42:55,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:42:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2018-01-31 08:42:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-31 08:42:55,506 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:55,506 INFO L351 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-31 08:42:55,506 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-31 08:42:55,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1251214339, now seen corresponding path program 2 times [2018-01-31 08:42:55,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:55,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:55,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:55,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:55,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:55,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:55,957 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-31 08:42:55,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:55,958 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-31 08:42:55,963 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:42:55,980 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:55,985 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:55,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:56,162 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-31 08:42:56,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:42:56,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2018-01-31 08:42:56,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:42:56,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:42:56,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:42:56,188 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand 17 states. [2018-01-31 08:42:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:56,528 INFO L93 Difference]: Finished difference Result 306 states and 337 transitions. [2018-01-31 08:42:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:42:56,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-01-31 08:42:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:56,530 INFO L225 Difference]: With dead ends: 306 [2018-01-31 08:42:56,530 INFO L226 Difference]: Without dead ends: 192 [2018-01-31 08:42:56,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:42:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-31 08:42:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2018-01-31 08:42:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-31 08:42:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2018-01-31 08:42:56,545 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 75 [2018-01-31 08:42:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:56,545 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2018-01-31 08:42:56,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:42:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2018-01-31 08:42:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:42:56,547 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:56,547 INFO L351 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-31 08:42:56,547 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-31 08:42:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1641778756, now seen corresponding path program 1 times [2018-01-31 08:42:56,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:56,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:56,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:56,549 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:56,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:56,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:57,419 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-31 08:42:57,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:57,451 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-31 08:42:57,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:57,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:57,652 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-31 08:42:57,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:57,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-31 08:42:57,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:42:57,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:42:57,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:42:57,676 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand 29 states. [2018-01-31 08:42:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:57,913 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2018-01-31 08:42:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:42:57,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-31 08:42:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:57,916 INFO L225 Difference]: With dead ends: 281 [2018-01-31 08:42:57,916 INFO L226 Difference]: Without dead ends: 171 [2018-01-31 08:42:57,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:42:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-31 08:42:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-01-31 08:42:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-31 08:42:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-01-31 08:42:57,935 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 81 [2018-01-31 08:42:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:57,935 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-01-31 08:42:57,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:42:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-01-31 08:42:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-31 08:42:57,936 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:57,936 INFO L351 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-31 08:42:57,936 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-31 08:42:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash -784119182, now seen corresponding path program 2 times [2018-01-31 08:42:57,937 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:57,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:57,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:57,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:42:57,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:57,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:58,489 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-31 08:42:58,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:58,490 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-31 08:42:58,495 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:42:58,508 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:58,520 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:42:58,522 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:58,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:58,766 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-31 08:42:58,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:58,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-31 08:42:58,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:42:58,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:42:58,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:42:58,787 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 33 states. [2018-01-31 08:42:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:42:59,287 INFO L93 Difference]: Finished difference Result 287 states and 314 transitions. [2018-01-31 08:42:59,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:42:59,288 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-01-31 08:42:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:42:59,290 INFO L225 Difference]: With dead ends: 287 [2018-01-31 08:42:59,290 INFO L226 Difference]: Without dead ends: 177 [2018-01-31 08:42:59,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:42:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-31 08:42:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2018-01-31 08:42:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-31 08:42:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-01-31 08:42:59,301 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 87 [2018-01-31 08:42:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:42:59,302 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-01-31 08:42:59,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:42:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-01-31 08:42:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-31 08:42:59,304 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:42:59,304 INFO L351 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-31 08:42:59,304 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-31 08:42:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1819393368, now seen corresponding path program 3 times [2018-01-31 08:42:59,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:42:59,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:42:59,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:59,306 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:42:59,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:42:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:42:59,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:42:59,652 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-31 08:42:59,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:42:59,653 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-31 08:42:59,659 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:42:59,673 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:42:59,679 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:42:59,688 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:42:59,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:42:59,712 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-31 08:42:59,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:59,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:42:59,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:42:59,928 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-31 08:42:59,936 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-31 08:42:59,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:42:59,939 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-31 08:42:59,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-31 08:42:59,960 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-31 08:42:59,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:42:59,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2018-01-31 08:42:59,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:42:59,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:42:59,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=586, Unknown=1, NotChecked=50, Total=756 [2018-01-31 08:42:59,980 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 28 states. [2018-01-31 08:43:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:01,311 INFO L93 Difference]: Finished difference Result 317 states and 352 transitions. [2018-01-31 08:43:01,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-31 08:43:01,312 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-01-31 08:43:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:01,314 INFO L225 Difference]: With dead ends: 317 [2018-01-31 08:43:01,314 INFO L226 Difference]: Without dead ends: 207 [2018-01-31 08:43:01,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=719, Invalid=2943, Unknown=2, NotChecked=118, Total=3782 [2018-01-31 08:43:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-31 08:43:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2018-01-31 08:43:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-31 08:43:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-01-31 08:43:01,329 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 93 [2018-01-31 08:43:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:01,329 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-01-31 08:43:01,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:43:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-01-31 08:43:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-31 08:43:01,331 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:01,331 INFO L351 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-31 08:43:01,331 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-31 08:43:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash 676313695, now seen corresponding path program 1 times [2018-01-31 08:43:01,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:01,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:01,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:01,332 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:43:01,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:01,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:01,924 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-31 08:43:01,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:43:01,924 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-31 08:43:01,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:01,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:43:02,206 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-31 08:43:02,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:43:02,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-31 08:43:02,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 08:43:02,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 08:43:02,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:43:02,228 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 41 states. [2018-01-31 08:43:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:43:03,105 INFO L93 Difference]: Finished difference Result 311 states and 344 transitions. [2018-01-31 08:43:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-31 08:43:03,106 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-31 08:43:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:43:03,108 INFO L225 Difference]: With dead ends: 311 [2018-01-31 08:43:03,108 INFO L226 Difference]: Without dead ends: 195 [2018-01-31 08:43:03,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 08:43:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-31 08:43:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-01-31 08:43:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-31 08:43:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2018-01-31 08:43:03,124 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 99 [2018-01-31 08:43:03,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:43:03,125 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2018-01-31 08:43:03,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 08:43:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2018-01-31 08:43:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-31 08:43:03,126 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:43:03,126 INFO L351 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-31 08:43:03,126 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-31 08:43:03,127 INFO L82 PathProgramCache]: Analyzing trace with hash 160043413, now seen corresponding path program 2 times [2018-01-31 08:43:03,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:43:03,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:43:03,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:03,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:43:03,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:43:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:43:03,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:43:04,582 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-31 08:43:04,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:43:04,582 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-31 08:43:04,588 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:43:04,604 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:43:04,619 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:43:04,622 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:43:04,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:43:04,647 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-31 08:43:04,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:04,679 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-31 08:43:04,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:04,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 22 treesize of output 21 [2018-01-31 08:43:04,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:04,694 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-31 08:43:04,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:04,707 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-31 08:43:04,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-31 08:43:07,333 WARN L143 SmtUtils]: Spent 321ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:43:07,872 WARN L143 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:43:08,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:43:08,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:43:08,602 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-31 08:43:08,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:08,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:43:08,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:43:08,677 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-31 08:43:08,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:08,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:43:08,717 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-31 08:43:08,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:08,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:43:08,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:43:08,764 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-31 08:43:08,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:43:08,802 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-31 08:43:08,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-31 08:43:09,010 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-31 08:43:09,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:43:09,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 54 [2018-01-31 08:43:09,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-31 08:43:09,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-31 08:43:09,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2744, Unknown=3, NotChecked=0, Total=2970 [2018-01-31 08:43:09,032 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand 55 states. [2018-01-31 08:43:11,289 WARN L146 SmtUtils]: Spent 2070ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-01-31 08:43:20,277 WARN L146 SmtUtils]: Spent 8896ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-01-31 08:43:20,548 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-31 08:43:24,647 WARN L146 SmtUtils]: Spent 4052ms on a formula simplification. DAG size of input: 60 DAG size of output 53 [2018-01-31 08:43:26,776 WARN L146 SmtUtils]: Spent 2062ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-01-31 08:43:27,471 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 77 DAG size of output 64 [2018-01-31 08:43:29,902 WARN L146 SmtUtils]: Spent 2068ms on a formula simplification. DAG size of input: 71 DAG size of output 65 [2018-01-31 08:43:30,077 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-01-31 08:43:30,271 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 83 DAG size of output 75 [2018-01-31 08:43:32,688 WARN L146 SmtUtils]: Spent 2073ms on a formula simplification. DAG size of input: 72 DAG size of output 66 [2018-01-31 08:43:35,164 WARN L146 SmtUtils]: Spent 2083ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-31 08:43:36,274 WARN L146 SmtUtils]: Spent 467ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:43:37,740 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-31 08:43:38,054 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-31 08:43:40,402 WARN L146 SmtUtils]: Spent 2094ms on a formula simplification. DAG size of input: 78 DAG size of output 72 [2018-01-31 08:44:17,566 WARN L146 SmtUtils]: Spent 28629ms on a formula simplification. DAG size of input: 82 DAG size of output 79 [2018-01-31 08:44:46,800 WARN L146 SmtUtils]: Spent 29115ms on a formula simplification. DAG size of input: 86 DAG size of output 83 [2018-01-31 08:44:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:47,664 INFO L93 Difference]: Finished difference Result 296 states and 323 transitions. [2018-01-31 08:44:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-31 08:44:47,664 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2018-01-31 08:44:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:47,665 INFO L225 Difference]: With dead ends: 296 [2018-01-31 08:44:47,665 INFO L226 Difference]: Without dead ends: 294 [2018-01-31 08:44:47,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3121 ImplicationChecksByTransitivity, 95.4s TimeCoverageRelationStatistics Valid=1498, Invalid=11152, Unknown=6, NotChecked=0, Total=12656 [2018-01-31 08:44:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-31 08:44:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 195. [2018-01-31 08:44:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-31 08:44:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2018-01-31 08:44:47,697 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 105 [2018-01-31 08:44:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:47,698 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2018-01-31 08:44:47,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-31 08:44:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2018-01-31 08:44:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-31 08:44:47,698 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:47,698 INFO L351 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-31 08:44:47,699 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-31 08:44:47,699 INFO L82 PathProgramCache]: Analyzing trace with hash 18432984, now seen corresponding path program 1 times [2018-01-31 08:44:47,699 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:47,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:47,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:47,700 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:44:47,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:47,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:47,847 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-31 08:44:47,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:44:47,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:44:47,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:44:47,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:44:47,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:44:47,848 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand 4 states. [2018-01-31 08:44:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:44:47,919 INFO L93 Difference]: Finished difference Result 253 states and 273 transitions. [2018-01-31 08:44:47,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:44:47,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-31 08:44:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:44:47,920 INFO L225 Difference]: With dead ends: 253 [2018-01-31 08:44:47,921 INFO L226 Difference]: Without dead ends: 205 [2018-01-31 08:44:47,921 INFO L554 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-31 08:44:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-31 08:44:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 198. [2018-01-31 08:44:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-31 08:44:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-01-31 08:44:47,950 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 107 [2018-01-31 08:44:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:44:47,951 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-01-31 08:44:47,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:44:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-01-31 08:44:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-31 08:44:47,954 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:44:47,954 INFO L351 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-31 08:44:47,954 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-31 08:44:47,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1617005259, now seen corresponding path program 1 times [2018-01-31 08:44:47,954 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:44:47,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:44:47,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:47,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:47,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:44:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:47,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:44:48,484 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-31 08:44:48,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:44:48,484 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-31 08:44:48,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:44:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:44:48,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:44:48,528 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-31 08:44:48,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:48,538 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-31 08:44:48,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:44:48,547 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-31 08:44:48,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-31 08:44:54,385 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-31 08:44:54,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:44:54,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 47 [2018-01-31 08:44:54,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-31 08:44:54,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-31 08:44:54,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2051, Unknown=1, NotChecked=0, Total=2256 [2018-01-31 08:44:54,406 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 48 states. [2018-01-31 08:45:02,926 WARN L143 SmtUtils]: Spent 4025ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:45:05,181 WARN L146 SmtUtils]: Spent 2053ms on a formula simplification. DAG size of input: 48 DAG size of output 39 Received shutdown request... [2018-01-31 08:45:09,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:45:09,234 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:45:09,240 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:45:09,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:45:09 BoogieIcfgContainer [2018-01-31 08:45:09,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:45:09,241 INFO L168 Benchmark]: Toolchain (without parser) took 154133.62 ms. Allocated memory was 304.6 MB in the beginning and 612.9 MB in the end (delta: 308.3 MB). Free memory was 261.3 MB in the beginning and 496.6 MB in the end (delta: -235.2 MB). Peak memory consumption was 73.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:45:09,242 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 304.6 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:45:09,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.31 ms. Allocated memory is still 304.6 MB. Free memory was 261.3 MB in the beginning and 247.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:45:09,242 INFO L168 Benchmark]: Boogie Preprocessor took 40.85 ms. Allocated memory is still 304.6 MB. Free memory was 247.4 MB in the beginning and 245.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:45:09,243 INFO L168 Benchmark]: RCFGBuilder took 709.53 ms. Allocated memory is still 304.6 MB. Free memory was 245.4 MB in the beginning and 220.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:45:09,243 INFO L168 Benchmark]: TraceAbstraction took 153020.27 ms. Allocated memory was 304.6 MB in the beginning and 612.9 MB in the end (delta: 308.3 MB). Free memory was 220.4 MB in the beginning and 496.6 MB in the end (delta: -276.2 MB). Peak memory consumption was 32.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:45:09,245 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 304.6 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 349.31 ms. Allocated memory is still 304.6 MB. Free memory was 261.3 MB in the beginning and 247.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.85 ms. Allocated memory is still 304.6 MB. Free memory was 247.4 MB in the beginning and 245.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 709.53 ms. Allocated memory is still 304.6 MB. Free memory was 245.4 MB in the beginning and 220.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 153020.27 ms. Allocated memory was 304.6 MB in the beginning and 612.9 MB in the end (delta: 308.3 MB). Free memory was 220.4 MB in the beginning and 496.6 MB in the end (delta: -276.2 MB). Peak memory consumption was 32.1 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 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 11 states, 48 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 101 locations, 17 error locations. TIMEOUT Result, 152.9s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 127.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1764 SDtfs, 1875 SDslu, 14264 SDs, 0 SdLazy, 6584 SolverSat, 355 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1293 GetRequests, 712 SyntacticMatches, 5 SemanticMatches, 576 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7893 ImplicationChecksByTransitivity, 129.7s 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.6s SatisfiabilityAnalysisTime, 23.5s 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-31_08-45-09-253.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-31_08-45-09-253.csv Completed graceful shutdown