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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:41:55,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:41:55,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:41:55,418 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:41:55,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:41:55,418 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:41:55,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:41:55,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:41:55,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:41:55,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:41:55,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:41:55,423 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:41:55,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:41:55,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:41:55,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:41:55,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:41:55,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:41:55,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:41:55,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:41:55,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:41:55,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:41:55,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:41:55,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:41:55,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:41:55,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:41:55,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:41:55,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:41:55,436 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:41:55,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:41:55,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:41:55,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:41:55,437 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:41:55,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:41:55,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:41:55,446 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:41:55,446 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:41:55,447 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:41:55,447 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:41:55,447 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:41:55,447 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:41:55,447 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:41:55,447 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:41:55,447 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:41:55,447 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:41:55,448 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:41:55,448 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:41:55,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:41:55,448 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:41:55,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:41:55,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:41:55,448 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:41:55,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:41:55,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:41:55,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:41:55,449 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:41:55,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:41:55,449 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:41:55,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:41:55,481 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:41:55,483 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:41:55,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:41:55,484 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:41:55,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i [2018-02-04 00:41:55,616 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:41:55,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:41:55,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:41:55,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:41:55,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:41:55,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581e1694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55, skipping insertion in model container [2018-02-04 00:41:55,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,633 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:41:55,665 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:41:55,745 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:41:55,759 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:41:55,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55 WrapperNode [2018-02-04 00:41:55,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:41:55,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:41:55,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:41:55,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:41:55,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (1/1) ... [2018-02-04 00:41:55,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:41:55,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:41:55,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:41:55,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:41:55,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 00:41:55,821 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:41:55,821 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:41:55,821 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:41:55,821 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-02-04 00:41:55,822 INFO L136 BoogieDeclarations]: Found implementation of procedure free_10 [2018-02-04 00:41:55,822 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:41:55,822 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:41:55,822 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:41:55,822 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:41:55,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:41:55,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:41:55,822 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:41:55,822 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure free_10 [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:41:55,823 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:41:56,038 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:41:56,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:41:56 BoogieIcfgContainer [2018-02-04 00:41:56,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:41:56,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:41:56,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:41:56,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:41:56,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:41:55" (1/3) ... [2018-02-04 00:41:56,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a33f67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:41:56, skipping insertion in model container [2018-02-04 00:41:56,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:41:55" (2/3) ... [2018-02-04 00:41:56,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a33f67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:41:56, skipping insertion in model container [2018-02-04 00:41:56,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:41:56" (3/3) ... [2018-02-04 00:41:56,045 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test10_true-valid-memsafety_true-termination.i [2018-02-04 00:41:56,049 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:41:56,053 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-02-04 00:41:56,074 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:41:56,074 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:41:56,074 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:41:56,075 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:41:56,075 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:41:56,075 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:41:56,075 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:41:56,075 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:41:56,075 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:41:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-02-04 00:41:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 00:41:56,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:56,090 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:41:56,090 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:41:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1784809794, now seen corresponding path program 1 times [2018-02-04 00:41:56,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:56,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:56,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:56,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:56,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:56,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:56,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:56,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:41:56,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:41:56,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:41:56,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:41:56,225 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2018-02-04 00:41:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:56,471 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2018-02-04 00:41:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:41:56,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 00:41:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:56,482 INFO L225 Difference]: With dead ends: 146 [2018-02-04 00:41:56,482 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 00:41:56,483 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-02-04 00:41:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 00:41:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2018-02-04 00:41:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 00:41:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-02-04 00:41:56,526 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 16 [2018-02-04 00:41:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:56,526 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-02-04 00:41:56,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:41:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-02-04 00:41:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 00:41:56,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:56,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:41:56,528 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:41:56,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1808064800, now seen corresponding path program 1 times [2018-02-04 00:41:56,529 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:56,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:56,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:56,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:56,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:56,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:56,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:41:56,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:41:56,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:41:56,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:41:56,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:41:56,592 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 6 states. [2018-02-04 00:41:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:56,711 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2018-02-04 00:41:56,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:41:56,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 00:41:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:56,713 INFO L225 Difference]: With dead ends: 146 [2018-02-04 00:41:56,713 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 00:41:56,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:41:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 00:41:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2018-02-04 00:41:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 00:41:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-04 00:41:56,722 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 18 [2018-02-04 00:41:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:56,722 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-04 00:41:56,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:41:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-04 00:41:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:41:56,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:56,723 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:41:56,723 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:41:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1556713239, now seen corresponding path program 1 times [2018-02-04 00:41:56,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:56,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:56,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:56,725 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:56,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:56,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:41:56,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:56,779 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:41:56,793 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:56,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:56,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:41:56,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-04 00:41:56,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:41:56,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:41:56,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:41:56,860 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 5 states. [2018-02-04 00:41:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:56,895 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-02-04 00:41:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:41:56,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 00:41:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:56,897 INFO L225 Difference]: With dead ends: 99 [2018-02-04 00:41:56,897 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 00:41:56,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:41:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 00:41:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 00:41:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 00:41:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-02-04 00:41:56,903 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 19 [2018-02-04 00:41:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:56,903 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-02-04 00:41:56,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:41:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-02-04 00:41:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 00:41:56,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:56,904 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:41:56,905 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:41:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash 256564149, now seen corresponding path program 1 times [2018-02-04 00:41:56,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:56,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:56,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:56,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:56,907 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:56,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:56,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:56,972 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:41:56,980 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:56,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:57,017 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-02-04 00:41:57,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:57,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:57,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:41:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:57,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:41:57,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 00:41:57,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:41:57,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:41:57,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:41:57,062 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 7 states. [2018-02-04 00:41:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:57,328 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-04 00:41:57,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:41:57,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 00:41:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:57,330 INFO L225 Difference]: With dead ends: 114 [2018-02-04 00:41:57,330 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 00:41:57,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:41:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 00:41:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-02-04 00:41:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 00:41:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-02-04 00:41:57,340 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 21 [2018-02-04 00:41:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:57,341 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-02-04 00:41:57,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:41:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-02-04 00:41:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 00:41:57,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:57,341 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:41:57,342 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:41:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash 256564150, now seen corresponding path program 1 times [2018-02-04 00:41:57,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:57,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:57,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:57,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:57,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:57,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:57,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:57,576 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:41:57,588 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:57,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:57,621 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-02-04 00:41:57,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:57,644 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-02-04 00:41:57,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:57,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:41:57,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 00:41:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:57,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:41:57,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-02-04 00:41:57,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:41:57,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:41:57,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:41:57,760 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 13 states. [2018-02-04 00:41:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:58,167 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-02-04 00:41:58,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:41:58,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-02-04 00:41:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:58,169 INFO L225 Difference]: With dead ends: 144 [2018-02-04 00:41:58,169 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 00:41:58,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:41:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 00:41:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-02-04 00:41:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 00:41:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2018-02-04 00:41:58,177 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 21 [2018-02-04 00:41:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:58,177 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2018-02-04 00:41:58,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:41:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2018-02-04 00:41:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:41:58,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:58,178 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:41:58,178 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:41:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1653900695, now seen corresponding path program 1 times [2018-02-04 00:41:58,179 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:58,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:58,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:58,180 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:58,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:58,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:58,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:58,253 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:41:58,258 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:58,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:58,274 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-02-04 00:41:58,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:58,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:41:58,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:41:58,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:58,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:58,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 00:41:58,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:58,325 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-02-04 00:41:58,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 00:41:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:58,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:41:58,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 00:41:58,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:41:58,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:41:58,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:41:58,356 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand 11 states. [2018-02-04 00:41:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:41:58,688 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2018-02-04 00:41:58,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:41:58,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 00:41:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:41:58,690 INFO L225 Difference]: With dead ends: 139 [2018-02-04 00:41:58,690 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 00:41:58,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:41:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 00:41:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 122. [2018-02-04 00:41:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 00:41:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2018-02-04 00:41:58,699 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 23 [2018-02-04 00:41:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:41:58,699 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2018-02-04 00:41:58,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:41:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2018-02-04 00:41:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:41:58,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:41:58,700 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:41:58,700 INFO L371 AbstractCegarLoop]: === Iteration 7 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:41:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1653900696, now seen corresponding path program 1 times [2018-02-04 00:41:58,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:41:58,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:41:58,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:58,702 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:58,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:41:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:58,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:41:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:58,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:41:58,900 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:41:58,905 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:41:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:41:58,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:41:58,929 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-02-04 00:41:58,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:58,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 00:41:58,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:58,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 00:41:58,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:58,958 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-02-04 00:41:58,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:58,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:41:58,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:41:59,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:59,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:41:59,136 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 11 treesize of output 4 [2018-02-04 00:41:59,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:59,142 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 12 treesize of output 15 [2018-02-04 00:41:59,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:41:59,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:41:59,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 00:41:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:41:59,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:41:59,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 00:41:59,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:41:59,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:41:59,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=291, Unknown=1, NotChecked=0, Total=342 [2018-02-04 00:41:59,186 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand 19 states. [2018-02-04 00:42:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:00,134 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2018-02-04 00:42:00,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:42:00,134 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 00:42:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:00,135 INFO L225 Difference]: With dead ends: 162 [2018-02-04 00:42:00,135 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 00:42:00,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=545, Unknown=5, NotChecked=0, Total=650 [2018-02-04 00:42:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 00:42:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 88. [2018-02-04 00:42:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:42:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-02-04 00:42:00,139 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 23 [2018-02-04 00:42:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:00,140 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-02-04 00:42:00,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:42:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-02-04 00:42:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:42:00,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:00,140 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] [2018-02-04 00:42:00,140 INFO L371 AbstractCegarLoop]: === Iteration 8 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1058360171, now seen corresponding path program 1 times [2018-02-04 00:42:00,140 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:00,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:00,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:00,141 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:00,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:00,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:42:00,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:00,235 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:42:00,247 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:00,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:42:00,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:00,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-02-04 00:42:00,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:42:00,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:42:00,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=143, Unknown=10, NotChecked=0, Total=182 [2018-02-04 00:42:00,415 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 14 states. [2018-02-04 00:42:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:00,915 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-02-04 00:42:00,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:42:00,915 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-02-04 00:42:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:00,916 INFO L225 Difference]: With dead ends: 119 [2018-02-04 00:42:00,916 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 00:42:00,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=309, Unknown=10, NotChecked=0, Total=380 [2018-02-04 00:42:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 00:42:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2018-02-04 00:42:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 00:42:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-02-04 00:42:00,921 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 28 [2018-02-04 00:42:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:00,921 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-02-04 00:42:00,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:42:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-02-04 00:42:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:42:00,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:00,922 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 00:42:00,923 INFO L371 AbstractCegarLoop]: === Iteration 9 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1290461367, now seen corresponding path program 1 times [2018-02-04 00:42:00,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:00,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:00,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:00,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:00,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:00,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:42:00,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:42:00,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:42:00,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:42:00,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:42:00,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:42:00,962 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 7 states. [2018-02-04 00:42:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:01,012 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-02-04 00:42:01,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:42:01,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 00:42:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:01,013 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:42:01,013 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:42:01,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:42:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:42:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-02-04 00:42:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:42:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-02-04 00:42:01,016 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 30 [2018-02-04 00:42:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:01,017 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-02-04 00:42:01,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:42:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-02-04 00:42:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:42:01,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:01,017 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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-02-04 00:42:01,017 INFO L371 AbstractCegarLoop]: === Iteration 10 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1396904661, now seen corresponding path program 1 times [2018-02-04 00:42:01,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:01,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:01,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:01,019 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:01,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:01,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 00:42:01,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:01,407 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:42:01,412 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:01,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:01,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:01,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:42:01,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:01,517 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 8 treesize of output 7 [2018-02-04 00:42:01,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-04 00:42:01,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:42:01,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 00:42:01,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:42:01,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 00:42:01,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-02-04 00:42:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:42:01,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:42:01,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-02-04 00:42:01,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:42:01,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:42:01,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:42:01,575 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 6 states. [2018-02-04 00:42:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:01,641 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 00:42:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:42:01,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 00:42:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:01,642 INFO L225 Difference]: With dead ends: 91 [2018-02-04 00:42:01,642 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 00:42:01,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:42:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 00:42:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 00:42:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:42:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-04 00:42:01,646 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 31 [2018-02-04 00:42:01,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:01,646 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-04 00:42:01,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:42:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-04 00:42:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 00:42:01,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:01,647 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:42:01,647 INFO L371 AbstractCegarLoop]: === Iteration 11 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1532156787, now seen corresponding path program 2 times [2018-02-04 00:42:01,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:01,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:01,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:01,648 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:01,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:01,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:42:01,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:01,698 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:42:01,705 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:42:01,727 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:42:01,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:42:01,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:01,733 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-02-04 00:42:01,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:42:01,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:01,742 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 8 treesize of output 7 [2018-02-04 00:42:01,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 00:42:01,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 00:42:01,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 5 [2018-02-04 00:42:01,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:01,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 00:42:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:42:01,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:01,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-02-04 00:42:01,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:42:01,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:42:01,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:42:01,792 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 8 states. [2018-02-04 00:42:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:02,178 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-04 00:42:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:42:02,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 00:42:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:02,179 INFO L225 Difference]: With dead ends: 95 [2018-02-04 00:42:02,179 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 00:42:02,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:42:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 00:42:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-04 00:42:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:42:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-04 00:42:02,184 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 33 [2018-02-04 00:42:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:02,184 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-04 00:42:02,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:42:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-04 00:42:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 00:42:02,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:02,186 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:42:02,186 INFO L371 AbstractCegarLoop]: === Iteration 12 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1532156786, now seen corresponding path program 1 times [2018-02-04 00:42:02,186 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:02,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:02,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:02,188 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:42:02,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:02,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 00:42:02,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:02,591 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:42:02,600 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:02,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:02,648 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-02-04 00:42:02,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,663 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-02-04 00:42:02,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,677 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-02-04 00:42:02,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,680 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-02-04 00:42:02,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:42:02,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-02-04 00:42:02,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:02,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:02,911 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 11 treesize of output 4 [2018-02-04 00:42:02,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,918 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 12 treesize of output 15 [2018-02-04 00:42:02,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 00:42:02,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:02,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:42:02,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:02,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:42:02,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:02,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-02-04 00:42:03,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 00:42:03,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 00:42:03,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:42:03,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 00:42:03,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:03,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:23 [2018-02-04 00:42:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:42:03,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:03,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 20 [2018-02-04 00:42:03,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:42:03,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:42:03,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:42:03,088 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 21 states. [2018-02-04 00:42:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:03,697 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-04 00:42:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 00:42:03,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-02-04 00:42:03,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:03,698 INFO L225 Difference]: With dead ends: 105 [2018-02-04 00:42:03,698 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 00:42:03,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-04 00:42:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 00:42:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2018-02-04 00:42:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 00:42:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-04 00:42:03,701 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 33 [2018-02-04 00:42:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:03,701 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-04 00:42:03,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:42:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-04 00:42:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:42:03,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:03,702 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:42:03,702 INFO L371 AbstractCegarLoop]: === Iteration 13 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash 679924719, now seen corresponding path program 1 times [2018-02-04 00:42:03,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:03,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:03,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:03,703 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:03,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:03,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:42:03,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:03,792 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:42:03,797 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:03,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:03,816 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-02-04 00:42:03,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:42:03,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:03,851 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 8 treesize of output 7 [2018-02-04 00:42:03,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 00:42:03,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 00:42:03,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 5 [2018-02-04 00:42:03,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 00:42:03,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:03,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:03,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 00:42:03,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:03,894 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-02-04 00:42:03,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 00:42:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:42:03,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:03,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 00:42:03,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:42:03,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:42:03,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:42:03,922 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 12 states. [2018-02-04 00:42:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:04,171 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 00:42:04,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:42:04,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-04 00:42:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:04,172 INFO L225 Difference]: With dead ends: 93 [2018-02-04 00:42:04,172 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 00:42:04,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:42:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 00:42:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-02-04 00:42:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 00:42:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-02-04 00:42:04,175 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 35 [2018-02-04 00:42:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:04,175 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-02-04 00:42:04,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:42:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-02-04 00:42:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 00:42:04,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:04,176 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:04,176 INFO L371 AbstractCegarLoop]: === Iteration 14 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1865347170, now seen corresponding path program 1 times [2018-02-04 00:42:04,176 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:04,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:04,177 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:04,177 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:04,177 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:04,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:42:04,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:04,289 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 00:42:04,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:04,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:04,308 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-02-04 00:42:04,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:04,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:04,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:42:04,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:04,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:04,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 00:42:04,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:04,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:04,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 00:42:04,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:04,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:42:04,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:04,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:04,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:04,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-02-04 00:42:04,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 00:42:04,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:04,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:04,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:12 [2018-02-04 00:42:08,406 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-04 00:42:08,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-04 00:42:08,434 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 12 treesize of output 11 [2018-02-04 00:42:08,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:08,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:08,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:08,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-02-04 00:42:08,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 00:42:08,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 00:42:08,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:08,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:08,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:08,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2018-02-04 00:42:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:42:08,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:08,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-02-04 00:42:08,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:42:08,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:42:08,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2018-02-04 00:42:08,487 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 21 states. [2018-02-04 00:42:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:51,710 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-02-04 00:42:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:42:51,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-02-04 00:42:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:51,711 INFO L225 Difference]: With dead ends: 99 [2018-02-04 00:42:51,711 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 00:42:51,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=83, Invalid=468, Unknown=1, NotChecked=0, Total=552 [2018-02-04 00:42:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 00:42:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2018-02-04 00:42:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 00:42:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-02-04 00:42:51,714 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 36 [2018-02-04 00:42:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:51,714 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-02-04 00:42:51,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:42:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-02-04 00:42:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 00:42:51,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:51,715 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:51,715 INFO L371 AbstractCegarLoop]: === Iteration 15 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1865347169, now seen corresponding path program 1 times [2018-02-04 00:42:51,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:51,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:51,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:51,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:51,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:51,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:42:51,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:51,828 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:42:51,833 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:51,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:51,847 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-02-04 00:42:51,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:51,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:51,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:42:51,857 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-02-04 00:42:51,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:51,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 00:42:51,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:51,878 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-02-04 00:42:51,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:46 [2018-02-04 00:42:51,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:51,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:51,938 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 26 treesize of output 20 [2018-02-04 00:42:51,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:51,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:51,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:51,953 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 28 treesize of output 22 [2018-02-04 00:42:51,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:51,965 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-02-04 00:42:51,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:43 [2018-02-04 00:42:52,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-02-04 00:42:52,007 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 8 treesize of output 7 [2018-02-04 00:42:52,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-02-04 00:42:52,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:42:52,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-02-04 00:42:52,058 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 8 treesize of output 7 [2018-02-04 00:42:52,058 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-02-04 00:42:52,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:42:52,079 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,084 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:42:52,096 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:67 [2018-02-04 00:42:52,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-02-04 00:42:52,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-02-04 00:42:52,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 00:42:52,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:73, output treesize:39 [2018-02-04 00:42:52,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2018-02-04 00:42:52,286 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 12 treesize of output 11 [2018-02-04 00:42:52,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-02-04 00:42:52,357 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 12 treesize of output 11 [2018-02-04 00:42:52,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:52,373 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:171, output treesize:41 [2018-02-04 00:42:52,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-02-04 00:42:52,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-02-04 00:42:52,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:42:52,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 00:42:52,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:52,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:52,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:21 [2018-02-04 00:42:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:42:52,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:52,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-02-04 00:42:52,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:42:52,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:42:52,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:42:52,480 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 22 states. [2018-02-04 00:42:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:53,234 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-02-04 00:42:53,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:42:53,235 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-02-04 00:42:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:53,235 INFO L225 Difference]: With dead ends: 116 [2018-02-04 00:42:53,235 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 00:42:53,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 00:42:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 00:42:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2018-02-04 00:42:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 00:42:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-02-04 00:42:53,238 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 36 [2018-02-04 00:42:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:53,238 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-02-04 00:42:53,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:42:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-02-04 00:42:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:42:53,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:53,238 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:53,238 INFO L371 AbstractCegarLoop]: === Iteration 16 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1669557913, now seen corresponding path program 1 times [2018-02-04 00:42:53,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:53,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:53,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:53,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:53,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:53,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:42:53,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:42:53,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:42:53,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:42:53,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:42:53,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:42:53,272 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-02-04 00:42:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:53,342 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-02-04 00:42:53,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:42:53,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-04 00:42:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:53,343 INFO L225 Difference]: With dead ends: 94 [2018-02-04 00:42:53,343 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 00:42:53,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:42:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 00:42:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-02-04 00:42:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 00:42:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-02-04 00:42:53,345 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 40 [2018-02-04 00:42:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:53,345 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-02-04 00:42:53,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:42:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-02-04 00:42:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:42:53,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:53,346 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:53,346 INFO L371 AbstractCegarLoop]: === Iteration 17 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:53,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1669557912, now seen corresponding path program 1 times [2018-02-04 00:42:53,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:53,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:53,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:53,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:53,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:53,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 00:42:53,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:53,418 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:42:53,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:53,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:42:53,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:42:53,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-02-04 00:42:53,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:42:53,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:42:53,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:42:53,522 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 13 states. [2018-02-04 00:42:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:53,687 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-02-04 00:42:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:42:53,687 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-02-04 00:42:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:53,687 INFO L225 Difference]: With dead ends: 95 [2018-02-04 00:42:53,687 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 00:42:53,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:42:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 00:42:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-02-04 00:42:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:42:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-04 00:42:53,695 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-02-04 00:42:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:53,695 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-04 00:42:53,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:42:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-04 00:42:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 00:42:53,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:53,696 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:53,696 INFO L371 AbstractCegarLoop]: === Iteration 18 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2024350646, now seen corresponding path program 1 times [2018-02-04 00:42:53,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:53,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:53,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:53,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:53,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:53,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:42:53,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:53,837 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:42:53,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:53,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:53,875 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-02-04 00:42:53,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:42:53,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:53,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:53,896 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 11 treesize of output 4 [2018-02-04 00:42:53,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 00:42:53,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:53,908 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 8 treesize of output 7 [2018-02-04 00:42:53,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:53,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:42:53,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-04 00:42:53,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-02-04 00:42:53,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 00:42:53,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-02-04 00:42:53,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 00:42:53,980 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 8 treesize of output 7 [2018-02-04 00:42:53,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-02-04 00:42:53,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:42:53,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 00:42:53,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:53,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 00:42:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:42:54,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:54,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 14 [2018-02-04 00:42:54,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:42:54,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:42:54,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:42:54,012 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 15 states. [2018-02-04 00:42:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:54,315 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-02-04 00:42:54,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:42:54,315 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-02-04 00:42:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:54,316 INFO L225 Difference]: With dead ends: 106 [2018-02-04 00:42:54,316 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 00:42:54,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2018-02-04 00:42:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 00:42:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2018-02-04 00:42:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 00:42:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-02-04 00:42:54,318 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 39 [2018-02-04 00:42:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:54,318 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-02-04 00:42:54,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:42:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-02-04 00:42:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 00:42:54,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:54,319 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:54,319 INFO L371 AbstractCegarLoop]: === Iteration 19 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2024350647, now seen corresponding path program 1 times [2018-02-04 00:42:54,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:54,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:54,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:54,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:54,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:54,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:42:54,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:42:54,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:42:54,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:42:54,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:42:54,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:42:54,341 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2018-02-04 00:42:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:54,397 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-02-04 00:42:54,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:42:54,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 00:42:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:54,397 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:42:54,397 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:42:54,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:42:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:42:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 00:42:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 00:42:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-02-04 00:42:54,399 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 39 [2018-02-04 00:42:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:54,399 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-02-04 00:42:54,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:42:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-02-04 00:42:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:42:54,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:54,400 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:54,400 INFO L371 AbstractCegarLoop]: === Iteration 20 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash -216687777, now seen corresponding path program 1 times [2018-02-04 00:42:54,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:54,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:54,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:54,401 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:54,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:54,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:42:54,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:42:54,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:42:54,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:42:54,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:42:54,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:42:54,442 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 7 states. [2018-02-04 00:42:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:54,519 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-02-04 00:42:54,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:42:54,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 00:42:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:54,520 INFO L225 Difference]: With dead ends: 85 [2018-02-04 00:42:54,520 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 00:42:54,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:42:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 00:42:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 00:42:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 00:42:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-02-04 00:42:54,522 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 41 [2018-02-04 00:42:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:54,523 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-02-04 00:42:54,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:42:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-02-04 00:42:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:42:54,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:54,523 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:54,523 INFO L371 AbstractCegarLoop]: === Iteration 21 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash -216687776, now seen corresponding path program 1 times [2018-02-04 00:42:54,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:54,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:54,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:54,525 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:54,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:54,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:42:54,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:54,693 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:42:54,698 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:54,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:54,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 00:42:54,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 11 [2018-02-04 00:42:54,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:54,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:54,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-02-04 00:42:54,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 11 [2018-02-04 00:42:54,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:54,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:54,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:54,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-02-04 00:42:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:42:54,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:42:54,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2018-02-04 00:42:54,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:42:54,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:42:54,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:42:54,866 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 23 states. [2018-02-04 00:42:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:55,423 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-02-04 00:42:55,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:42:55,423 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2018-02-04 00:42:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:55,423 INFO L225 Difference]: With dead ends: 101 [2018-02-04 00:42:55,423 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 00:42:55,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 00:42:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 00:42:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2018-02-04 00:42:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 00:42:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-02-04 00:42:55,426 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-02-04 00:42:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:55,426 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-02-04 00:42:55,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:42:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-02-04 00:42:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:42:55,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:55,427 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:55,427 INFO L371 AbstractCegarLoop]: === Iteration 22 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash -219212007, now seen corresponding path program 1 times [2018-02-04 00:42:55,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:55,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:55,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:55,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:55,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:55,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:42:55,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:55,592 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:42:55,600 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:55,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:55,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-02-04 00:42:55,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:42:55,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 00:42:55,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 10 [2018-02-04 00:42:55,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:55,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 4 [2018-02-04 00:42:55,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:55,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:42:55,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-02-04 00:42:55,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 00:42:55,832 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:55,833 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:55,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-02-04 00:42:55,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-02-04 00:42:55,835 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:55,836 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:55,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:42:55,839 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-02-04 00:42:55,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:55,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-02-04 00:42:55,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:55,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:55,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:10 [2018-02-04 00:42:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:42:55,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:55,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-02-04 00:42:55,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 00:42:55,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 00:42:55,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:42:55,899 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 24 states. [2018-02-04 00:42:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:42:56,451 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-02-04 00:42:56,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:42:56,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-02-04 00:42:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:42:56,452 INFO L225 Difference]: With dead ends: 100 [2018-02-04 00:42:56,452 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 00:42:56,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 00:42:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 00:42:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2018-02-04 00:42:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 00:42:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-02-04 00:42:56,454 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 41 [2018-02-04 00:42:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:42:56,455 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-02-04 00:42:56,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 00:42:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-02-04 00:42:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 00:42:56,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:42:56,455 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 00:42:56,455 INFO L371 AbstractCegarLoop]: === Iteration 23 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:42:56,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2100402388, now seen corresponding path program 1 times [2018-02-04 00:42:56,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:42:56,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:42:56,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:56,456 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:56,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:42:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:56,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:42:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 00:42:56,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:42:56,781 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:42:56,789 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:42:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:42:56,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:42:56,804 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-02-04 00:42:56,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:56,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:56,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:42:56,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:56,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:56,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:46 [2018-02-04 00:42:56,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:42:56,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:42:56,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:56,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:56,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:56,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:61 [2018-02-04 00:42:56,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:56,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2018-02-04 00:42:56,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:56,994 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:42:56,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-02-04 00:42:56,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-02-04 00:42:57,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:57,015 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:64, output treesize:27 [2018-02-04 00:42:57,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:57,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-02-04 00:42:57,111 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 12 treesize of output 11 [2018-02-04 00:42:57,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:57,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:61 [2018-02-04 00:42:57,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-02-04 00:42:57,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-02-04 00:42:57,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:57,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:49 [2018-02-04 00:42:57,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:57,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-04 00:42:57,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:42:57,232 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:42:57,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-02-04 00:42:57,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:57,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:31 [2018-02-04 00:42:57,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 00:42:57,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:42:57,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:42:57,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-04 00:42:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:42:57,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:42:57,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2018-02-04 00:42:57,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:42:57,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:42:57,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-02-04 00:42:57,386 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 25 states. [2018-02-04 00:43:05,393 WARN L143 SmtUtils]: Spent 995ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-04 00:43:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:43:12,323 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-04 00:43:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:43:12,323 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2018-02-04 00:43:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:43:12,324 INFO L225 Difference]: With dead ends: 119 [2018-02-04 00:43:12,324 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 00:43:12,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=173, Invalid=1387, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:43:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 00:43:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-02-04 00:43:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 00:43:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-02-04 00:43:12,326 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 44 [2018-02-04 00:43:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:43:12,326 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-02-04 00:43:12,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:43:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-02-04 00:43:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 00:43:12,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:43:12,327 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2018-02-04 00:43:12,327 INFO L371 AbstractCegarLoop]: === Iteration 24 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:43:12,327 INFO L82 PathProgramCache]: Analyzing trace with hash 438037872, now seen corresponding path program 1 times [2018-02-04 00:43:12,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:43:12,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:43:12,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:43:12,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:43:12,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:43:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:43:12,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:43:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:43:12,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:43:12,499 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:43:12,504 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:43:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:43:12,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:43:12,522 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-02-04 00:43:12,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:43:12,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:43:12,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:43:12,530 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 11 treesize of output 4 [2018-02-04 00:43:12,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 00:43:12,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:43:12,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:43:12,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:43:12,543 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 8 treesize of output 7 [2018-02-04 00:43:12,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:12,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:8 [2018-02-04 00:43:14,560 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~a10~0.base_BEFORE_CALL_21 Int) (v_entry_point_~a10~0.offset_BEFORE_CALL_13 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~a10~0.base_BEFORE_CALL_21) v_entry_point_~a10~0.offset_BEFORE_CALL_13) v_entry_point_~a10~0.base_BEFORE_CALL_21))) is different from true [2018-02-04 00:43:18,579 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 14 [2018-02-04 00:43:18,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-02-04 00:43:18,597 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 16 treesize of output 15 [2018-02-04 00:43:18,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-02-04 00:43:18,615 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 16 treesize of output 15 [2018-02-04 00:43:18,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2018-02-04 00:43:18,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-02-04 00:43:18,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 3 [2018-02-04 00:43:18,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 00:43:18,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:43:18,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:43:18,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 00:43:18,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:43:18,708 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:43:18,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 00:43:18,712 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,713 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:18,717 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2018-02-04 00:43:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 00:43:18,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:43:18,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 21 [2018-02-04 00:43:18,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:43:18,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:43:18,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=336, Unknown=2, NotChecked=36, Total=420 [2018-02-04 00:43:18,749 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 21 states. [2018-02-04 00:43:22,860 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-04 00:43:24,871 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 17 [2018-02-04 00:43:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:43:35,133 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-02-04 00:43:35,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:43:35,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-02-04 00:43:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:43:35,134 INFO L225 Difference]: With dead ends: 106 [2018-02-04 00:43:35,134 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 00:43:35,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=136, Invalid=918, Unknown=6, NotChecked=62, Total=1122 [2018-02-04 00:43:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 00:43:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2018-02-04 00:43:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 00:43:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-04 00:43:35,136 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 47 [2018-02-04 00:43:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:43:35,136 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-04 00:43:35,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:43:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-04 00:43:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 00:43:35,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:43:35,136 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:43:35,136 INFO L371 AbstractCegarLoop]: === Iteration 25 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:43:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1446651854, now seen corresponding path program 1 times [2018-02-04 00:43:35,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:43:35,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:43:35,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:43:35,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:43:35,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:43:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:43:35,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:43:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:43:35,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:43:35,291 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:43:35,296 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:43:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:43:35,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:43:35,313 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-02-04 00:43:35,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:43:35,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:43:35,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:43:35,328 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 11 treesize of output 4 [2018-02-04 00:43:35,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 00:43:35,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:43:35,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:43:35,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:43:35,344 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 8 treesize of output 7 [2018-02-04 00:43:35,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-04 00:43:35,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 00:43:35,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-02-04 00:43:35,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:35,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-02-04 00:43:37,369 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~a10~0.base_BEFORE_CALL_24 Int) (v_entry_point_~a10~0.offset_BEFORE_CALL_14 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~a10~0.base_BEFORE_CALL_24) v_entry_point_~a10~0.offset_BEFORE_CALL_14) v_entry_point_~a10~0.base_BEFORE_CALL_24))) is different from true [2018-02-04 00:43:41,456 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 13 [2018-02-04 00:43:45,532 WARN L143 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 13 [2018-02-04 00:43:45,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-02-04 00:43:45,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:43:45,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:45,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:45,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:45,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-02-04 00:43:45,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-02-04 00:43:45,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-02-04 00:43:45,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 00:43:45,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-04 00:43:45,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:45,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:43:45,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:43:45,604 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2018-02-04 00:43:45,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-02-04 00:43:45,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 00:43:45,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:43:45,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:45,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:43:45,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-02-04 00:43:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 00:43:45,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:43:45,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 25 [2018-02-04 00:43:45,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:43:45,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:43:45,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=497, Unknown=3, NotChecked=44, Total=600 [2018-02-04 00:43:45,661 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 25 states. [2018-02-04 00:44:01,833 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-04 00:44:05,862 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 22 [2018-02-04 00:44:09,887 WARN L143 SmtUtils]: Spent 2014ms on a formula simplification that was a NOOP. DAG size: 29 [2018-02-04 00:44:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:44:10,254 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-02-04 00:44:10,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:44:10,254 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-02-04 00:44:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:44:10,255 INFO L225 Difference]: With dead ends: 97 [2018-02-04 00:44:10,255 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 00:44:10,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=158, Invalid=1320, Unknown=8, NotChecked=74, Total=1560 [2018-02-04 00:44:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 00:44:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2018-02-04 00:44:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:44:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-02-04 00:44:10,258 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 46 [2018-02-04 00:44:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:44:10,258 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-02-04 00:44:10,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:44:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-02-04 00:44:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 00:44:10,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:44:10,258 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:44:10,258 INFO L371 AbstractCegarLoop]: === Iteration 26 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:44:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash -774502062, now seen corresponding path program 2 times [2018-02-04 00:44:10,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:44:10,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:44:10,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:44:10,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:44:10,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:44:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:44:10,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:44:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 00:44:10,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:44:10,451 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:44:10,456 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:44:10,476 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:44:10,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:44:10,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:44:10,480 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-02-04 00:44:10,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:44:10,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:44:10,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:44:10,489 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 11 treesize of output 4 [2018-02-04 00:44:10,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-04 00:44:10,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:44:10,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:44:10,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:44:10,526 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 8 treesize of output 7 [2018-02-04 00:44:10,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:10,530 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:8 [2018-02-04 00:44:12,543 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~a10~0.offset_BEFORE_CALL_15 Int) (v_entry_point_~a10~0.base_BEFORE_CALL_26 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~a10~0.base_BEFORE_CALL_26) v_entry_point_~a10~0.offset_BEFORE_CALL_15) v_entry_point_~a10~0.base_BEFORE_CALL_26))) is different from true [2018-02-04 00:44:12,546 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-02-04 00:44:12,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:12,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:44:12,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:14 [2018-02-04 00:44:16,565 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 14 [2018-02-04 00:44:20,581 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 14 [2018-02-04 00:44:20,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-02-04 00:44:20,599 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 16 treesize of output 15 [2018-02-04 00:44:20,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-02-04 00:44:20,612 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 16 treesize of output 15 [2018-02-04 00:44:20,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:26 [2018-02-04 00:44:20,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-02-04 00:44:20,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2018-02-04 00:44:20,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:44:20,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-02-04 00:44:20,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-02-04 00:44:20,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-04 00:44:20,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 5 [2018-02-04 00:44:20,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:20,705 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-02-04 00:44:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2018-02-04 00:44:20,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:44:20,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 24 [2018-02-04 00:44:20,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:44:20,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:44:20,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=496, Unknown=3, NotChecked=44, Total=600 [2018-02-04 00:44:20,726 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 25 states. [2018-02-04 00:44:40,854 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-04 00:44:46,872 WARN L143 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 18 [2018-02-04 00:44:50,890 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 23 [2018-02-04 00:44:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:44:53,202 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-02-04 00:44:53,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 00:44:53,202 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-02-04 00:44:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:44:53,203 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:44:53,203 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:44:53,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=164, Invalid=1311, Unknown=11, NotChecked=74, Total=1560 [2018-02-04 00:44:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:44:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-02-04 00:44:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 00:44:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-02-04 00:44:53,205 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 49 [2018-02-04 00:44:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:44:53,205 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-02-04 00:44:53,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:44:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-02-04 00:44:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 00:44:53,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:44:53,206 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:44:53,206 INFO L371 AbstractCegarLoop]: === Iteration 27 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 00:44:53,206 INFO L82 PathProgramCache]: Analyzing trace with hash -774502061, now seen corresponding path program 1 times [2018-02-04 00:44:53,206 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:44:53,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:44:53,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:44:53,207 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:44:53,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:44:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:44:53,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:44:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 00:44:53,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:44:53,490 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:44:53,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:44:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:44:53,518 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:44:53,534 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-02-04 00:44:53,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,545 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-02-04 00:44:53,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,555 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-02-04 00:44:53,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,557 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-02-04 00:44:53,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:44:53,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-02-04 00:44:53,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:44:53,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:44:53,748 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 11 treesize of output 4 [2018-02-04 00:44:53,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,751 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 12 treesize of output 15 [2018-02-04 00:44:53,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-04 00:44:53,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-02-04 00:44:53,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:44:53,783 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 8 treesize of output 7 [2018-02-04 00:44:53,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:44:53,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:44:53,791 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:44:53,796 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:47, output treesize:15 [2018-02-04 00:44:55,847 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~a10~0.base_BEFORE_CALL_29 Int) (v_entry_point_~a10~0.offset_BEFORE_CALL_17 Int)) (and (<= v_entry_point_~a10~0.offset_BEFORE_CALL_17 0) (<= 0 v_entry_point_~a10~0.offset_BEFORE_CALL_17) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~a10~0.base_BEFORE_CALL_29) v_entry_point_~a10~0.offset_BEFORE_CALL_17) v_entry_point_~a10~0.base_BEFORE_CALL_29)))) is different from true [2018-02-04 00:45:01,874 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 16 [2018-02-04 00:45:01,877 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 34 treesize of output 33 [2018-02-04 00:45:01,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:01,894 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 31 treesize of output 30 [2018-02-04 00:45:01,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:01,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 00:45:01,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:64 [2018-02-04 00:45:05,985 WARN L143 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-04 00:45:10,039 WARN L143 SmtUtils]: Spent 4012ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-04 00:45:10,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-02-04 00:45:10,098 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 16 treesize of output 15 [2018-02-04 00:45:10,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-02-04 00:45:10,113 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 16 treesize of output 15 [2018-02-04 00:45:10,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:47 [2018-02-04 00:45:10,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-02-04 00:45:10,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 5 [2018-02-04 00:45:10,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-04 00:45:10,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:45:10,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:45:10,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 00:45:10,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 3 [2018-02-04 00:45:10,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,307 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:45:10,311 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:77, output treesize:9 [2018-02-04 00:45:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 00:45:10,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:45:10,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 44 [2018-02-04 00:45:10,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 00:45:10,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 00:45:10,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1764, Unknown=3, NotChecked=84, Total=1980 [2018-02-04 00:45:10,356 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 45 states. Received shutdown request... [2018-02-04 00:45:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:45:30,516 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:45:30,521 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:45:30,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:45:30 BoogieIcfgContainer [2018-02-04 00:45:30,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:45:30,522 INFO L168 Benchmark]: Toolchain (without parser) took 214905.17 ms. Allocated memory was 405.8 MB in the beginning and 764.9 MB in the end (delta: 359.1 MB). Free memory was 362.6 MB in the beginning and 558.6 MB in the end (delta: -195.9 MB). Peak memory consumption was 163.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:45:30,523 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:45:30,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.51 ms. Allocated memory is still 405.8 MB. Free memory was 362.6 MB in the beginning and 349.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:45:30,524 INFO L168 Benchmark]: Boogie Preprocessor took 21.23 ms. Allocated memory is still 405.8 MB. Free memory was 349.4 MB in the beginning and 348.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:45:30,524 INFO L168 Benchmark]: RCFGBuilder took 251.56 ms. Allocated memory is still 405.8 MB. Free memory was 348.1 MB in the beginning and 319.5 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:45:30,524 INFO L168 Benchmark]: TraceAbstraction took 214482.10 ms. Allocated memory was 405.8 MB in the beginning and 764.9 MB in the end (delta: 359.1 MB). Free memory was 319.5 MB in the beginning and 558.6 MB in the end (delta: -239.1 MB). Peak memory consumption was 120.1 MB. Max. memory is 5.3 GB. [2018-02-04 00:45:30,525 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.09 ms. Allocated memory is still 405.8 MB. Free memory is still 369.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.51 ms. Allocated memory is still 405.8 MB. Free memory was 362.6 MB in the beginning and 349.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.23 ms. Allocated memory is still 405.8 MB. Free memory was 349.4 MB in the beginning and 348.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 251.56 ms. Allocated memory is still 405.8 MB. Free memory was 348.1 MB in the beginning and 319.5 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 214482.10 ms. Allocated memory was 405.8 MB in the beginning and 764.9 MB in the end (delta: 359.1 MB). Free memory was 319.5 MB in the beginning and 558.6 MB in the end (delta: -239.1 MB). Peak memory consumption was 120.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 (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1472]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1459). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1457). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1469). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1459). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1459). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1469). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1465). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1459). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 6 states, 45 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 98 locations, 39 error locations. TIMEOUT Result, 214.4s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 158.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1664 SDtfs, 1723 SDslu, 9332 SDs, 0 SdLazy, 13097 SolverSat, 605 SolverUnsat, 82 SolverUnknown, 0 SolverNotchecked, 97.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1200 GetRequests, 600 SyntacticMatches, 77 SemanticMatches, 522 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 109.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=5, 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.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 426 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 54.2s InterpolantComputationTime, 1654 NumberOfCodeBlocks, 1654 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1606 ConstructedInterpolants, 90 QuantifiedInterpolants, 507873 SizeOfPredicates, 194 NumberOfNonLiveVariables, 3269 ConjunctsInSsa, 640 ConjunctsInUnsatCore, 48 InterpolantComputations, 10 PerfectInterpolantSequences, 362/624 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-45-30-536.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-45-30-536.csv Completed graceful shutdown