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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:17:38,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:17:38,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:17:38,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:17:38,964 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:17:38,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:17:38,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:17:38,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:17:38,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:17:38,969 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:17:38,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:17:38,970 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:17:38,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:17:38,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:17:38,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:17:38,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:17:38,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:17:38,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:17:38,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:17:38,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:17:38,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:17:38,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:17:38,985 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:17:38,986 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:17:38,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:17:38,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:17:38,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:17:38,989 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:17:38,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:17:38,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:17:38,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:17:38,991 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:17:39,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:17:39,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:17:39,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:17:39,003 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:17:39,003 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:17:39,003 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:17:39,003 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:17:39,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:17:39,004 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:17:39,004 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:17:39,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:17:39,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:17:39,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:17:39,005 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:17:39,005 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:17:39,006 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:17:39,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:17:39,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:17:39,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:17:39,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:17:39,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:17:39,007 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:17:39,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:17:39,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:17:39,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:17:39,008 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:17:39,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:17:39,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:17:39,008 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:17:39,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:17:39,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:17:39,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:17:39,010 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:17:39,010 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:17:39,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:17:39,060 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:17:39,065 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:17:39,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:17:39,067 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:17:39,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-24 13:17:39,236 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:17:39,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:17:39,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:17:39,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:17:39,250 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:17:39,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a60e38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39, skipping insertion in model container [2018-01-24 13:17:39,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,272 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:17:39,314 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:17:39,445 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:17:39,470 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:17:39,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39 WrapperNode [2018-01-24 13:17:39,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:17:39,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:17:39,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:17:39,482 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:17:39,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (1/1) ... [2018-01-24 13:17:39,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:17:39,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:17:39,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:17:39,524 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:17:39,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:17:39,579 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:17:39,579 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:17:39,579 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:17:39,579 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:17:39,579 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:17:39,579 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:17:39,579 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:17:39,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:17:39,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:17:39,580 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:17:39,580 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:17:39,580 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:17:39,580 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 13:17:39,580 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:17:39,580 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:17:39,580 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:17:39,580 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:17:40,033 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:17:40,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:17:40 BoogieIcfgContainer [2018-01-24 13:17:40,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:17:40,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:17:40,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:17:40,038 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:17:40,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:17:39" (1/3) ... [2018-01-24 13:17:40,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58577abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:17:40, skipping insertion in model container [2018-01-24 13:17:40,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:17:39" (2/3) ... [2018-01-24 13:17:40,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58577abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:17:40, skipping insertion in model container [2018-01-24 13:17:40,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:17:40" (3/3) ... [2018-01-24 13:17:40,043 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-24 13:17:40,054 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:17:40,062 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-24 13:17:40,103 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:17:40,103 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:17:40,103 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:17:40,103 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:17:40,103 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:17:40,103 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:17:40,103 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:17:40,104 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:17:40,104 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:17:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-01-24 13:17:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 13:17:40,130 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:40,131 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:40,131 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-01-24 13:17:40,137 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:40,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:40,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:40,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:40,179 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:40,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:40,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:40,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:17:40,255 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:40,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 13:17:40,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 13:17:40,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:17:40,271 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-01-24 13:17:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:40,399 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-01-24 13:17:40,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 13:17:40,401 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-24 13:17:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:40,412 INFO L225 Difference]: With dead ends: 196 [2018-01-24 13:17:40,412 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 13:17:40,415 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:17:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 13:17:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-24 13:17:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 13:17:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-24 13:17:40,455 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-01-24 13:17:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:40,456 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-24 13:17:40,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 13:17:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-24 13:17:40,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:17:40,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:40,457 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:40,457 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:40,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-01-24 13:17:40,457 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:40,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:40,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:40,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:40,458 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:40,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:40,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:40,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:17:40,529 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:40,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:17:40,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:17:40,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:17:40,531 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-01-24 13:17:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:40,583 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-24 13:17:40,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:17:40,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 13:17:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:40,587 INFO L225 Difference]: With dead ends: 136 [2018-01-24 13:17:40,587 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 13:17:40,588 INFO L525 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-24 13:17:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 13:17:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-01-24 13:17:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 13:17:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-01-24 13:17:40,599 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-01-24 13:17:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:40,599 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-01-24 13:17:40,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:17:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-01-24 13:17:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:17:40,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:40,600 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:40,600 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-01-24 13:17:40,601 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:40,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:40,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:40,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:40,602 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:40,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:40,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:40,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:17:40,668 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:40,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:17:40,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:17:40,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:17:40,669 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-01-24 13:17:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:40,886 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-24 13:17:40,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:17:40,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:17:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:40,889 INFO L225 Difference]: With dead ends: 135 [2018-01-24 13:17:40,890 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 13:17:40,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 13:17:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-01-24 13:17:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 13:17:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-01-24 13:17:40,902 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-01-24 13:17:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:40,902 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-01-24 13:17:40,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:17:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-01-24 13:17:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:17:40,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:40,903 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:40,903 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-01-24 13:17:40,904 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:40,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:40,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:40,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:40,905 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:40,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:41,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:41,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:17:41,008 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:41,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:17:41,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:17:41,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:17:41,009 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-01-24 13:17:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:41,121 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-24 13:17:41,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:17:41,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:17:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:41,123 INFO L225 Difference]: With dead ends: 144 [2018-01-24 13:17:41,123 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 13:17:41,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 13:17:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-01-24 13:17:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 13:17:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-01-24 13:17:41,133 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-01-24 13:17:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:41,134 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-01-24 13:17:41,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:17:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-01-24 13:17:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:17:41,135 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:41,135 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:41,135 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:41,135 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-01-24 13:17:41,135 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:41,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:41,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,137 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:41,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:41,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:41,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:17:41,180 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:41,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:17:41,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:17:41,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:17:41,181 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-01-24 13:17:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:41,238 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-01-24 13:17:41,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:17:41,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 13:17:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:41,239 INFO L225 Difference]: With dead ends: 103 [2018-01-24 13:17:41,240 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 13:17:41,240 INFO L525 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-24 13:17:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 13:17:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-01-24 13:17:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 13:17:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-01-24 13:17:41,248 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-01-24 13:17:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:41,248 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-01-24 13:17:41,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:17:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-01-24 13:17:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:17:41,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:41,249 INFO L322 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] [2018-01-24 13:17:41,249 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:41,250 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-01-24 13:17:41,250 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:41,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:41,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,251 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:41,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:41,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:41,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:17:41,332 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:41,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:17:41,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:17:41,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:17:41,333 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-01-24 13:17:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:41,351 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2018-01-24 13:17:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:17:41,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-24 13:17:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:41,353 INFO L225 Difference]: With dead ends: 230 [2018-01-24 13:17:41,354 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 13:17:41,354 INFO L525 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-24 13:17:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 13:17:41,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-01-24 13:17:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 13:17:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-01-24 13:17:41,367 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-01-24 13:17:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:41,368 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-01-24 13:17:41,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:17:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-01-24 13:17:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:17:41,369 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:41,369 INFO L322 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] [2018-01-24 13:17:41,369 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-01-24 13:17:41,370 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:41,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:41,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,371 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:41,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:41,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:41,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:17:41,518 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:41,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:17:41,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:17:41,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:41,521 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 5 states. [2018-01-24 13:17:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:41,709 INFO L93 Difference]: Finished difference Result 228 states and 263 transitions. [2018-01-24 13:17:41,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:17:41,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-24 13:17:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:41,711 INFO L225 Difference]: With dead ends: 228 [2018-01-24 13:17:41,711 INFO L226 Difference]: Without dead ends: 225 [2018-01-24 13:17:41,712 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:17:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-24 13:17:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 114. [2018-01-24 13:17:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 13:17:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-01-24 13:17:41,722 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2018-01-24 13:17:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:41,722 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-01-24 13:17:41,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:17:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-01-24 13:17:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:17:41,723 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:41,723 INFO L322 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] [2018-01-24 13:17:41,723 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-01-24 13:17:41,723 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:41,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:41,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:41,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:41,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:41,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:17:41,780 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:41,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:17:41,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:17:41,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:17:41,780 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2018-01-24 13:17:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:41,931 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2018-01-24 13:17:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:17:41,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 13:17:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:41,933 INFO L225 Difference]: With dead ends: 175 [2018-01-24 13:17:41,933 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 13:17:41,933 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 13:17:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2018-01-24 13:17:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 13:17:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-01-24 13:17:41,941 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2018-01-24 13:17:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:41,942 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-01-24 13:17:41,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:17:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-01-24 13:17:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:17:41,943 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:41,943 INFO L322 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] [2018-01-24 13:17:41,943 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-01-24 13:17:41,943 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:41,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:41,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:41,944 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:41,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:42,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:42,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:17:42,053 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:42,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:17:42,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:17:42,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:17:42,054 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2018-01-24 13:17:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:42,151 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2018-01-24 13:17:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:17:42,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 13:17:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:42,152 INFO L225 Difference]: With dead ends: 163 [2018-01-24 13:17:42,152 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 13:17:42,152 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 13:17:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-01-24 13:17:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 13:17:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-01-24 13:17:42,158 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 28 [2018-01-24 13:17:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:42,158 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-01-24 13:17:42,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:17:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-01-24 13:17:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 13:17:42,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:42,159 INFO L322 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-24 13:17:42,160 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-01-24 13:17:42,160 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:42,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:42,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:42,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:42,161 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:42,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:42,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:42,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:17:42,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:42,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:17:42,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:17:42,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:17:42,276 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 6 states. [2018-01-24 13:17:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:42,474 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2018-01-24 13:17:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:17:42,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 13:17:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:42,476 INFO L225 Difference]: With dead ends: 186 [2018-01-24 13:17:42,476 INFO L226 Difference]: Without dead ends: 185 [2018-01-24 13:17:42,477 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:17:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-24 13:17:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-01-24 13:17:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 13:17:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-01-24 13:17:42,486 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 31 [2018-01-24 13:17:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:42,487 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-01-24 13:17:42,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:17:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-01-24 13:17:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 13:17:42,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:42,488 INFO L322 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-24 13:17:42,488 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-01-24 13:17:42,489 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:42,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:42,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:42,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:42,490 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:42,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:42,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:42,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 13:17:42,755 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:42,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:17:42,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:17:42,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:17:42,756 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 10 states. [2018-01-24 13:17:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:43,229 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2018-01-24 13:17:43,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 13:17:43,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 13:17:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:43,231 INFO L225 Difference]: With dead ends: 235 [2018-01-24 13:17:43,232 INFO L226 Difference]: Without dead ends: 234 [2018-01-24 13:17:43,232 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-24 13:17:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-24 13:17:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-01-24 13:17:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 13:17:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-01-24 13:17:43,243 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-01-24 13:17:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:43,244 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-01-24 13:17:43,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:17:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-01-24 13:17:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:17:43,245 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:43,245 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 13:17:43,245 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-01-24 13:17:43,246 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:43,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:43,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:43,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:43,247 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:43,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:43,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:43,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:17:43,298 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:43,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:17:43,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:17:43,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:17:43,299 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-01-24 13:17:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:43,453 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2018-01-24 13:17:43,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:17:43,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-24 13:17:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:43,455 INFO L225 Difference]: With dead ends: 161 [2018-01-24 13:17:43,455 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 13:17:43,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 13:17:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-01-24 13:17:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 13:17:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-01-24 13:17:43,466 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-01-24 13:17:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:43,467 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-01-24 13:17:43,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:17:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-01-24 13:17:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:17:43,468 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:43,468 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 13:17:43,468 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-01-24 13:17:43,469 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:43,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:43,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:43,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:43,470 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:43,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:43,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:43,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:17:43,582 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:43,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:17:43,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:17:43,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:43,583 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-01-24 13:17:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:43,789 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2018-01-24 13:17:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:17:43,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 13:17:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:43,791 INFO L225 Difference]: With dead ends: 213 [2018-01-24 13:17:43,791 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 13:17:43,791 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:17:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 13:17:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-01-24 13:17:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 13:17:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-01-24 13:17:43,801 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-01-24 13:17:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:43,801 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-01-24 13:17:43,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:17:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-01-24 13:17:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:17:43,802 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:43,802 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:43,802 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-01-24 13:17:43,803 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:43,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:43,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:43,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:43,804 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:43,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:43,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:43,851 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:43,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:43,869 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:43,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:43,974 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:44,052 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:17:44,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 5 [2018-01-24 13:17:44,053 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:44,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:17:44,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:17:44,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:44,054 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand 4 states. [2018-01-24 13:17:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:44,081 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2018-01-24 13:17:44,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:17:44,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-01-24 13:17:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:44,082 INFO L225 Difference]: With dead ends: 165 [2018-01-24 13:17:44,083 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 13:17:44,083 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 13:17:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-01-24 13:17:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 13:17:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-01-24 13:17:44,095 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 33 [2018-01-24 13:17:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:44,096 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-01-24 13:17:44,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:17:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-01-24 13:17:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:17:44,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:44,096 INFO L322 BasicCegarLoop]: trace histogram [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-24 13:17:44,097 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:44,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361569, now seen corresponding path program 1 times [2018-01-24 13:17:44,097 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:44,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:44,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:44,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:44,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:44,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:17:44,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:44,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:17:44,139 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:44,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:17:44,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:17:44,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:17:44,140 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-01-24 13:17:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:44,236 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2018-01-24 13:17:44,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:17:44,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 13:17:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:44,238 INFO L225 Difference]: With dead ends: 178 [2018-01-24 13:17:44,238 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 13:17:44,238 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 13:17:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-01-24 13:17:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-24 13:17:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 200 transitions. [2018-01-24 13:17:44,251 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 200 transitions. Word has length 34 [2018-01-24 13:17:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:44,251 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 200 transitions. [2018-01-24 13:17:44,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:17:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 200 transitions. [2018-01-24 13:17:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:17:44,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:44,252 INFO L322 BasicCegarLoop]: trace histogram [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-24 13:17:44,252 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:44,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361568, now seen corresponding path program 1 times [2018-01-24 13:17:44,253 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:44,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:44,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:44,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:44,254 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:44,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:44,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:44,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:17:44,345 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:44,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:17:44,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:17:44,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:17:44,346 INFO L87 Difference]: Start difference. First operand 168 states and 200 transitions. Second operand 6 states. [2018-01-24 13:17:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:44,620 INFO L93 Difference]: Finished difference Result 252 states and 303 transitions. [2018-01-24 13:17:44,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:17:44,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-24 13:17:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:44,622 INFO L225 Difference]: With dead ends: 252 [2018-01-24 13:17:44,622 INFO L226 Difference]: Without dead ends: 250 [2018-01-24 13:17:44,623 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:17:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-24 13:17:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2018-01-24 13:17:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-24 13:17:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2018-01-24 13:17:44,640 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2018-01-24 13:17:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:44,640 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2018-01-24 13:17:44,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:17:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2018-01-24 13:17:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:17:44,641 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:44,641 INFO L322 BasicCegarLoop]: trace histogram [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-24 13:17:44,641 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash -521175964, now seen corresponding path program 1 times [2018-01-24 13:17:44,642 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:44,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:44,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:44,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:44,643 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:44,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:44,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:44,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:17:44,789 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:44,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:17:44,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:17:44,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:17:44,789 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand 7 states. [2018-01-24 13:17:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:45,168 INFO L93 Difference]: Finished difference Result 307 states and 393 transitions. [2018-01-24 13:17:45,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:17:45,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-24 13:17:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:45,170 INFO L225 Difference]: With dead ends: 307 [2018-01-24 13:17:45,170 INFO L226 Difference]: Without dead ends: 257 [2018-01-24 13:17:45,170 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:17:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-24 13:17:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 198. [2018-01-24 13:17:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-24 13:17:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2018-01-24 13:17:45,188 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 38 [2018-01-24 13:17:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:45,189 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2018-01-24 13:17:45,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:17:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2018-01-24 13:17:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:17:45,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:45,190 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:45,190 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash -47566885, now seen corresponding path program 1 times [2018-01-24 13:17:45,199 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:45,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:45,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:45,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:45,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:45,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:45,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:45,292 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:17:45,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:45,303 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:45,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:45,345 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:45,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:45,489 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:17:45,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:45,503 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:45,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:45,563 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:45,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:17:45,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 4, 4] total 5 [2018-01-24 13:17:45,644 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:17:45,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:17:45,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:17:45,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:45,645 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand 5 states. [2018-01-24 13:17:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:45,749 INFO L93 Difference]: Finished difference Result 288 states and 357 transitions. [2018-01-24 13:17:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:17:45,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-24 13:17:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:45,751 INFO L225 Difference]: With dead ends: 288 [2018-01-24 13:17:45,751 INFO L226 Difference]: Without dead ends: 253 [2018-01-24 13:17:45,752 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-24 13:17:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2018-01-24 13:17:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 13:17:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 310 transitions. [2018-01-24 13:17:45,765 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 310 transitions. Word has length 41 [2018-01-24 13:17:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:45,765 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 310 transitions. [2018-01-24 13:17:45,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:17:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 310 transitions. [2018-01-24 13:17:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 13:17:45,765 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:45,765 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-24 13:17:45,765 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1474573890, now seen corresponding path program 1 times [2018-01-24 13:17:45,766 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:45,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:45,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:45,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:45,767 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:45,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:46,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:46,007 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:17:46,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:46,018 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:46,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:46,496 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-24 13:17:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 13:17:46,513 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:46,909 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_6| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc3.base_6| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_6|))) (= 0 |v_main_#t~malloc3.base_6|))) is different from false [2018-01-24 13:17:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-24 13:17:46,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:46,969 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:17:46,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:46,973 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:47,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:47,046 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-24 13:17:47,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:47,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:47,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:17:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:47,511 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:47,553 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_7| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc3.base_7|) 0)) (= 0 |v_main_#t~malloc3.base_7|) (= (store |c_#valid| |v_main_#t~malloc3.base_7| 0) |c_old(#valid)|))) is different from false [2018-01-24 13:17:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-24 13:17:47,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:17:47,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9, 8, 7] total 25 [2018-01-24 13:17:47,579 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:17:47,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:17:47,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:17:47,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=428, Unknown=8, NotChecked=132, Total=650 [2018-01-24 13:17:47,580 INFO L87 Difference]: Start difference. First operand 238 states and 310 transitions. Second operand 14 states. [2018-01-24 13:17:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:48,019 INFO L93 Difference]: Finished difference Result 244 states and 315 transitions. [2018-01-24 13:17:48,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:17:48,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-01-24 13:17:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:48,020 INFO L225 Difference]: With dead ends: 244 [2018-01-24 13:17:48,021 INFO L226 Difference]: Without dead ends: 230 [2018-01-24 13:17:48,021 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=157, Invalid=659, Unknown=8, NotChecked=168, Total=992 [2018-01-24 13:17:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-24 13:17:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-01-24 13:17:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-24 13:17:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2018-01-24 13:17:48,040 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 42 [2018-01-24 13:17:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:48,041 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2018-01-24 13:17:48,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:17:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2018-01-24 13:17:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 13:17:48,041 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:48,042 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:48,042 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash 924240911, now seen corresponding path program 1 times [2018-01-24 13:17:48,042 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:48,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:48,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:48,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:48,043 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:48,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:48,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:48,142 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:17:48,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:48,150 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:48,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:48,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 13:17:48,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:48,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:48,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 13:17:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:48,269 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:48,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:48,370 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:17:48,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:48,375 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:48,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:48,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:17:48,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:48,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:48,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:17:48,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 13:17:48,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:48,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:17:48,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 13:17:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:48,503 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:48,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:17:48,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 4, 4] total 10 [2018-01-24 13:17:48,537 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:17:48,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:17:48,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:17:48,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:17:48,538 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand 8 states. [2018-01-24 13:17:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:48,883 INFO L93 Difference]: Finished difference Result 264 states and 329 transitions. [2018-01-24 13:17:48,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:17:48,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-24 13:17:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:48,885 INFO L225 Difference]: With dead ends: 264 [2018-01-24 13:17:48,885 INFO L226 Difference]: Without dead ends: 263 [2018-01-24 13:17:48,886 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 16 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:17:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-24 13:17:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 228. [2018-01-24 13:17:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-24 13:17:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2018-01-24 13:17:48,905 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2018-01-24 13:17:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:48,906 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2018-01-24 13:17:48,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:17:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2018-01-24 13:17:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 13:17:48,906 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:48,907 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:48,907 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash 924240912, now seen corresponding path program 1 times [2018-01-24 13:17:48,907 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:48,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:48,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:48,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:48,908 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:48,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:17:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:49,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:49,118 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:49,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:49,129 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:49,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:49,177 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-24 13:17:49,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:17:49,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-24 13:17:49,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-01-24 13:17:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:49,336 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:49,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:49,879 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:17:49,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:49,882 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:49,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:49,933 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-24 13:17:49,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,938 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-24 13:17:49,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 13:17:49,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:17:49,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:17:49,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:17:49,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 13:17:49,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:49,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:17:49,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-24 13:17:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:50,032 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:50,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:17:50,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 5, 5] total 22 [2018-01-24 13:17:50,186 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:17:50,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:17:50,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:17:50,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=409, Unknown=1, NotChecked=0, Total=506 [2018-01-24 13:17:50,187 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand 12 states. [2018-01-24 13:17:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:50,554 INFO L93 Difference]: Finished difference Result 318 states and 405 transitions. [2018-01-24 13:17:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:17:50,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-01-24 13:17:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:50,556 INFO L225 Difference]: With dead ends: 318 [2018-01-24 13:17:50,556 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 13:17:50,557 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=647, Unknown=1, NotChecked=0, Total=870 [2018-01-24 13:17:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 13:17:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 227. [2018-01-24 13:17:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 13:17:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 296 transitions. [2018-01-24 13:17:50,574 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 296 transitions. Word has length 45 [2018-01-24 13:17:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:50,574 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 296 transitions. [2018-01-24 13:17:50,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:17:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 296 transitions. [2018-01-24 13:17:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 13:17:50,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:50,575 INFO L322 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] [2018-01-24 13:17:50,576 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:50,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623147, now seen corresponding path program 1 times [2018-01-24 13:17:50,576 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:50,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:50,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:50,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:50,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:50,588 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:50,588 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:50,589 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:50,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:50,596 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:50,635 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:50,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:50,635 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:50,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:50,640 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:50,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:50,679 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-24 13:17:50,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:17:50,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,684 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-24 13:17:50,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 13:17:50,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 13:17:50,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-24 13:17:50,787 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 25 treesize of output 35 [2018-01-24 13:17:50,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 13:17:50,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:17:50,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 13:17:50,824 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 28 treesize of output 28 [2018-01-24 13:17:50,826 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 24 treesize of output 17 [2018-01-24 13:17:50,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-01-24 13:17:50,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 13:17:50,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:50,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:17:50,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-24 13:17:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:50,858 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:50,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:50,917 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:17:50,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:50,920 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:50,974 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 13:17:50,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 13:17:50,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-01-24 13:17:50,974 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:17:50,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:17:50,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:17:50,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:17:50,976 INFO L87 Difference]: Start difference. First operand 227 states and 296 transitions. Second operand 13 states. [2018-01-24 13:17:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:51,298 INFO L93 Difference]: Finished difference Result 249 states and 323 transitions. [2018-01-24 13:17:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:17:51,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-24 13:17:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:51,301 INFO L225 Difference]: With dead ends: 249 [2018-01-24 13:17:51,301 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 13:17:51,301 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-01-24 13:17:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 13:17:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2018-01-24 13:17:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 13:17:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2018-01-24 13:17:51,312 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 48 [2018-01-24 13:17:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:51,312 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2018-01-24 13:17:51,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:17:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2018-01-24 13:17:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 13:17:51,313 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:51,313 INFO L322 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] [2018-01-24 13:17:51,313 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623146, now seen corresponding path program 1 times [2018-01-24 13:17:51,313 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:51,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:51,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:51,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:51,314 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:51,326 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:51,326 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:51,326 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-01-24 13:17:51,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:51,343 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:51,389 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:51,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:51,389 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:51,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:51,395 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:51,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:51,430 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-24 13:17:51,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:17:51,450 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-24 13:17:51,453 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-24 13:17:51,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,466 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-24 13:17:51,468 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-24 13:17:51,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-01-24 13:17:51,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-01-24 13:17:51,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-01-24 13:17:51,573 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 25 treesize of output 35 [2018-01-24 13:17:51,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-24 13:17:51,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 13:17:51,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,651 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 32 treesize of output 40 [2018-01-24 13:17:51,658 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 33 treesize of output 32 [2018-01-24 13:17:51,659 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:17:51,725 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-01-24 13:17:51,763 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 28 treesize of output 28 [2018-01-24 13:17:51,768 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 24 treesize of output 17 [2018-01-24 13:17:51,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,779 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 17 treesize of output 10 [2018-01-24 13:17:51,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 13:17:51,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,804 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 35 treesize of output 33 [2018-01-24 13:17:51,806 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-24 13:17:51,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,818 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 22 treesize of output 13 [2018-01-24 13:17:51,819 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-01-24 13:17:51,830 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:51,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:17:51,841 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-01-24 13:17:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:51,858 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:52,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:52,300 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:17:52,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:52,305 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:52,360 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 13:17:52,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 13:17:52,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-01-24 13:17:52,361 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:17:52,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 13:17:52,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 13:17:52,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=279, Unknown=4, NotChecked=0, Total=342 [2018-01-24 13:17:52,362 INFO L87 Difference]: Start difference. First operand 226 states and 294 transitions. Second operand 19 states. [2018-01-24 13:17:53,316 WARN L143 SmtUtils]: Spent 329ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-24 13:17:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:53,465 INFO L93 Difference]: Finished difference Result 318 states and 410 transitions. [2018-01-24 13:17:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 13:17:53,465 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-01-24 13:17:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:53,467 INFO L225 Difference]: With dead ends: 318 [2018-01-24 13:17:53,467 INFO L226 Difference]: Without dead ends: 317 [2018-01-24 13:17:53,468 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=663, Unknown=5, NotChecked=0, Total=870 [2018-01-24 13:17:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-24 13:17:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 209. [2018-01-24 13:17:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-24 13:17:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 276 transitions. [2018-01-24 13:17:53,485 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 276 transitions. Word has length 48 [2018-01-24 13:17:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:53,485 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 276 transitions. [2018-01-24 13:17:53,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 13:17:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 276 transitions. [2018-01-24 13:17:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 13:17:53,486 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:53,486 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-01-24 13:17:53,486 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:53,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1869223904, now seen corresponding path program 1 times [2018-01-24 13:17:53,487 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:53,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:53,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:53,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:53,488 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:53,498 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:53,499 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:53,499 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:53,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:53,508 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:53,551 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:53,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:53,551 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:53,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:53,556 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:53,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:53,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:17:53,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-24 13:17:53,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:53,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:17:53,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:17:53,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:17:53,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:53,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:53,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 13:17:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:53,670 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:53,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:53,754 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:17:53,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:53,757 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:53,809 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 13:17:53,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 13:17:53,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-01-24 13:17:53,810 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:17:53,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:17:53,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:17:53,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:17:53,811 INFO L87 Difference]: Start difference. First operand 209 states and 276 transitions. Second operand 9 states. [2018-01-24 13:17:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:54,070 INFO L93 Difference]: Finished difference Result 310 states and 397 transitions. [2018-01-24 13:17:54,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:17:54,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-24 13:17:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:54,072 INFO L225 Difference]: With dead ends: 310 [2018-01-24 13:17:54,072 INFO L226 Difference]: Without dead ends: 309 [2018-01-24 13:17:54,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:17:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-24 13:17:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 216. [2018-01-24 13:17:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-24 13:17:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 284 transitions. [2018-01-24 13:17:54,093 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 284 transitions. Word has length 49 [2018-01-24 13:17:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:54,094 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 284 transitions. [2018-01-24 13:17:54,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:17:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 284 transitions. [2018-01-24 13:17:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 13:17:54,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:54,095 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:54,095 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1027839999, now seen corresponding path program 1 times [2018-01-24 13:17:54,095 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:54,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:54,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:54,097 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:54,108 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:54,108 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:54,108 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:54,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,115 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:54,163 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:54,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:54,163 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:54,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,172 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:54,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:17:54,214 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:54,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-01-24 13:17:54,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 13:17:54,232 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 12 treesize of output 10 [2018-01-24 13:17:54,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:54,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:17:54,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:12 [2018-01-24 13:17:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:17:54,272 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:54,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-01-24 13:17:54,272 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:54,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:17:54,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:17:54,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:17:54,273 INFO L87 Difference]: Start difference. First operand 216 states and 284 transitions. Second operand 6 states. [2018-01-24 13:17:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:54,378 INFO L93 Difference]: Finished difference Result 249 states and 325 transitions. [2018-01-24 13:17:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:17:54,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-01-24 13:17:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:54,379 INFO L225 Difference]: With dead ends: 249 [2018-01-24 13:17:54,379 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 13:17:54,380 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:17:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 13:17:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 218. [2018-01-24 13:17:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-24 13:17:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2018-01-24 13:17:54,390 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 51 [2018-01-24 13:17:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:54,391 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2018-01-24 13:17:54,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:17:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2018-01-24 13:17:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 13:17:54,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:54,392 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:54,392 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560870, now seen corresponding path program 1 times [2018-01-24 13:17:54,392 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:54,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:54,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:54,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:54,403 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:54,404 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:54,404 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:54,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,412 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:54,446 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:54,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:54,446 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:54,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,451 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:54,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:17:54,496 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:17:54,555 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:54,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-01-24 13:17:54,555 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:54,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:17:54,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:17:54,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:17:54,556 INFO L87 Difference]: Start difference. First operand 218 states and 285 transitions. Second operand 7 states. [2018-01-24 13:17:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:54,693 INFO L93 Difference]: Finished difference Result 243 states and 318 transitions. [2018-01-24 13:17:54,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:17:54,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-01-24 13:17:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:54,695 INFO L225 Difference]: With dead ends: 243 [2018-01-24 13:17:54,695 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 13:17:54,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:17:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 13:17:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 213. [2018-01-24 13:17:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-24 13:17:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 278 transitions. [2018-01-24 13:17:54,708 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 278 transitions. Word has length 55 [2018-01-24 13:17:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:54,708 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 278 transitions. [2018-01-24 13:17:54,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:17:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 278 transitions. [2018-01-24 13:17:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 13:17:54,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:54,709 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:54,710 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:54,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560827, now seen corresponding path program 1 times [2018-01-24 13:17:54,710 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:54,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:54,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:54,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:54,719 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:54,720 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:54,720 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:54,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,725 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:54,765 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:54,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:54,766 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:54,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:54,772 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:54,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:54,866 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-24 13:17:54,880 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-24 13:17:54,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:54,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:54,931 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-24 13:17:54,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 13:17:55,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-24 13:17:55,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-24 13:17:55,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-24 13:17:55,017 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-24 13:17:55,017 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:55,029 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-24 13:17:55,050 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:55,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-01-24 13:17:55,050 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:55,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:17:55,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:17:55,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:17:55,051 INFO L87 Difference]: Start difference. First operand 213 states and 278 transitions. Second operand 8 states. [2018-01-24 13:17:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:55,255 INFO L93 Difference]: Finished difference Result 260 states and 328 transitions. [2018-01-24 13:17:55,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:17:55,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-24 13:17:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:55,256 INFO L225 Difference]: With dead ends: 260 [2018-01-24 13:17:55,256 INFO L226 Difference]: Without dead ends: 259 [2018-01-24 13:17:55,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:17:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-24 13:17:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2018-01-24 13:17:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 13:17:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 294 transitions. [2018-01-24 13:17:55,269 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 294 transitions. Word has length 55 [2018-01-24 13:17:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:55,270 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 294 transitions. [2018-01-24 13:17:55,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:17:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 294 transitions. [2018-01-24 13:17:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 13:17:55,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:55,270 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:55,270 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560826, now seen corresponding path program 1 times [2018-01-24 13:17:55,271 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:55,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:55,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:55,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:55,272 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:55,279 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:55,279 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:55,279 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:55,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:55,286 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:55,332 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:55,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:55,332 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:55,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:55,351 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:55,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:55,497 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-24 13:17:55,498 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-24 13:17:55,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,510 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-24 13:17:55,511 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-24 13:17:55,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,521 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-01-24 13:17:55,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-24 13:17:55,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-01-24 13:17:55,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,571 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 33 treesize of output 25 [2018-01-24 13:17:55,572 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 25 treesize of output 14 [2018-01-24 13:17:55,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-01-24 13:17:55,609 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-24 13:17:55,609 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:55,704 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:17:55,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,715 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 8 treesize of output 6 [2018-01-24 13:17:55,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:55,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-01-24 13:17:55,739 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-24 13:17:55,759 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:55,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 8] imperfect sequences [] total 20 [2018-01-24 13:17:55,759 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:55,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:17:55,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:17:55,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:17:55,760 INFO L87 Difference]: Start difference. First operand 225 states and 294 transitions. Second operand 14 states. [2018-01-24 13:17:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:56,420 INFO L93 Difference]: Finished difference Result 385 states and 497 transitions. [2018-01-24 13:17:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 13:17:56,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-01-24 13:17:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:56,422 INFO L225 Difference]: With dead ends: 385 [2018-01-24 13:17:56,422 INFO L226 Difference]: Without dead ends: 384 [2018-01-24 13:17:56,422 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 13:17:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-24 13:17:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 225. [2018-01-24 13:17:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-24 13:17:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2018-01-24 13:17:56,439 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 55 [2018-01-24 13:17:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:56,439 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2018-01-24 13:17:56,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:17:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2018-01-24 13:17:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 13:17:56,440 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:56,440 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:56,440 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash -115996377, now seen corresponding path program 1 times [2018-01-24 13:17:56,440 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:56,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:56,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:56,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:56,441 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:56,451 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:56,451 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:56,451 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:56,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:56,459 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:56,514 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:56,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:56,515 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:56,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:56,521 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:56,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:56,579 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-24 13:17:56,581 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-24 13:17:56,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,590 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-24 13:17:56,592 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-24 13:17:56,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 13:17:56,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-24 13:17:56,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-01-24 13:17:56,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,636 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 19 treesize of output 15 [2018-01-24 13:17:56,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 13:17:56,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:56,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2018-01-24 13:17:56,676 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-24 13:17:56,676 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:56,801 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-24 13:17:56,821 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:56,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-01-24 13:17:56,822 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:56,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:17:56,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:17:56,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:17:56,822 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 10 states. [2018-01-24 13:17:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:57,258 INFO L93 Difference]: Finished difference Result 355 states and 451 transitions. [2018-01-24 13:17:57,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 13:17:57,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-01-24 13:17:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:57,260 INFO L225 Difference]: With dead ends: 355 [2018-01-24 13:17:57,260 INFO L226 Difference]: Without dead ends: 354 [2018-01-24 13:17:57,261 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2018-01-24 13:17:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-24 13:17:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 229. [2018-01-24 13:17:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-24 13:17:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 298 transitions. [2018-01-24 13:17:57,275 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 298 transitions. Word has length 57 [2018-01-24 13:17:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:57,275 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 298 transitions. [2018-01-24 13:17:57,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:17:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 298 transitions. [2018-01-24 13:17:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 13:17:57,276 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:57,276 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:57,276 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash -115996378, now seen corresponding path program 1 times [2018-01-24 13:17:57,276 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:57,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:57,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:57,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:57,277 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:57,287 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:57,287 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:57,287 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:57,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:57,295 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:57,349 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:57,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:57,349 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:57,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:57,356 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:57,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:17:57,408 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:57,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-24 13:17:57,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:57,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:57,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-24 13:17:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:17:57,452 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:57,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-01-24 13:17:57,452 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:57,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:17:57,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:17:57,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:17:57,453 INFO L87 Difference]: Start difference. First operand 229 states and 298 transitions. Second operand 4 states. [2018-01-24 13:17:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:57,552 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2018-01-24 13:17:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:17:57,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-01-24 13:17:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:57,554 INFO L225 Difference]: With dead ends: 247 [2018-01-24 13:17:57,554 INFO L226 Difference]: Without dead ends: 245 [2018-01-24 13:17:57,555 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:17:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-24 13:17:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2018-01-24 13:17:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 13:17:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 287 transitions. [2018-01-24 13:17:57,577 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 287 transitions. Word has length 57 [2018-01-24 13:17:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:57,578 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 287 transitions. [2018-01-24 13:17:57,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:17:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 287 transitions. [2018-01-24 13:17:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 13:17:57,578 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:57,579 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:57,579 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash 156065119, now seen corresponding path program 1 times [2018-01-24 13:17:57,579 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:57,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:57,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:57,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:57,580 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:57,589 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:57,589 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:57,589 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:57,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:57,594 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:57,629 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:57,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:57,629 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:57,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:57,635 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:57,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:57,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:17:57,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:17:57,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:17:57,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:57,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:57,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-24 13:17:57,717 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-24 13:17:57,719 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-24 13:17:57,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:57,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:57,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:17:57,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-01-24 13:17:57,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 13:17:57,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-01-24 13:17:57,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 13:17:57,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:17:57,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:17:57,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-01-24 13:17:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:57,826 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:57,930 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 11 treesize of output 9 [2018-01-24 13:17:57,938 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 10 treesize of output 3 [2018-01-24 13:17:57,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:57,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:17:57,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:17:57,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-01-24 13:17:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:17:58,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:58,048 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 34 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:17:58,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:58,051 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:58,109 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 13:17:58,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 13:17:58,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-24 13:17:58,109 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:17:58,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 13:17:58,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 13:17:58,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:17:58,110 INFO L87 Difference]: Start difference. First operand 227 states and 287 transitions. Second operand 21 states. [2018-01-24 13:17:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:17:58,998 INFO L93 Difference]: Finished difference Result 431 states and 527 transitions. [2018-01-24 13:17:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 13:17:58,999 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-01-24 13:17:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:17:59,000 INFO L225 Difference]: With dead ends: 431 [2018-01-24 13:17:59,000 INFO L226 Difference]: Without dead ends: 394 [2018-01-24 13:17:59,001 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 13:17:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-01-24 13:17:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 227. [2018-01-24 13:17:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-24 13:17:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 285 transitions. [2018-01-24 13:17:59,017 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 285 transitions. Word has length 59 [2018-01-24 13:17:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:17:59,017 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 285 transitions. [2018-01-24 13:17:59,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 13:17:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 285 transitions. [2018-01-24 13:17:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 13:17:59,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:17:59,018 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:17:59,018 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:17:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash 196634183, now seen corresponding path program 1 times [2018-01-24 13:17:59,018 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:17:59,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:59,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:59,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:17:59,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:17:59,026 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 13:17:59,026 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 13:17:59,026 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 13:17:59,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:59,060 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 13:17:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:59,107 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 13:17:59,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:17:59,107 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:17:59,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:17:59,113 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:17:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:17:59,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:17:59,303 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-24 13:17:59,304 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-24 13:17:59,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:59,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:59,312 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-24 13:17:59,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-24 13:17:59,405 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 22 treesize of output 16 [2018-01-24 13:17:59,410 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 16 treesize of output 7 [2018-01-24 13:17:59,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:17:59,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:59,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:17:59,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2018-01-24 13:17:59,625 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-24 13:17:59,626 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:17:59,924 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-24 13:17:59,957 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:17:59,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 19 [2018-01-24 13:17:59,957 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:17:59,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:17:59,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:17:59,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-01-24 13:17:59,958 INFO L87 Difference]: Start difference. First operand 227 states and 285 transitions. Second operand 14 states. [2018-01-24 13:18:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:18:00,811 INFO L93 Difference]: Finished difference Result 499 states and 622 transitions. [2018-01-24 13:18:00,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 13:18:00,812 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-01-24 13:18:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:18:00,813 INFO L225 Difference]: With dead ends: 499 [2018-01-24 13:18:00,813 INFO L226 Difference]: Without dead ends: 498 [2018-01-24 13:18:00,814 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=605, Invalid=1747, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 13:18:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-01-24 13:18:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 264. [2018-01-24 13:18:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-24 13:18:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 334 transitions. [2018-01-24 13:18:00,834 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 334 transitions. Word has length 59 [2018-01-24 13:18:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:18:00,834 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 334 transitions. [2018-01-24 13:18:00,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:18:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 334 transitions. [2018-01-24 13:18:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 13:18:00,835 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:18:00,835 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-24 13:18:00,835 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:18:00,835 INFO L82 PathProgramCache]: Analyzing trace with hash 740017122, now seen corresponding path program 2 times [2018-01-24 13:18:00,835 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:18:00,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:18:00,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:18:00,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:18:00,836 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:18:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:18:00,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:18:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:18:00,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:18:00,905 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:18:00,931 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:18:00,931 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:18:00,942 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:18:00,956 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:18:00,960 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:18:00,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:18:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:18:00,984 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:18:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:18:01,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:18:01,033 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 38 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:18:01,036 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:18:01,037 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:18:01,049 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:18:01,072 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:18:01,091 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:18:01,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:18:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:18:01,102 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:18:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:18:01,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:18:01,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 5, 5] total 9 [2018-01-24 13:18:01,112 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:18:01,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:18:01,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:18:01,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:18:01,113 INFO L87 Difference]: Start difference. First operand 264 states and 334 transitions. Second operand 8 states. [2018-01-24 13:18:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:18:01,205 INFO L93 Difference]: Finished difference Result 420 states and 534 transitions. [2018-01-24 13:18:01,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:18:01,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-01-24 13:18:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:18:01,206 INFO L225 Difference]: With dead ends: 420 [2018-01-24 13:18:01,206 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 13:18:01,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 229 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:18:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 13:18:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2018-01-24 13:18:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-24 13:18:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 291 transitions. [2018-01-24 13:18:01,231 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 291 transitions. Word has length 60 [2018-01-24 13:18:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:18:01,231 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 291 transitions. [2018-01-24 13:18:01,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:18:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 291 transitions. [2018-01-24 13:18:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 13:18:01,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:18:01,232 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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] [2018-01-24 13:18:01,232 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:18:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash 257738368, now seen corresponding path program 1 times [2018-01-24 13:18:01,232 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:18:01,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:18:01,233 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:18:01,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:18:01,233 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:18:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:18:01,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:18:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:18:01,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:18:01,596 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:18:01,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:18:01,603 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:18:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:18:01,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:18:01,669 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-24 13:18:01,670 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-24 13:18:01,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 13:18:01,681 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 26 treesize of output 21 [2018-01-24 13:18:01,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 13:18:01,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2018-01-24 13:18:01,712 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 36 treesize of output 29 [2018-01-24 13:18:01,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,717 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 29 treesize of output 37 [2018-01-24 13:18:01,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2018-01-24 13:18:01,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:18:01,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-01-24 13:18:01,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-01-24 13:18:01,793 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 10 treesize of output 9 [2018-01-24 13:18:01,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-01-24 13:18:01,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 13:18:01,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 13:18:01,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-24 13:18:01,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-01-24 13:18:01,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 13:18:01,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2018-01-24 13:18:01,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-01-24 13:18:01,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:01,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 13:18:01,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:01,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2018-01-24 13:18:02,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-24 13:18:02,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-24 13:18:02,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:66 [2018-01-24 13:18:02,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-01-24 13:18:02,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,077 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 4 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 13:18:02,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 13:18:02,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:18:02,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 13:18:02,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:208 [2018-01-24 13:18:02,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 98 [2018-01-24 13:18:02,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,271 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 127 [2018-01-24 13:18:02,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 89 [2018-01-24 13:18:02,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,366 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 127 [2018-01-24 13:18:02,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 81 [2018-01-24 13:18:02,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,444 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 113 [2018-01-24 13:18:02,444 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,460 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-24 13:18:02,495 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:373, output treesize:314 [2018-01-24 13:18:02,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 65 [2018-01-24 13:18:02,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-01-24 13:18:02,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,812 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 42 treesize of output 52 [2018-01-24 13:18:02,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 70 [2018-01-24 13:18:02,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,881 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 37 treesize of output 49 [2018-01-24 13:18:02,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-01-24 13:18:02,897 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:02,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:02,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 85 [2018-01-24 13:18:02,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,934 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:02,938 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 41 treesize of output 51 [2018-01-24 13:18:02,938 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:02,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 25 [2018-01-24 13:18:02,956 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:02,962 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:02,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-24 13:18:02,977 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:321, output treesize:46 [2018-01-24 13:18:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:18:03,067 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:18:03,181 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-24 13:18:03,183 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-24 13:18:03,188 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-24 13:18:03,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:86 [2018-01-24 13:18:03,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 262 [2018-01-24 13:18:03,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:03,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:03,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:144, output treesize:259 [2018-01-24 13:18:04,825 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-24 13:18:04,846 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-24 13:18:04,847 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-24 13:18:04,854 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-24 13:18:04,856 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:04,864 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:04,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-01-24 13:18:04,922 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:285, output treesize:324 [2018-01-24 13:18:08,360 WARN L143 SmtUtils]: Spent 1337ms on a formula simplification that was a NOOP. DAG size: 68 [2018-01-24 13:18:09,173 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 268 [2018-01-24 13:18:09,200 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 9 treesize of output 8 [2018-01-24 13:18:09,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,209 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 125 [2018-01-24 13:18:09,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 95 [2018-01-24 13:18:09,255 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,255 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,255 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,258 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 88 treesize of output 98 [2018-01-24 13:18:09,260 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,260 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,261 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,261 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 108 [2018-01-24 13:18:09,266 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,267 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,267 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:09,268 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:09,270 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 131 [2018-01-24 13:18:09,273 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,291 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,302 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,321 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,321 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 99 [2018-01-24 13:18:09,325 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,325 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 102 [2018-01-24 13:18:09,330 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,330 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,331 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,331 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 124 [2018-01-24 13:18:09,336 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,355 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,366 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,416 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-01-24 13:18:09,449 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,449 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,450 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,451 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,451 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,452 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,452 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,455 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 116 [2018-01-24 13:18:09,471 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,523 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 56 treesize of output 44 [2018-01-24 13:18:09,525 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,526 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,526 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,528 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,529 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,529 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,530 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 60 [2018-01-24 13:18:09,536 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,561 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,563 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 54 treesize of output 44 [2018-01-24 13:18:09,565 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,565 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,566 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,566 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,566 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,567 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,567 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-01-24 13:18:09,568 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,576 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,586 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,588 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 70 [2018-01-24 13:18:09,616 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,617 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,617 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,618 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,619 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,620 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,620 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,622 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 122 [2018-01-24 13:18:09,635 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,687 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 56 treesize of output 46 [2018-01-24 13:18:09,689 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,689 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,689 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 70 [2018-01-24 13:18:09,691 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,704 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:09,706 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 58 treesize of output 46 [2018-01-24 13:18:09,709 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,710 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,710 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,711 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,713 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,713 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,713 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,714 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:09,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 94 [2018-01-24 13:18:09,723 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,761 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,772 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:09,807 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 5 variables, input treesize:397, output treesize:26 [2018-01-24 13:18:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:18:12,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:18:12,822 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 40 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:18:12,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:18:12,825 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:18:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:18:12,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:18:12,900 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-24 13:18:12,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:18:12,947 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-24 13:18:12,948 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-24 13:18:12,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 13:18:12,958 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 26 treesize of output 21 [2018-01-24 13:18:12,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:12,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 13:18:12,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2018-01-24 13:18:12,973 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 36 treesize of output 29 [2018-01-24 13:18:12,975 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:12,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:12,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:12,978 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 29 treesize of output 37 [2018-01-24 13:18:12,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:12,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2018-01-24 13:18:13,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,037 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-24 13:18:13,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:40 [2018-01-24 13:18:13,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-01-24 13:18:13,143 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 10 treesize of output 9 [2018-01-24 13:18:13,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2018-01-24 13:18:13,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 13:18:13,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 13:18:13,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:58 [2018-01-24 13:18:13,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-01-24 13:18:13,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 13:18:13,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-24 13:18:13,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-01-24 13:18:13,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 13:18:13,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:74 [2018-01-24 13:18:13,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-24 13:18:13,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-24 13:18:13,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:74 [2018-01-24 13:18:13,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-01-24 13:18:13,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 13:18:13,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:80 [2018-01-24 13:18:13,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 95 [2018-01-24 13:18:13,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,648 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 127 [2018-01-24 13:18:13,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:13,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:120 [2018-01-24 13:18:13,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 70 [2018-01-24 13:18:13,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 26 [2018-01-24 13:18:13,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:13,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:13,838 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 55 [2018-01-24 13:18:13,839 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-24 13:18:13,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:13,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:13,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:106, output treesize:15 [2018-01-24 13:18:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:18:13,893 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:18:14,030 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-24 13:18:14,033 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-24 13:18:14,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:14,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:86 [2018-01-24 13:18:24,677 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-24 13:18:24,690 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-24 13:18:24,691 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-24 13:18:24,706 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-24 13:18:24,707 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:24,715 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:18:24,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-01-24 13:18:24,798 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:170, output treesize:210 [2018-01-24 13:18:31,300 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 173 [2018-01-24 13:18:31,329 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:18:31,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,331 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:18:31,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,332 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 167 treesize of output 158 [2018-01-24 13:18:31,334 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 148 [2018-01-24 13:18:31,335 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,350 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 138 [2018-01-24 13:18:31,393 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 122 [2018-01-24 13:18:31,425 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,426 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,426 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,429 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 106 treesize of output 118 [2018-01-24 13:18:31,432 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,432 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,433 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,433 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,433 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,433 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 121 [2018-01-24 13:18:31,440 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,441 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,441 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,441 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,441 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,442 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:31,444 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,447 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 131 [2018-01-24 13:18:31,448 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,462 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,474 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,526 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 128 [2018-01-24 13:18:31,531 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,531 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,531 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,532 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 140 [2018-01-24 13:18:31,535 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,536 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,536 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,536 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,537 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,537 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,537 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,538 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,538 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,538 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,539 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:31,544 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 204 [2018-01-24 13:18:31,545 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,569 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,583 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,629 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:31,657 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 75 [2018-01-24 13:18:31,688 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,689 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,689 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,689 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,690 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,691 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,691 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,691 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 126 [2018-01-24 13:18:31,695 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,719 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 61 treesize of output 49 [2018-01-24 13:18:31,721 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,721 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,721 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,724 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:31,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 84 [2018-01-24 13:18:31,729 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,748 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,751 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,754 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 87 [2018-01-24 13:18:31,789 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,789 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,789 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,790 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,790 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,790 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,790 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,791 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,791 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,791 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,792 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,792 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,792 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,792 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,793 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,798 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,799 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 0 case distinctions, treesize of input 76 treesize of output 204 [2018-01-24 13:18:31,799 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,835 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 84 treesize of output 68 [2018-01-24 13:18:31,862 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,862 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,863 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,863 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,863 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,863 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,864 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,864 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,864 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,865 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,865 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,865 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,866 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,866 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,866 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,867 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:18:31,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:18:31,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 127 [2018-01-24 13:18:31,873 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,891 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,895 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:18:31,902 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:31,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:18:31,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:18:31,920 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 4 variables, input treesize:254, output treesize:31 Received shutdown request... [2018-01-24 13:18:33,972 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:18:33,973 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:18:33,977 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:18:33,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:18:33 BoogieIcfgContainer [2018-01-24 13:18:33,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:18:33,978 INFO L168 Benchmark]: Toolchain (without parser) took 54741.86 ms. Allocated memory was 302.0 MB in the beginning and 688.4 MB in the end (delta: 386.4 MB). Free memory was 260.9 MB in the beginning and 473.8 MB in the end (delta: -212.8 MB). Peak memory consumption was 173.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:18:33,979 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:18:33,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.38 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 249.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:18:33,980 INFO L168 Benchmark]: Boogie Preprocessor took 41.76 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:18:33,980 INFO L168 Benchmark]: RCFGBuilder took 510.64 ms. Allocated memory is still 302.0 MB. Free memory was 247.0 MB in the beginning and 218.0 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. [2018-01-24 13:18:33,980 INFO L168 Benchmark]: TraceAbstraction took 53942.83 ms. Allocated memory was 302.0 MB in the beginning and 688.4 MB in the end (delta: 386.4 MB). Free memory was 218.0 MB in the beginning and 473.8 MB in the end (delta: -255.7 MB). Peak memory consumption was 130.7 MB. Max. memory is 5.3 GB. [2018-01-24 13:18:33,982 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 238.38 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 249.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 41.76 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 510.64 ms. Allocated memory is still 302.0 MB. Free memory was 247.0 MB in the beginning and 218.0 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53942.83 ms. Allocated memory was 302.0 MB in the beginning and 688.4 MB in the end (delta: 386.4 MB). Free memory was 218.0 MB in the beginning and 473.8 MB in the end (delta: -255.7 MB). Peak memory consumption was 130.7 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 642). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 61 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 41 error locations. TIMEOUT Result, 53.8s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2532 SDtfs, 6830 SDslu, 7251 SDs, 0 SdLazy, 5605 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2466 GetRequests, 2009 SyntacticMatches, 58 SemanticMatches, 399 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=32, 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, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 1851 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2357 NumberOfCodeBlocks, 2357 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 2790 ConstructedInterpolants, 172 QuantifiedInterpolants, 869376 SizeOfPredicates, 155 NumberOfNonLiveVariables, 4850 ConjunctsInSsa, 284 ConjunctsInUnsatCore, 66 InterpolantComputations, 32 PerfectInterpolantSequences, 352/633 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-18-33-991.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-18-33-991.csv Completed graceful shutdown