java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:12:26,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:12:26,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:12:26,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:12:26,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:12:26,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:12:26,282 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:12:26,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:12:26,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:12:26,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:12:26,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:12:26,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:12:26,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:12:26,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:12:26,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:12:26,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:12:26,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:12:26,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:12:26,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:12:26,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:12:26,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:12:26,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:12:26,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:12:26,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:12:26,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:12:26,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:12:26,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:12:26,325 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:12:26,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:12:26,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:12:26,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:12:26,329 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:12:26,343 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:12:26,343 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:12:26,344 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:12:26,344 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:12:26,344 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:12:26,345 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:12:26,345 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:12:26,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:12:26,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:12:26,348 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:12:26,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:12:26,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:12:26,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:12:26,349 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:12:26,349 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:12:26,349 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:12:26,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:12:26,350 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:12:26,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:12:26,350 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:12:26,350 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:12:26,350 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:12:26,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:12:26,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:12:26,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:12:26,352 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:12:26,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:12:26,353 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:12:26,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:12:26,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:12:26,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:12:26,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:12:26,354 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:12:26,354 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:12:26,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:12:26,417 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:12:26,419 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:12:26,421 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:12:26,421 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:12:26,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-31 09:12:26,611 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:12:26,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:12:26,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:12:26,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:12:26,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:12:26,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de28e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26, skipping insertion in model container [2018-01-31 09:12:26,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,657 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:12:26,725 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:12:26,887 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:12:26,913 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:12:26,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26 WrapperNode [2018-01-31 09:12:26,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:12:26,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:12:26,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:12:26,930 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:12:26,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (1/1) ... [2018-01-31 09:12:26,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:12:26,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:12:26,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:12:26,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:12:26,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:12:27,068 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:12:27,068 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:12:27,068 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:12:27,068 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:12:27,068 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:12:27,068 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:12:27,069 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:12:27,069 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:12:27,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:12:27,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:12:27,069 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:12:27,069 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-01-31 09:12:27,069 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-01-31 09:12:27,070 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:12:27,070 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:12:27,070 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-01-31 09:12:27,070 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:12:27,070 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:12:27,070 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:12:27,071 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:12:27,397 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-31 09:12:27,616 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:12:27,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:12:27 BoogieIcfgContainer [2018-01-31 09:12:27,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:12:27,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:12:27,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:12:27,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:12:27,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:12:26" (1/3) ... [2018-01-31 09:12:27,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e23264a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:12:27, skipping insertion in model container [2018-01-31 09:12:27,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:12:26" (2/3) ... [2018-01-31 09:12:27,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e23264a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:12:27, skipping insertion in model container [2018-01-31 09:12:27,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:12:27" (3/3) ... [2018-01-31 09:12:27,626 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-31 09:12:27,635 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:12:27,643 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-31 09:12:27,705 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:12:27,706 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:12:27,706 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:12:27,706 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:12:27,706 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:12:27,706 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:12:27,707 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:12:27,707 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:12:27,708 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:12:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-01-31 09:12:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-31 09:12:27,739 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:27,740 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-31 09:12:27,740 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash 97524843, now seen corresponding path program 1 times [2018-01-31 09:12:27,747 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:27,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:27,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:27,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:27,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:27,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:27,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:12:27,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:12:27,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:12:28,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:12:28,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:28,012 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2018-01-31 09:12:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:28,402 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-01-31 09:12:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:12:28,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-31 09:12:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:28,513 INFO L225 Difference]: With dead ends: 78 [2018-01-31 09:12:28,513 INFO L226 Difference]: Without dead ends: 70 [2018-01-31 09:12:28,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-31 09:12:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-31 09:12:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 09:12:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-01-31 09:12:28,558 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 5 [2018-01-31 09:12:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:28,558 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-01-31 09:12:28,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:12:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-01-31 09:12:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-31 09:12:28,559 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:28,559 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-31 09:12:28,559 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 97524844, now seen corresponding path program 1 times [2018-01-31 09:12:28,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:28,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:28,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:28,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:28,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:28,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:28,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:12:28,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:12:28,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:12:28,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:12:28,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:28,707 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 3 states. [2018-01-31 09:12:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:28,956 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-01-31 09:12:28,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:12:28,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-31 09:12:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:28,959 INFO L225 Difference]: With dead ends: 70 [2018-01-31 09:12:28,959 INFO L226 Difference]: Without dead ends: 66 [2018-01-31 09:12:28,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-31 09:12:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-31 09:12:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 09:12:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-01-31 09:12:28,969 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 5 [2018-01-31 09:12:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:28,970 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-01-31 09:12:28,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:12:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-01-31 09:12:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:12:28,971 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:28,971 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:28,971 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:28,972 INFO L82 PathProgramCache]: Analyzing trace with hash 381660014, now seen corresponding path program 1 times [2018-01-31 09:12:28,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:28,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:28,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:28,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:28,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:29,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:29,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:12:29,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:12:29,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:12:29,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:12:29,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:29,113 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 3 states. [2018-01-31 09:12:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:29,282 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-01-31 09:12:29,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:12:29,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-31 09:12:29,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:29,285 INFO L225 Difference]: With dead ends: 66 [2018-01-31 09:12:29,285 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 09:12:29,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 09:12:29,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-31 09:12:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:12:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-01-31 09:12:29,294 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 15 [2018-01-31 09:12:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:29,295 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-01-31 09:12:29,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:12:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-01-31 09:12:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:12:29,295 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:29,296 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:29,296 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash 381660015, now seen corresponding path program 1 times [2018-01-31 09:12:29,296 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:29,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:29,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:29,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:29,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:29,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:29,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:12:29,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:12:29,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:12:29,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:12:29,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:12:29,505 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 4 states. [2018-01-31 09:12:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:29,646 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-01-31 09:12:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:12:29,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:12:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:29,648 INFO L225 Difference]: With dead ends: 64 [2018-01-31 09:12:29,648 INFO L226 Difference]: Without dead ends: 62 [2018-01-31 09:12:29,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:12:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-31 09:12:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-31 09:12:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 09:12:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-01-31 09:12:29,656 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 15 [2018-01-31 09:12:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:29,657 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-01-31 09:12:29,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:12:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-01-31 09:12:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-31 09:12:29,657 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:29,658 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:29,658 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1053441477, now seen corresponding path program 1 times [2018-01-31 09:12:29,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:29,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:29,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:29,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:29,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:29,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:30,211 WARN L146 SmtUtils]: Spent 282ms on a formula simplification. DAG size of input: 29 DAG size of output 12 [2018-01-31 09:12:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:30,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:12:30,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:12:30,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:12:30,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:12:30,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:12:30,220 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 5 states. [2018-01-31 09:12:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:30,323 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-01-31 09:12:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:12:30,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-31 09:12:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:30,324 INFO L225 Difference]: With dead ends: 62 [2018-01-31 09:12:30,324 INFO L226 Difference]: Without dead ends: 60 [2018-01-31 09:12:30,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:12:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-31 09:12:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-31 09:12:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-31 09:12:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-01-31 09:12:30,333 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 16 [2018-01-31 09:12:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:30,333 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-01-31 09:12:30,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:12:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-01-31 09:12:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:12:30,335 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:30,335 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:30,335 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1377337853, now seen corresponding path program 1 times [2018-01-31 09:12:30,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:30,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:30,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:30,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:30,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:30,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:30,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:12:30,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:12:30,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:12:30,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:12:30,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:30,430 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 3 states. [2018-01-31 09:12:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:30,487 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-01-31 09:12:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:12:30,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-31 09:12:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:30,489 INFO L225 Difference]: With dead ends: 60 [2018-01-31 09:12:30,489 INFO L226 Difference]: Without dead ends: 58 [2018-01-31 09:12:30,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-31 09:12:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-31 09:12:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-31 09:12:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-01-31 09:12:30,498 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 31 [2018-01-31 09:12:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:30,499 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-01-31 09:12:30,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:12:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-01-31 09:12:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:12:30,502 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:30,502 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:30,502 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1377337854, now seen corresponding path program 1 times [2018-01-31 09:12:30,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:30,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:30,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:30,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:30,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:30,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:30,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:12:30,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:12:30,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:12:30,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:12:30,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:12:30,804 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 8 states. [2018-01-31 09:12:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:31,145 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-01-31 09:12:31,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:12:31,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-31 09:12:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:31,147 INFO L225 Difference]: With dead ends: 58 [2018-01-31 09:12:31,147 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 09:12:31,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:12:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 09:12:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-31 09:12:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 09:12:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-31 09:12:31,160 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 31 [2018-01-31 09:12:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:31,161 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-31 09:12:31,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:12:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-31 09:12:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 09:12:31,162 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:31,162 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:31,162 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1377337855, now seen corresponding path program 1 times [2018-01-31 09:12:31,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:31,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:31,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:31,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:31,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:31,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:31,442 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 09:12:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:31,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:12:31,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:12:31,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:12:31,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:12:31,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:31,474 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-01-31 09:12:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:31,519 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-01-31 09:12:31,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:12:31,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-31 09:12:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:31,520 INFO L225 Difference]: With dead ends: 57 [2018-01-31 09:12:31,521 INFO L226 Difference]: Without dead ends: 55 [2018-01-31 09:12:31,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:12:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-31 09:12:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-31 09:12:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 09:12:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-01-31 09:12:31,530 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 31 [2018-01-31 09:12:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:31,531 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-01-31 09:12:31,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:12:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-01-31 09:12:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:12:31,532 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:31,532 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:31,532 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1059672691, now seen corresponding path program 1 times [2018-01-31 09:12:31,533 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:31,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:31,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:31,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:31,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:31,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 09:12:31,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:12:31,776 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:12:31,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:31,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:12:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:12:32,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:12:32,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-01-31 09:12:32,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:12:32,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:12:32,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:12:32,067 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 6 states. [2018-01-31 09:12:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:32,122 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-01-31 09:12:32,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 09:12:32,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-31 09:12:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:32,124 INFO L225 Difference]: With dead ends: 95 [2018-01-31 09:12:32,125 INFO L226 Difference]: Without dead ends: 63 [2018-01-31 09:12:32,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:12:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-31 09:12:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-01-31 09:12:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 09:12:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-31 09:12:32,133 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 42 [2018-01-31 09:12:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:32,134 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-31 09:12:32,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:12:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-31 09:12:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 09:12:32,136 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:32,136 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:32,136 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:32,136 INFO L82 PathProgramCache]: Analyzing trace with hash -935763635, now seen corresponding path program 1 times [2018-01-31 09:12:32,136 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:32,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:32,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:32,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:32,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:32,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 09:12:32,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:12:32,403 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:12:32,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:32,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:12:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-31 09:12:32,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:12:32,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-01-31 09:12:32,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:12:32,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:12:32,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:12:32,684 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 8 states. [2018-01-31 09:12:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:32,805 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-01-31 09:12:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:12:32,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-01-31 09:12:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:32,807 INFO L225 Difference]: With dead ends: 104 [2018-01-31 09:12:32,807 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 09:12:32,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:12:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 09:12:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-01-31 09:12:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 09:12:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-01-31 09:12:32,817 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 50 [2018-01-31 09:12:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:32,817 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-01-31 09:12:32,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:12:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-01-31 09:12:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 09:12:32,819 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:32,819 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:32,819 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash 677222157, now seen corresponding path program 2 times [2018-01-31 09:12:32,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:32,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:32,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:32,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:12:32,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:32,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-31 09:12:33,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:12:33,068 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:12:33,073 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:12:33,098 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:12:33,123 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:12:33,126 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:12:33,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:12:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 09:12:33,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:12:33,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-01-31 09:12:33,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:12:33,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:12:33,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:12:33,187 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 10 states. [2018-01-31 09:12:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:33,295 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-01-31 09:12:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:12:33,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-01-31 09:12:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:33,296 INFO L225 Difference]: With dead ends: 116 [2018-01-31 09:12:33,297 INFO L226 Difference]: Without dead ends: 79 [2018-01-31 09:12:33,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:12:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-31 09:12:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-01-31 09:12:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 09:12:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-01-31 09:12:33,305 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 58 [2018-01-31 09:12:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:33,306 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-01-31 09:12:33,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:12:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-01-31 09:12:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 09:12:33,307 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:33,307 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:33,307 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1573892403, now seen corresponding path program 3 times [2018-01-31 09:12:33,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:33,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:33,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:33,309 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:12:33,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:33,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-31 09:12:33,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:12:33,518 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:12:33,523 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:12:33,549 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:12:33,573 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:12:33,598 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:12:33,629 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:12:33,634 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:12:33,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:12:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-31 09:12:33,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:12:33,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-31 09:12:33,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:12:33,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:12:33,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:12:33,833 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 12 states. [2018-01-31 09:12:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:12:34,059 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-01-31 09:12:34,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:12:34,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-01-31 09:12:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:12:34,060 INFO L225 Difference]: With dead ends: 128 [2018-01-31 09:12:34,060 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 09:12:34,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:12:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 09:12:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2018-01-31 09:12:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 09:12:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-01-31 09:12:34,070 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 66 [2018-01-31 09:12:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:12:34,070 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-01-31 09:12:34,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:12:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-01-31 09:12:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 09:12:34,071 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:12:34,071 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:12:34,072 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:12:34,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1511950477, now seen corresponding path program 4 times [2018-01-31 09:12:34,072 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:12:34,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:12:34,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:34,073 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:12:34,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:12:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:12:34,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:12:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 8 proven. 127 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-31 09:12:35,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:12:35,791 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:12:35,799 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:12:35,851 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:12:35,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:12:35,950 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-01-31 09:12:35,969 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-01-31 09:12:35,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:12:35,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:36,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:36,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-31 09:12:41,619 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 95 DAG size of output 33 [2018-01-31 09:12:41,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-01-31 09:12:41,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 74 [2018-01-31 09:12:41,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,759 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:12:41,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 73 [2018-01-31 09:12:41,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,775 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:12:41,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 46 [2018-01-31 09:12:41,812 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:12:41,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 28 [2018-01-31 09:12:41,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:12:41,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:41,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:41,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:41,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-01-31 09:12:41,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,907 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-01-31 09:12:41,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,925 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-01-31 09:12:41,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,934 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:41,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-01-31 09:12:41,944 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 09:12:41,956 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:41,963 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:41,970 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:42,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:42,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 09:12:42,040 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-01-31 09:12:42,243 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 7 treesize of output 5 [2018-01-31 09:12:42,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:12:42,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:42,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-01-31 09:12:46,865 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 96 DAG size of output 34 [2018-01-31 09:12:46,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2018-01-31 09:12:46,911 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2018-01-31 09:12:46,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,916 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-01-31 09:12:46,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,924 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2018-01-31 09:12:46,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:12:46,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 99 [2018-01-31 09:12:46,937 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:12:46,953 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:46,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:46,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:46,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:12:46,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 09:12:46,997 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:203, output treesize:80 [2018-01-31 09:12:47,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2018-01-31 09:12:47,252 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-01-31 09:12:47,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:12:47,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:47,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:12:47,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:72, output treesize:3 [2018-01-31 09:12:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 92 refuted. 20 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-31 09:12:47,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:12:47,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 41 [2018-01-31 09:12:47,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-31 09:12:47,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-31 09:12:47,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1521, Unknown=16, NotChecked=0, Total=1722 [2018-01-31 09:12:47,366 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 42 states. [2018-01-31 09:12:48,016 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 41 DAG size of output 31 [2018-01-31 09:13:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:13:17,873 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2018-01-31 09:13:17,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-31 09:13:17,873 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 74 [2018-01-31 09:13:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:13:17,874 INFO L225 Difference]: With dead ends: 107 [2018-01-31 09:13:17,874 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 09:13:17,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 61 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=418, Invalid=3578, Unknown=36, NotChecked=0, Total=4032 [2018-01-31 09:13:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 09:13:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2018-01-31 09:13:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 09:13:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-01-31 09:13:17,891 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2018-01-31 09:13:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:13:17,891 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-01-31 09:13:17,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-31 09:13:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-01-31 09:13:17,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 09:13:17,893 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:13:17,893 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:13:17,893 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:13:17,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1511950478, now seen corresponding path program 1 times [2018-01-31 09:13:17,894 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:13:17,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:13:17,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:13:17,895 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:13:17,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:13:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:13:17,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:13:18,745 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 10 DAG size of output 9 [2018-01-31 09:13:19,017 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 14 DAG size of output 11 [2018-01-31 09:13:19,288 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 16 DAG size of output 13 [2018-01-31 09:13:20,347 WARN L146 SmtUtils]: Spent 268ms on a formula simplification. DAG size of input: 37 DAG size of output 25 [2018-01-31 09:13:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 91 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-31 09:13:20,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:13:20,992 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:13:20,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:13:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:13:21,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:13:21,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 09:13:21,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:13:21,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:13:21,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-31 09:13:21,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:21,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:21,072 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-01-31 09:13:21,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:13:21,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:13:21,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-31 09:13:21,110 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-01-31 09:13:21,112 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-01-31 09:13:21,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:13:21,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:13:21,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:13:21,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-31 09:13:21,153 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 18 treesize of output 14 [2018-01-31 09:13:21,155 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 14 treesize of output 10 [2018-01-31 09:13:21,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:13:21,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:13:21,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 09:13:21,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-31 09:13:22,025 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 110 DAG size of output 46 [2018-01-31 09:13:22,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 68 [2018-01-31 09:13:22,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-01-31 09:13:22,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,059 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-01-31 09:13:22,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,069 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2018-01-31 09:13:22,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 105 [2018-01-31 09:13:22,084 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:13:22,097 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:13:22,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:13:22,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:13:22,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:13:22,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 09:13:22,158 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:226, output treesize:99 [2018-01-31 09:13:22,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,235 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 21 treesize of output 23 [2018-01-31 09:13:22,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:13:22,249 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-01-31 09:13:22,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:77 [2018-01-31 09:13:22,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,325 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 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 09:13:22,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 09:13:22,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-31 09:13:22,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:174 [2018-01-31 09:13:22,464 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 88 treesize of output 76 [2018-01-31 09:13:22,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 80 [2018-01-31 09:13:22,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:13:22,509 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 28 treesize of output 24 [2018-01-31 09:13:22,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:13:22,531 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 32 treesize of output 28 [2018-01-31 09:13:22,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:13:22,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:13:22,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2018-01-31 09:13:22,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:13:22,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 79 [2018-01-31 09:13:22,621 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 09:13:22,653 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 31 treesize of output 29 [2018-01-31 09:13:22,654 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:13:22,677 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 27 treesize of output 25 [2018-01-31 09:13:22,678 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:13:22,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:13:22,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-01-31 09:13:22,739 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:174, output treesize:95 [2018-01-31 09:13:23,616 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-01-31 09:14:03,261 WARN L146 SmtUtils]: Spent 38229ms on a formula simplification. DAG size of input: 436 DAG size of output 194 [2018-01-31 09:14:03,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 124 [2018-01-31 09:14:03,461 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 135 [2018-01-31 09:14:03,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-01-31 09:14:03,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,474 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-31 09:14:03,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:03,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-01-31 09:14:03,488 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:03,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:03,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:03,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:03,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:14:04,355 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 3 case distinctions, treesize of input 131 treesize of output 113 [2018-01-31 09:14:04,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 169 [2018-01-31 09:14:04,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 143 [2018-01-31 09:14:04,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,455 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 173 [2018-01-31 09:14:04,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 151 treesize of output 208 [2018-01-31 09:14:04,545 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-01-31 09:14:04,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:04,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 212 [2018-01-31 09:14:04,771 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 8 xjuncts. [2018-01-31 09:14:04,895 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:04,919 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:04,977 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:05,023 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:14:05,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 137 [2018-01-31 09:14:05,463 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 148 [2018-01-31 09:14:05,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-01-31 09:14:05,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,491 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-31 09:14:05,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,499 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-01-31 09:14:05,504 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:05,517 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:05,525 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:05,558 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:05,629 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:05,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 126 [2018-01-31 09:14:05,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 182 [2018-01-31 09:14:05,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:05,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 143 [2018-01-31 09:14:06,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,178 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:06,414 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:06,414 INFO L303 Elim1Store]: Index analysis took 393 ms [2018-01-31 09:14:06,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 160 [2018-01-31 09:14:06,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:06,878 INFO L303 Elim1Store]: Index analysis took 460 ms [2018-01-31 09:14:07,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 136 [2018-01-31 09:14:07,022 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-01-31 09:14:07,462 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:07,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 173 [2018-01-31 09:14:07,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:07,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 157 treesize of output 212 [2018-01-31 09:14:07,677 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 8 xjuncts. [2018-01-31 09:14:07,859 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:07,876 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:07,921 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:07,981 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:14:08,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 4 dim-2 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-01-31 09:14:08,125 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 24 variables, input treesize:1037, output treesize:555 [2018-01-31 09:14:08,585 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 192 DAG size of output 102 [2018-01-31 09:14:08,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 113 [2018-01-31 09:14:08,618 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 48 treesize of output 39 [2018-01-31 09:14:08,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:08,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:08,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 113 [2018-01-31 09:14:08,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-01-31 09:14:08,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:08,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:08,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 198 [2018-01-31 09:14:08,881 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-31 09:14:08,904 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 64 xjuncts. [2018-01-31 09:14:09,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:09,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:09,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:09,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2018-01-31 09:14:09,750 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:10,006 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 33 treesize of output 26 [2018-01-31 09:14:10,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:10,123 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 29 treesize of output 22 [2018-01-31 09:14:10,123 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:10,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:10,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-31 09:14:10,206 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:269, output treesize:46 [2018-01-31 09:14:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 125 refuted. 11 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:14:10,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:14:10,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 57 [2018-01-31 09:14:10,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-31 09:14:10,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-31 09:14:10,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2981, Unknown=21, NotChecked=0, Total=3306 [2018-01-31 09:14:10,372 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 58 states. [2018-01-31 09:14:13,868 WARN L146 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 123 DAG size of output 86 [2018-01-31 09:14:16,009 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 40 DAG size of output 40 [2018-01-31 09:14:16,828 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 93 DAG size of output 81 [2018-01-31 09:14:18,010 WARN L146 SmtUtils]: Spent 355ms on a formula simplification. DAG size of input: 159 DAG size of output 157 [2018-01-31 09:14:18,680 WARN L146 SmtUtils]: Spent 535ms on a formula simplification. DAG size of input: 170 DAG size of output 160 [2018-01-31 09:14:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:14:19,184 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-01-31 09:14:19,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-31 09:14:19,184 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-01-31 09:14:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:14:19,186 INFO L225 Difference]: With dead ends: 122 [2018-01-31 09:14:19,186 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 09:14:19,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2488 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=694, Invalid=7097, Unknown=41, NotChecked=0, Total=7832 [2018-01-31 09:14:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 09:14:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2018-01-31 09:14:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 09:14:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-01-31 09:14:19,207 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-01-31 09:14:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:14:19,207 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-01-31 09:14:19,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-31 09:14:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-01-31 09:14:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-31 09:14:19,209 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:14:19,209 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:14:19,209 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 09:14:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1620862641, now seen corresponding path program 1 times [2018-01-31 09:14:19,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:14:19,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:14:19,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:14:19,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:14:19,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:14:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:14:19,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:14:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 4 proven. 129 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:14:22,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:14:22,287 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:14:22,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:14:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:14:22,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:14:22,459 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-01-31 09:14:22,461 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-01-31 09:14:22,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:22,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:22,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:22,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:45 [2018-01-31 09:14:22,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:22,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 43 [2018-01-31 09:14:22,528 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 35 treesize of output 23 [2018-01-31 09:14:22,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:22,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:22,560 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-01-31 09:14:22,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 14 [2018-01-31 09:14:22,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:22,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:22,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:22,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:25 [2018-01-31 09:14:30,004 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 115 DAG size of output 53 [2018-01-31 09:14:30,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 79 [2018-01-31 09:14:30,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 106 [2018-01-31 09:14:30,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,053 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:30,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 98 [2018-01-31 09:14:30,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,066 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:30,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2018-01-31 09:14:30,074 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:30,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 54 [2018-01-31 09:14:30,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 78 [2018-01-31 09:14:30,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2018-01-31 09:14:30,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,166 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 71 [2018-01-31 09:14:30,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:30,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 99 [2018-01-31 09:14:30,182 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,211 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,220 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,231 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:30,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:30,274 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:239, output treesize:121 [2018-01-31 09:14:31,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,143 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-01-31 09:14:31,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,155 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-01-31 09:14:31,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-01-31 09:14:31,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,184 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 21 treesize of output 36 [2018-01-31 09:14:31,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:31,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:31,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-01-31 09:14:31,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2018-01-31 09:14:31,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:31,206 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:31,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:14:31,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:14:31,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 73 [2018-01-31 09:14:31,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,276 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:31,277 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:31,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,280 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:31,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 107 [2018-01-31 09:14:31,298 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:31,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 77 [2018-01-31 09:14:31,348 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:31,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 26 [2018-01-31 09:14:31,373 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:31,389 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:14:31,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 81 [2018-01-31 09:14:31,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,399 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:31,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,404 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,404 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:31,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,406 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:31,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 116 [2018-01-31 09:14:31,424 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:31,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:31,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 79 [2018-01-31 09:14:31,477 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:31,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 28 [2018-01-31 09:14:31,503 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:31,519 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:14:31,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-01-31 09:14:31,559 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:130, output treesize:119 [2018-01-31 09:14:38,791 WARN L146 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 137 DAG size of output 75 [2018-01-31 09:14:38,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 148 treesize of output 147 [2018-01-31 09:14:38,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 220 [2018-01-31 09:14:38,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:38,953 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:39,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 67 treesize of output 166 [2018-01-31 09:14:39,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,112 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:39,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,147 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-01-31 09:14:39,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 156 treesize of output 199 [2018-01-31 09:14:39,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,193 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:39,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 179 treesize of output 231 [2018-01-31 09:14:39,255 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-31 09:14:39,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,517 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:39,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,584 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:39,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 186 [2018-01-31 09:14:39,615 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:39,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,675 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:39,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 148 [2018-01-31 09:14:39,720 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:39,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,829 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:39,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 142 [2018-01-31 09:14:39,873 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:39,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:39,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:39,960 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:39,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 127 [2018-01-31 09:14:40,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,021 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:40,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 112 treesize of output 128 [2018-01-31 09:14:40,060 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,129 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 09:14:40,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,349 INFO L303 Elim1Store]: Index analysis took 227 ms [2018-01-31 09:14:40,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 103 [2018-01-31 09:14:40,369 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,395 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,726 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 147 [2018-01-31 09:14:40,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,733 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-01-31 09:14:40,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,780 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-31 09:14:40,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:40,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-01-31 09:14:40,799 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,815 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,824 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,848 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:40,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:40,959 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:313, output treesize:198 [2018-01-31 09:14:41,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 139 [2018-01-31 09:14:41,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 116 treesize of output 123 [2018-01-31 09:14:41,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:41,494 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 63 treesize of output 50 [2018-01-31 09:14:41,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:41,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:41,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 89 [2018-01-31 09:14:41,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:41,822 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 59 treesize of output 46 [2018-01-31 09:14:41,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:42,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:42,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:42,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:42,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:42,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 09:14:42,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2018-01-31 09:14:42,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:42,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-01-31 09:14:42,235 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-31 09:14:42,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:14:42,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 09:14:42,298 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:178, output treesize:47 [2018-01-31 09:14:42,375 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#p~4.base| Int) (|main_#t~mem3.base| Int)) (let ((.cse1 (store |c_old(#valid)| |foo_~#p~4.base| 1))) (let ((.cse0 (store (store .cse1 |main_#t~mem3.base| 1) |foo_~#p~4.base| 0))) (and (= (select .cse0 |c_main_~#p~5.base|) 0) (not (= |main_#t~mem3.base| 0)) (= (select .cse1 |main_#t~mem3.base|) 0) (= (select |c_old(#valid)| |foo_~#p~4.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_~#p~5.base| 1) |main_#t~mem3.base| 0)))))) is different from true [2018-01-31 09:14:42,380 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#p~4.base| Int) (|main_#t~mem3.base| Int) (|main_~#p~5.base| Int)) (let ((.cse1 (store |c_old(#valid)| |foo_~#p~4.base| 1))) (let ((.cse0 (store (store .cse1 |main_#t~mem3.base| 1) |foo_~#p~4.base| 0))) (and (= |c_#valid| (store (store (store .cse0 |main_~#p~5.base| 1) |main_#t~mem3.base| 0) |main_~#p~5.base| 0)) (= (select .cse0 |main_~#p~5.base|) 0) (not (= |main_#t~mem3.base| 0)) (= (select .cse1 |main_#t~mem3.base|) 0) (= (select |c_old(#valid)| |foo_~#p~4.base|) 0))))) is different from true [2018-01-31 09:14:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 4 proven. 98 refuted. 25 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-31 09:14:42,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:14:42,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2018-01-31 09:14:42,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-31 09:14:42,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-31 09:14:42,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2953, Unknown=52, NotChecked=226, Total=3540 [2018-01-31 09:14:42,477 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 60 states. [2018-01-31 09:14:43,359 WARN L146 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 27 DAG size of output 23 Received shutdown request... [2018-01-31 09:15:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 09:15:01,125 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 09:15:01,132 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 09:15:01,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:15:01 BoogieIcfgContainer [2018-01-31 09:15:01,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:15:01,133 INFO L168 Benchmark]: Toolchain (without parser) took 154521.45 ms. Allocated memory was 307.2 MB in the beginning and 810.5 MB in the end (delta: 503.3 MB). Free memory was 264.0 MB in the beginning and 498.8 MB in the end (delta: -234.8 MB). Peak memory consumption was 268.5 MB. Max. memory is 5.3 GB. [2018-01-31 09:15:01,134 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 307.2 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:15:01,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.35 ms. Allocated memory is still 307.2 MB. Free memory was 264.0 MB in the beginning and 252.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:15:01,140 INFO L168 Benchmark]: Boogie Preprocessor took 63.81 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:15:01,141 INFO L168 Benchmark]: RCFGBuilder took 623.24 ms. Allocated memory is still 307.2 MB. Free memory was 250.0 MB in the beginning and 229.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:15:01,141 INFO L168 Benchmark]: TraceAbstraction took 153514.27 ms. Allocated memory was 307.2 MB in the beginning and 810.5 MB in the end (delta: 503.3 MB). Free memory was 229.0 MB in the beginning and 498.8 MB in the end (delta: -269.7 MB). Peak memory consumption was 233.6 MB. Max. memory is 5.3 GB. [2018-01-31 09:15:01,143 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.11 ms. Allocated memory is still 307.2 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 304.35 ms. Allocated memory is still 307.2 MB. Free memory was 264.0 MB in the beginning and 252.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 63.81 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 623.24 ms. Allocated memory is still 307.2 MB. Free memory was 250.0 MB in the beginning and 229.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 153514.27 ms. Allocated memory was 307.2 MB in the beginning and 810.5 MB in the end (delta: 503.3 MB). Free memory was 229.0 MB in the beginning and 498.8 MB in the end (delta: -269.7 MB). Peak memory consumption was 233.6 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 pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 18 states, 60 states before enhancement), while ReachableStatesComputation was computing reachable states (34 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 67 locations, 23 error locations. TIMEOUT Result, 153.4s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 60.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 557 SDtfs, 684 SDslu, 1600 SDs, 0 SdLazy, 3878 SolverSat, 340 SolverUnsat, 169 SolverUnknown, 0 SolverNotchecked, 37.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 382 SyntacticMatches, 33 SemanticMatches, 274 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5350 ImplicationChecksByTransitivity, 58.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=12, 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, 14 MinimizatonAttempts, 92 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 91.5s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1011 ConstructedInterpolants, 144 QuantifiedInterpolants, 1761487 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 262/1104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-15-01-154.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-15-01-154.csv Completed graceful shutdown