java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_vararg_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:42:15,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:42:15,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:42:16,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:42:16,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:42:16,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:42:16,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:42:16,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:42:16,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:42:16,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:42:16,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:42:16,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:42:16,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:42:16,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:42:16,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:42:16,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:42:16,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:42:16,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:42:16,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:42:16,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:42:16,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:42:16,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:42:16,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:42:16,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:42:16,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:42:16,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:42:16,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:42:16,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:42:16,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:42:16,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:42:16,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:42:16,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:42:16,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:42:16,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:42:16,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:42:16,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:42:16,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:42:16,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:42:16,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:42:16,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:42:16,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:42:16,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:42:16,080 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:42:16,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:42:16,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:42:16,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:42:16,083 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:42:16,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:42:16,083 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:42:16,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:42:16,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:42:16,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:42:16,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:42:16,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:42:16,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:42:16,086 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:42:16,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:42:16,086 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:42:16,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:42:16,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:42:16,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:42:16,087 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:42:16,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:42:16,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:42:16,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:42:16,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:42:16,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:42:16,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:42:16,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:42:16,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:42:16,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:42:16,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:42:16,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:42:16,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:42:16,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:42:16,147 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:42:16,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_vararg_ground.i [2019-09-07 10:42:16,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ed20eec/a68a0a15719e479d8ce2eddb953119fa/FLAG913a00b76 [2019-09-07 10:42:16,660 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:42:16,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_vararg_ground.i [2019-09-07 10:42:16,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ed20eec/a68a0a15719e479d8ce2eddb953119fa/FLAG913a00b76 [2019-09-07 10:42:17,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ed20eec/a68a0a15719e479d8ce2eddb953119fa [2019-09-07 10:42:17,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:42:17,042 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:42:17,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:42:17,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:42:17,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:42:17,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2701da4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17, skipping insertion in model container [2019-09-07 10:42:17,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,060 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:42:17,077 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:42:17,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:42:17,253 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:42:17,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:42:17,293 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:42:17,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17 WrapperNode [2019-09-07 10:42:17,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:42:17,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:42:17,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:42:17,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:42:17,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (1/1) ... [2019-09-07 10:42:17,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:42:17,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:42:17,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:42:17,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:42:17,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-07 10:42:17,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:42:17,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:42:17,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:42:17,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:42:17,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:42:17,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:42:17,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:42:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:42:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:42:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:42:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:42:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:42:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:42:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:42:17,720 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:42:17,720 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:42:17,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:42:17 BoogieIcfgContainer [2019-09-07 10:42:17,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:42:17,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:42:17,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:42:17,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:42:17,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:42:17" (1/3) ... [2019-09-07 10:42:17,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294db20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:42:17, skipping insertion in model container [2019-09-07 10:42:17,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:42:17" (2/3) ... [2019-09-07 10:42:17,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294db20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:42:17, skipping insertion in model container [2019-09-07 10:42:17,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:42:17" (3/3) ... [2019-09-07 10:42:17,730 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_vararg_ground.i [2019-09-07 10:42:17,742 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:42:17,750 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:42:17,779 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:42:17,815 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:42:17,816 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:42:17,816 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:42:17,817 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:42:17,817 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:42:17,817 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:42:17,817 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:42:17,817 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:42:17,817 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:42:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-07 10:42:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 10:42:17,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:17,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:17,846 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash -161951569, now seen corresponding path program 1 times [2019-09-07 10:42:17,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:17,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:17,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:17,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:17,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:42:17,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:42:17,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:42:17,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:42:18,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:42:18,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:42:18,010 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-09-07 10:42:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:18,038 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-09-07 10:42:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:42:18,040 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-07 10:42:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:18,049 INFO L225 Difference]: With dead ends: 44 [2019-09-07 10:42:18,050 INFO L226 Difference]: Without dead ends: 21 [2019-09-07 10:42:18,054 INFO L628 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 [2019-09-07 10:42:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-07 10:42:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-07 10:42:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-07 10:42:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-07 10:42:18,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-09-07 10:42:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:18,099 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-07 10:42:18,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:42:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-07 10:42:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:42:18,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:18,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:18,103 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 932758337, now seen corresponding path program 1 times [2019-09-07 10:42:18,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:18,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:18,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:18,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:18,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:42:18,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:42:18,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:42:18,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:42:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:42:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:42:18,237 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2019-09-07 10:42:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:18,274 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-09-07 10:42:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:42:18,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:42:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:18,277 INFO L225 Difference]: With dead ends: 36 [2019-09-07 10:42:18,277 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 10:42:18,278 INFO L628 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 [2019-09-07 10:42:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 10:42:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-07 10:42:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:42:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-07 10:42:18,285 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-09-07 10:42:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:18,285 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-07 10:42:18,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:42:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-07 10:42:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 10:42:18,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:18,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:18,287 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1344598495, now seen corresponding path program 1 times [2019-09-07 10:42:18,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:18,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:18,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:18,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:42:18,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:18,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:42:18,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:18,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:42:18,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:42:18,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:18,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:42:18,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:42:18,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:42:18,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:42:18,501 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-07 10:42:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:18,538 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-07 10:42:18,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:42:18,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-07 10:42:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:18,540 INFO L225 Difference]: With dead ends: 38 [2019-09-07 10:42:18,541 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 10:42:18,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:42:18,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 10:42:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-07 10:42:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:42:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-07 10:42:18,548 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-09-07 10:42:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:18,548 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-07 10:42:18,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:42:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-07 10:42:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:42:18,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:18,550 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:18,550 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:18,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1985999101, now seen corresponding path program 2 times [2019-09-07 10:42:18,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:18,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:18,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:42:18,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:18,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:42:18,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:42:18,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 10:42:18,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:18,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:42:18,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:42:18,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 10:42:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-07 10:42:18,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:42:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:42:18,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:42:18,719 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-07 10:42:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:18,807 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-09-07 10:42:18,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:42:18,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-07 10:42:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:18,809 INFO L225 Difference]: With dead ends: 44 [2019-09-07 10:42:18,809 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 10:42:18,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:42:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 10:42:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 10:42:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:42:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-07 10:42:18,816 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-09-07 10:42:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:18,817 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-07 10:42:18,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:42:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-07 10:42:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:42:18,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:18,818 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:18,819 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1184989984, now seen corresponding path program 1 times [2019-09-07 10:42:18,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:18,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:18,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:18,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:18,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:42:18,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:18,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:18,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:18,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:42:18,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:42:18,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:18,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:42:18,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:42:18,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:42:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:42:18,968 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-09-07 10:42:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:19,007 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-07 10:42:19,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:42:19,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-09-07 10:42:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:19,010 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:42:19,010 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 10:42:19,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:42:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 10:42:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-07 10:42:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 10:42:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-07 10:42:19,017 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-09-07 10:42:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:19,018 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-07 10:42:19,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:42:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-07 10:42:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 10:42:19,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:19,019 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:19,020 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash -514051138, now seen corresponding path program 2 times [2019-09-07 10:42:19,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:19,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:19,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:19,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:19,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:42:19,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:19,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:42:19,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:42:19,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:42:19,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:19,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:42:19,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:42:19,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:19,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:42:19,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:42:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:42:19,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:42:19,210 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2019-09-07 10:42:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:19,260 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-07 10:42:19,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:42:19,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-09-07 10:42:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:19,264 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:42:19,264 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 10:42:19,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:42:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 10:42:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-07 10:42:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:42:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-07 10:42:19,276 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2019-09-07 10:42:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:19,277 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-07 10:42:19,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:42:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-07 10:42:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:42:19,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:19,281 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:19,282 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1204996900, now seen corresponding path program 3 times [2019-09-07 10:42:19,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:19,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:19,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:42:19,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:19,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:19,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:42:19,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 10:42:19,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:19,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:42:19,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:19,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:42:19,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:42:19,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:42:19,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:42:19,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:42:19,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 10:42:19,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:19,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 10:42:19,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:42:19,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:42:19,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:42:19,630 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2019-09-07 10:42:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:19,936 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-09-07 10:42:19,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:42:19,937 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-09-07 10:42:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:19,938 INFO L225 Difference]: With dead ends: 58 [2019-09-07 10:42:19,938 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 10:42:19,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:42:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 10:42:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-09-07 10:42:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:42:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-07 10:42:19,953 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 27 [2019-09-07 10:42:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:19,953 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-07 10:42:19,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:42:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-07 10:42:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 10:42:19,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:19,955 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:19,955 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash -116499279, now seen corresponding path program 1 times [2019-09-07 10:42:19,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:19,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:19,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:42:20,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:20,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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) [2019-09-07 10:42:20,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:20,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:42:20,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:42:20,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:20,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:42:20,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:42:20,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:42:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:42:20,144 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 10 states. [2019-09-07 10:42:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:20,190 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-09-07 10:42:20,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:42:20,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-09-07 10:42:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:20,194 INFO L225 Difference]: With dead ends: 64 [2019-09-07 10:42:20,194 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 10:42:20,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:42:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 10:42:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-07 10:42:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 10:42:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-07 10:42:20,202 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2019-09-07 10:42:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:20,203 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-07 10:42:20,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:42:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-07 10:42:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:42:20,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:20,205 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:20,205 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1799315249, now seen corresponding path program 2 times [2019-09-07 10:42:20,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:20,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:20,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:20,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:20,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:42:20,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:20,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:20,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:20,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:42:20,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:20,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:42:20,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 10:42:20,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:20,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:42:20,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:42:20,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:42:20,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:42:20,405 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2019-09-07 10:42:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:20,455 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-09-07 10:42:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:42:20,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-09-07 10:42:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:20,456 INFO L225 Difference]: With dead ends: 66 [2019-09-07 10:42:20,457 INFO L226 Difference]: Without dead ends: 45 [2019-09-07 10:42:20,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:42:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-07 10:42:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-07 10:42:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 10:42:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-07 10:42:20,464 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2019-09-07 10:42:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:20,464 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-07 10:42:20,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:42:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-07 10:42:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 10:42:20,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:20,466 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:20,466 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:20,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash 217208173, now seen corresponding path program 3 times [2019-09-07 10:42:20,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:20,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:20,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:20,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:20,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:42:20,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:20,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:42:20,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:42:20,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 10:42:20,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:20,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:42:20,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 10:42:20,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:20,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-09-07 10:42:20,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:42:20,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:42:20,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:42:20,699 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 15 states. [2019-09-07 10:42:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:20,878 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-09-07 10:42:20,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:42:20,880 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-09-07 10:42:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:20,881 INFO L225 Difference]: With dead ends: 76 [2019-09-07 10:42:20,881 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 10:42:20,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:42:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 10:42:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-07 10:42:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:42:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-07 10:42:20,905 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2019-09-07 10:42:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:20,906 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-07 10:42:20,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:42:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-07 10:42:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 10:42:20,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:20,909 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:20,910 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1062510032, now seen corresponding path program 4 times [2019-09-07 10:42:20,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:20,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:20,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:20,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:20,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 10:42:21,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:21,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:21,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:21,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:42:21,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:21,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:42:21,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:42:21,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:21,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:42:21,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:42:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:42:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:42:21,117 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2019-09-07 10:42:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:21,168 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-09-07 10:42:21,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:42:21,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-09-07 10:42:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:21,170 INFO L225 Difference]: With dead ends: 74 [2019-09-07 10:42:21,170 INFO L226 Difference]: Without dead ends: 51 [2019-09-07 10:42:21,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:42:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-07 10:42:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-07 10:42:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 10:42:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-07 10:42:21,177 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 45 [2019-09-07 10:42:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:21,178 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-07 10:42:21,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:42:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-07 10:42:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:42:21,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:21,179 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:21,179 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1769479186, now seen corresponding path program 5 times [2019-09-07 10:42:21,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:21,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:21,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 10:42:21,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:21,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:21,323 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:42:21,394 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-07 10:42:21,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:21,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:42:21,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 10:42:21,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:21,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:42:21,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:42:21,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:42:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:42:21,427 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2019-09-07 10:42:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:21,484 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-09-07 10:42:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:42:21,484 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-09-07 10:42:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:21,485 INFO L225 Difference]: With dead ends: 76 [2019-09-07 10:42:21,485 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 10:42:21,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:42:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 10:42:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-07 10:42:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:42:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-07 10:42:21,492 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2019-09-07 10:42:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:21,493 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-07 10:42:21,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:42:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-07 10:42:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 10:42:21,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:21,494 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:21,494 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash -301852020, now seen corresponding path program 6 times [2019-09-07 10:42:21,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:21,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 2 proven. 121 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 10:42:21,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:21,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:42:21,623 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:42:21,652 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 10:42:21,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:21,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:42:21,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:21,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:42:21,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:42:21,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:42:21,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:42:21,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:42:21,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 10:42:22,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:22,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-09-07 10:42:22,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:42:22,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:42:22,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:42:22,015 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-09-07 10:42:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:26,885 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-09-07 10:42:26,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:42:26,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-09-07 10:42:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:26,886 INFO L225 Difference]: With dead ends: 88 [2019-09-07 10:42:26,887 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 10:42:26,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=1636, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:42:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 10:42:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-09-07 10:42:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 10:42:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-07 10:42:26,895 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 49 [2019-09-07 10:42:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:26,896 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-07 10:42:26,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:42:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-07 10:42:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:42:26,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:26,897 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:26,897 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1912674335, now seen corresponding path program 7 times [2019-09-07 10:42:26,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:26,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:26,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:26,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:26,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 10:42:27,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:27,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:27,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:27,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:42:27,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream Closed [2019-09-07 10:42:27,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:27,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:42:27,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:42:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:42:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:42:27,136 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 16 states. [2019-09-07 10:42:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:27,199 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-09-07 10:42:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:42:27,201 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-09-07 10:42:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:27,202 INFO L225 Difference]: With dead ends: 96 [2019-09-07 10:42:27,202 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 10:42:27,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:42:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 10:42:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-07 10:42:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:42:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-07 10:42:27,221 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 59 [2019-09-07 10:42:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:27,221 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-07 10:42:27,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:42:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-07 10:42:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 10:42:27,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:27,223 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:27,223 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:27,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1454776703, now seen corresponding path program 8 times [2019-09-07 10:42:27,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:27,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:27,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:42:27,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 10:42:27,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:27,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:27,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:42:27,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:42:27,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:27,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:42:27,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 10:42:27,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:27,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:42:27,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:42:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:42:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:42:27,519 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2019-09-07 10:42:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:27,586 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-09-07 10:42:27,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:42:27,586 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-07 10:42:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:27,587 INFO L225 Difference]: With dead ends: 98 [2019-09-07 10:42:27,588 INFO L226 Difference]: Without dead ends: 67 [2019-09-07 10:42:27,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:42:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-07 10:42:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-07 10:42:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 10:42:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-07 10:42:27,596 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 61 [2019-09-07 10:42:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:27,597 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-07 10:42:27,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:42:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-07 10:42:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:42:27,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:27,598 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:27,599 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:27,599 INFO L82 PathProgramCache]: Analyzing trace with hash -830116963, now seen corresponding path program 9 times [2019-09-07 10:42:27,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:27,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:27,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:27,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:27,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 196 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 10:42:27,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:27,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:42:27,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:42:27,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:42:27,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:27,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:42:27,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-07 10:42:27,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:27,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 23 [2019-09-07 10:42:27,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:42:27,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:42:27,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:42:27,912 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 23 states. [2019-09-07 10:42:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:42:28,272 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-09-07 10:42:28,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:42:28,272 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2019-09-07 10:42:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:42:28,273 INFO L225 Difference]: With dead ends: 112 [2019-09-07 10:42:28,273 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 10:42:28,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=457, Invalid=949, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:42:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 10:42:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-07 10:42:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-07 10:42:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-09-07 10:42:28,281 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-09-07 10:42:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:42:28,281 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-09-07 10:42:28,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:42:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-09-07 10:42:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:42:28,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:42:28,282 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:42:28,283 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:42:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:42:28,283 INFO L82 PathProgramCache]: Analyzing trace with hash 206641728, now seen corresponding path program 10 times [2019-09-07 10:42:28,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:42:28,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:42:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:28,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:42:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:42:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 4 proven. 225 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 10:42:28,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:28,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:42:28,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:28,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:42:28,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:42:28,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:42:28,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:42:35,136 WARN L188 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-07 10:42:36,042 WARN L188 SmtUtils]: Spent 847.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-07 10:42:36,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:42:36,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 66 [2019-09-07 10:42:36,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:36,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:36,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:36,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:36,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:36,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:36,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-07 10:42:36,135 INFO L567 ElimStorePlain]: treesize reduction 91, result has 15.0 percent of original size [2019-09-07 10:42:36,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:42:36,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:46, output treesize:3 [2019-09-07 10:42:36,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:42:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 10:42:36,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:42:36,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2019-09-07 10:42:36,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:42:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:42:36,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=783, Unknown=5, NotChecked=0, Total=992 [2019-09-07 10:42:36,210 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-09-07 10:42:48,866 WARN L188 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-09-07 10:42:50,949 WARN L188 SmtUtils]: Spent 952.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-07 10:42:52,351 WARN L188 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-07 10:42:55,417 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 10:42:59,369 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 10:43:02,677 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 10:43:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:02,843 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-09-07 10:43:02,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:43:02,843 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 67 [2019-09-07 10:43:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:02,844 INFO L225 Difference]: With dead ends: 125 [2019-09-07 10:43:02,845 INFO L226 Difference]: Without dead ends: 75 [2019-09-07 10:43:02,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=619, Invalid=2675, Unknown=12, NotChecked=0, Total=3306 [2019-09-07 10:43:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-07 10:43:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-09-07 10:43:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 10:43:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-09-07 10:43:02,853 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2019-09-07 10:43:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:02,853 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-09-07 10:43:02,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:43:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-09-07 10:43:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:43:02,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:02,854 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:02,855 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1511320867, now seen corresponding path program 11 times [2019-09-07 10:43:02,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:02,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 4 proven. 256 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 10:43:03,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:03,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:43:03,120 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:03,495 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-09-07 10:43:03,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:03,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:43:03,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:43:03,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:03,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:43:03,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:43:03,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:43:03,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:43:03,531 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 20 states. [2019-09-07 10:43:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:03,590 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2019-09-07 10:43:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:43:03,594 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2019-09-07 10:43:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:03,595 INFO L225 Difference]: With dead ends: 112 [2019-09-07 10:43:03,595 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 10:43:03,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:43:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 10:43:03,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-07 10:43:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:43:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-07 10:43:03,601 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2019-09-07 10:43:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:03,602 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-07 10:43:03,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:43:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-07 10:43:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 10:43:03,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:03,603 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:03,603 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:03,604 INFO L82 PathProgramCache]: Analyzing trace with hash 698132929, now seen corresponding path program 12 times [2019-09-07 10:43:03,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:03,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:03,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:03,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:03,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 4 proven. 289 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 10:43:03,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:03,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:43:03,837 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:43:03,883 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 10:43:03,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:03,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:43:03,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:04,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:43:04,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:43:04,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:43:04,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:43:04,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:43:04,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:43:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-07 10:43:04,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:04,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2019-09-07 10:43:04,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:43:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:43:04,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:43:04,328 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 34 states. [2019-09-07 10:43:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:13,376 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-09-07 10:43:13,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:43:13,376 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2019-09-07 10:43:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:13,377 INFO L225 Difference]: With dead ends: 124 [2019-09-07 10:43:13,377 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 10:43:13,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=654, Invalid=2886, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:43:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 10:43:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-09-07 10:43:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 10:43:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-09-07 10:43:13,384 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 73 [2019-09-07 10:43:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:13,385 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-09-07 10:43:13,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:43:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-09-07 10:43:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:43:13,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:13,386 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:13,386 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1121748970, now seen corresponding path program 13 times [2019-09-07 10:43:13,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:13,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:13,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:13,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:13,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 6 proven. 324 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-07 10:43:13,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:13,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:13,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:43:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:13,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:43:13,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-07 10:43:13,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:13,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:43:13,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:43:13,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:43:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:43:13,759 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 22 states. [2019-09-07 10:43:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:13,863 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2019-09-07 10:43:13,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:43:13,864 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 83 [2019-09-07 10:43:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:13,865 INFO L225 Difference]: With dead ends: 132 [2019-09-07 10:43:13,865 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 10:43:13,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:43:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 10:43:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-09-07 10:43:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:43:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-07 10:43:13,875 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 83 [2019-09-07 10:43:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:13,877 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-07 10:43:13,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:43:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-07 10:43:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 10:43:13,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:13,881 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:13,881 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:13,882 INFO L82 PathProgramCache]: Analyzing trace with hash -405850188, now seen corresponding path program 14 times [2019-09-07 10:43:13,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:13,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:13,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:13,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:43:13,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 6 proven. 361 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-07 10:43:14,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:14,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:14,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:43:14,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:43:14,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:14,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:43:14,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-07 10:43:14,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:14,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:43:14,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:43:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:43:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:43:14,235 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 23 states. [2019-09-07 10:43:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:14,309 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2019-09-07 10:43:14,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:43:14,309 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2019-09-07 10:43:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:14,310 INFO L225 Difference]: With dead ends: 134 [2019-09-07 10:43:14,310 INFO L226 Difference]: Without dead ends: 91 [2019-09-07 10:43:14,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:43:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-07 10:43:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-09-07 10:43:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-07 10:43:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-07 10:43:14,315 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 85 [2019-09-07 10:43:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:14,316 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-07 10:43:14,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:43:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-07 10:43:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:43:14,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:14,317 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:14,317 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:14,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash 378111954, now seen corresponding path program 15 times [2019-09-07 10:43:14,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:14,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:14,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 6 proven. 400 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-07 10:43:14,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:14,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:43:14,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:43:14,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 10:43:14,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:14,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:43:14,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:15,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:43:15,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:43:15,100 INFO L375 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 19 treesize of output 10 [2019-09-07 10:43:15,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:43:15,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:43:15,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:43:15,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-09-07 10:43:15,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:43:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-09-07 10:43:15,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:15,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 37 [2019-09-07 10:43:15,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:43:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:43:15,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:43:15,249 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 37 states. [2019-09-07 10:43:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:23,664 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-09-07 10:43:23,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:43:23,667 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 87 [2019-09-07 10:43:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:23,668 INFO L225 Difference]: With dead ends: 159 [2019-09-07 10:43:23,668 INFO L226 Difference]: Without dead ends: 95 [2019-09-07 10:43:23,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=947, Invalid=3609, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 10:43:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-07 10:43:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-07 10:43:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-07 10:43:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-09-07 10:43:23,677 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 87 [2019-09-07 10:43:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:23,678 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-09-07 10:43:23,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:43:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-09-07 10:43:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 10:43:23,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:23,679 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:23,679 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:23,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1575854069, now seen corresponding path program 16 times [2019-09-07 10:43:23,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:23,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:23,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 6 proven. 441 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 10:43:23,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:23,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:23,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:43:24,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:43:24,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:24,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:43:24,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:43:24,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:24,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:43:24,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:43:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:43:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:43:24,055 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2019-09-07 10:43:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:24,160 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2019-09-07 10:43:24,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:43:24,161 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2019-09-07 10:43:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:24,163 INFO L225 Difference]: With dead ends: 142 [2019-09-07 10:43:24,163 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 10:43:24,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:43:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 10:43:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-09-07 10:43:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 10:43:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-07 10:43:24,173 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 91 [2019-09-07 10:43:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:24,174 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-07 10:43:24,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:43:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-07 10:43:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 10:43:24,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:24,175 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:24,175 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:24,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1051124115, now seen corresponding path program 17 times [2019-09-07 10:43:24,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:24,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:24,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 6 proven. 484 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 10:43:24,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:24,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:43:24,546 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:43:24,836 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 10:43:24,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:24,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:43:24,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 10:43:24,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:24,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:43:24,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:43:24,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:43:24,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:43:24,861 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 26 states. [2019-09-07 10:43:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:24,942 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2019-09-07 10:43:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:43:24,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-09-07 10:43:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:24,943 INFO L225 Difference]: With dead ends: 144 [2019-09-07 10:43:24,944 INFO L226 Difference]: Without dead ends: 99 [2019-09-07 10:43:24,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:43:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-07 10:43:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-09-07 10:43:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 10:43:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-07 10:43:24,951 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-09-07 10:43:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:24,951 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-07 10:43:24,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:43:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-07 10:43:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 10:43:24,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:24,952 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:24,953 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash -703188047, now seen corresponding path program 18 times [2019-09-07 10:43:24,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:24,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:24,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:24,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:24,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 6 proven. 529 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 10:43:25,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:25,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:43:25,344 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 10:43:25,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:25,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:43:25,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:25,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:43:25,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:43:25,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:43:25,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:43:25,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:43:25,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:43:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-09-07 10:43:25,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:25,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 42 [2019-09-07 10:43:25,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 10:43:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 10:43:25,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:43:25,888 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 42 states. [2019-09-07 10:43:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:37,337 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2019-09-07 10:43:37,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:43:37,337 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-09-07 10:43:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:37,339 INFO L225 Difference]: With dead ends: 156 [2019-09-07 10:43:37,339 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 10:43:37,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1072, Invalid=4478, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 10:43:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 10:43:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-09-07 10:43:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-07 10:43:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-07 10:43:37,347 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 95 [2019-09-07 10:43:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:37,348 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-07 10:43:37,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 10:43:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-07 10:43:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 10:43:37,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:37,349 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:37,350 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:37,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1639368582, now seen corresponding path program 19 times [2019-09-07 10:43:37,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:37,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:37,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:37,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:37,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 8 proven. 576 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 10:43:37,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:37,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:43:37,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:43:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:37,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:43:37,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-07 10:43:37,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:37,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:43:37,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:43:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:43:37,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:43:37,746 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 28 states. [2019-09-07 10:43:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:37,837 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2019-09-07 10:43:37,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:43:37,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 105 [2019-09-07 10:43:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:37,840 INFO L225 Difference]: With dead ends: 164 [2019-09-07 10:43:37,841 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 10:43:37,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:43:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 10:43:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-07 10:43:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-07 10:43:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-09-07 10:43:37,854 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 105 [2019-09-07 10:43:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:37,855 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-09-07 10:43:37,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:43:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-09-07 10:43:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:43:37,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:37,856 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:37,856 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash 907402404, now seen corresponding path program 20 times [2019-09-07 10:43:37,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:37,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:37,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:43:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 8 proven. 625 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 10:43:38,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:38,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:38,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:43:38,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:43:38,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:38,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:43:38,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-07 10:43:38,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:38,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:43:38,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:43:38,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:43:38,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:43:38,342 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 29 states. [2019-09-07 10:43:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:38,444 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-09-07 10:43:38,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:43:38,446 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 107 [2019-09-07 10:43:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:38,447 INFO L225 Difference]: With dead ends: 166 [2019-09-07 10:43:38,447 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 10:43:38,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:43:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 10:43:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-09-07 10:43:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 10:43:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-09-07 10:43:38,456 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-09-07 10:43:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:38,456 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-09-07 10:43:38,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:43:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-09-07 10:43:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 10:43:38,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:38,457 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:38,458 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:38,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:38,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1862541890, now seen corresponding path program 21 times [2019-09-07 10:43:38,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:38,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:38,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:38,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:38,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 676 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 10:43:38,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:38,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:43:38,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:43:38,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:43:38,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:38,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:43:38,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:39,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:43:39,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:43:39,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:43:39,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:43:39,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:43:39,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:43:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 9 proven. 70 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2019-09-07 10:43:39,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:39,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20] total 47 [2019-09-07 10:43:39,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:43:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:43:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1707, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:43:39,596 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 47 states. [2019-09-07 10:43:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:47,673 INFO L93 Difference]: Finished difference Result 178 states and 183 transitions. [2019-09-07 10:43:47,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:43:47,673 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 109 [2019-09-07 10:43:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:47,674 INFO L225 Difference]: With dead ends: 178 [2019-09-07 10:43:47,675 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 10:43:47,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1328, Invalid=5644, Unknown=0, NotChecked=0, Total=6972 [2019-09-07 10:43:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 10:43:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-09-07 10:43:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-07 10:43:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-09-07 10:43:47,684 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 109 [2019-09-07 10:43:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:47,685 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-09-07 10:43:47,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:43:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-09-07 10:43:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 10:43:47,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:47,686 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:47,686 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1000220823, now seen corresponding path program 22 times [2019-09-07 10:43:47,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:47,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:47,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:47,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:47,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 10 proven. 729 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:43:48,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:48,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:48,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:43:48,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:43:48,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:48,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:43:48,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-07 10:43:48,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:48,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:43:48,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:43:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:43:48,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:43:48,520 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 31 states. [2019-09-07 10:43:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:48,623 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2019-09-07 10:43:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:43:48,624 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 119 [2019-09-07 10:43:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:48,625 INFO L225 Difference]: With dead ends: 186 [2019-09-07 10:43:48,625 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 10:43:48,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:43:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 10:43:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-07 10:43:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-07 10:43:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-09-07 10:43:48,637 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 119 [2019-09-07 10:43:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:48,638 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-09-07 10:43:48,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:43:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-09-07 10:43:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 10:43:48,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:48,639 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:48,639 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash 86700341, now seen corresponding path program 23 times [2019-09-07 10:43:48,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:48,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:48,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 10 proven. 784 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:43:49,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:49,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:43:49,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:43:49,692 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-09-07 10:43:49,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:49,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:43:49,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-07 10:43:49,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:49,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 10:43:49,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:43:49,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:43:49,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:43:49,731 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 32 states. [2019-09-07 10:43:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:49,853 INFO L93 Difference]: Finished difference Result 188 states and 192 transitions. [2019-09-07 10:43:49,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:43:49,854 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 121 [2019-09-07 10:43:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:49,856 INFO L225 Difference]: With dead ends: 188 [2019-09-07 10:43:49,856 INFO L226 Difference]: Without dead ends: 127 [2019-09-07 10:43:49,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:43:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-07 10:43:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-07 10:43:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-07 10:43:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-09-07 10:43:49,870 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 121 [2019-09-07 10:43:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:49,871 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-09-07 10:43:49,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:43:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-09-07 10:43:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 10:43:49,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:49,872 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:49,873 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1633154477, now seen corresponding path program 24 times [2019-09-07 10:43:49,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:49,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:49,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:49,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:49,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 10 proven. 841 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 10:43:50,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:50,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:43:50,397 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 10:43:50,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:50,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:43:50,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 881 trivial. 0 not checked. [2019-09-07 10:43:50,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:50,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 14] total 44 [2019-09-07 10:43:50,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:43:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:43:50,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1336, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:43:50,639 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 44 states. [2019-09-07 10:43:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:51,651 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2019-09-07 10:43:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:43:51,652 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 123 [2019-09-07 10:43:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:51,653 INFO L225 Difference]: With dead ends: 214 [2019-09-07 10:43:51,653 INFO L226 Difference]: Without dead ends: 131 [2019-09-07 10:43:51,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1696, Invalid=3706, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 10:43:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-07 10:43:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-09-07 10:43:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-07 10:43:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-09-07 10:43:51,665 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 123 [2019-09-07 10:43:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:51,665 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-09-07 10:43:51,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:43:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-09-07 10:43:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 10:43:51,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:51,668 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:51,669 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2101425994, now seen corresponding path program 25 times [2019-09-07 10:43:51,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:51,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:51,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:51,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:51,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 10 proven. 900 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-07 10:43:52,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:52,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:43:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:43:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:52,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:43:52,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-07 10:43:52,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:52,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:43:52,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:43:52,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:43:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:43:52,304 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 34 states. [2019-09-07 10:43:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:52,439 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2019-09-07 10:43:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:43:52,440 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 127 [2019-09-07 10:43:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:52,441 INFO L225 Difference]: With dead ends: 196 [2019-09-07 10:43:52,441 INFO L226 Difference]: Without dead ends: 133 [2019-09-07 10:43:52,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:43:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-07 10:43:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-07 10:43:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-07 10:43:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2019-09-07 10:43:52,459 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 127 [2019-09-07 10:43:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:52,459 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2019-09-07 10:43:52,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:43:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2019-09-07 10:43:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 10:43:52,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:52,460 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:52,460 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash -113241260, now seen corresponding path program 26 times [2019-09-07 10:43:52,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:52,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:52,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:52,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:43:52,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 10 proven. 961 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-07 10:43:53,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:53,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:43:53,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:43:53,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:43:53,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:53,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:43:53,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-07 10:43:53,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:53,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:43:53,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:43:53,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:43:53,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:43:53,172 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 35 states. [2019-09-07 10:43:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:43:53,276 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2019-09-07 10:43:53,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:43:53,276 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 129 [2019-09-07 10:43:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:43:53,277 INFO L225 Difference]: With dead ends: 198 [2019-09-07 10:43:53,277 INFO L226 Difference]: Without dead ends: 135 [2019-09-07 10:43:53,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:43:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-07 10:43:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-09-07 10:43:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-07 10:43:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-09-07 10:43:53,285 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 129 [2019-09-07 10:43:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:43:53,286 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2019-09-07 10:43:53,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:43:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2019-09-07 10:43:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 10:43:53,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:43:53,287 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:43:53,287 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:43:53,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:43:53,287 INFO L82 PathProgramCache]: Analyzing trace with hash -728158606, now seen corresponding path program 27 times [2019-09-07 10:43:53,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:43:53,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:43:53,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:53,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:43:53,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:43:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:43:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 10 proven. 1024 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-07 10:43:53,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:43:53,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:43:53,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:43:53,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 10:43:53,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:43:53,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:43:53,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:43:54,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:43:54,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:43:54,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:43:54,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:43:54,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:43:54,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:43:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 12 proven. 102 refuted. 0 times theorem prover too weak. 1052 trivial. 0 not checked. [2019-09-07 10:43:54,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:43:54,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 22] total 55 [2019-09-07 10:43:54,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:43:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:43:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=2320, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:43:54,888 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 55 states. [2019-09-07 10:44:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:07,693 INFO L93 Difference]: Finished difference Result 210 states and 215 transitions. [2019-09-07 10:44:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 10:44:07,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 131 [2019-09-07 10:44:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:07,694 INFO L225 Difference]: With dead ends: 210 [2019-09-07 10:44:07,694 INFO L226 Difference]: Without dead ends: 147 [2019-09-07 10:44:07,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1908, Invalid=7794, Unknown=0, NotChecked=0, Total=9702 [2019-09-07 10:44:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-07 10:44:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-09-07 10:44:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-07 10:44:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-09-07 10:44:07,704 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 131 [2019-09-07 10:44:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:07,704 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-09-07 10:44:07,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:44:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-09-07 10:44:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 10:44:07,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:07,706 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:07,706 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:07,706 INFO L82 PathProgramCache]: Analyzing trace with hash 523893319, now seen corresponding path program 28 times [2019-09-07 10:44:07,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:07,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:07,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:07,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:07,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 12 proven. 1089 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 10:44:08,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:08,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:44:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:08,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:44:08,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:08,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:44:08,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-09-07 10:44:08,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:08,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-07 10:44:08,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:44:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:44:08,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:44:08,804 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 37 states. [2019-09-07 10:44:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:08,962 INFO L93 Difference]: Finished difference Result 218 states and 222 transitions. [2019-09-07 10:44:08,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:44:08,963 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 141 [2019-09-07 10:44:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:08,964 INFO L225 Difference]: With dead ends: 218 [2019-09-07 10:44:08,964 INFO L226 Difference]: Without dead ends: 147 [2019-09-07 10:44:08,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:44:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-07 10:44:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-07 10:44:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 10:44:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-09-07 10:44:08,975 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 141 [2019-09-07 10:44:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:08,976 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-09-07 10:44:08,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:44:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-09-07 10:44:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 10:44:08,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:08,977 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:08,977 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2112006043, now seen corresponding path program 29 times [2019-09-07 10:44:08,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:08,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:08,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:08,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:08,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 12 proven. 1156 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 10:44:09,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:09,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:09,597 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:44:13,850 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-09-07 10:44:13,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:13,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:44:13,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:44:13,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:13,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 10:44:13,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:44:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:44:13,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:44:13,923 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 38 states. [2019-09-07 10:44:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:14,100 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2019-09-07 10:44:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:44:14,100 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2019-09-07 10:44:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:14,102 INFO L225 Difference]: With dead ends: 220 [2019-09-07 10:44:14,102 INFO L226 Difference]: Without dead ends: 149 [2019-09-07 10:44:14,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:44:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-07 10:44:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-07 10:44:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-07 10:44:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2019-09-07 10:44:14,115 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 143 [2019-09-07 10:44:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:14,115 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2019-09-07 10:44:14,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:44:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2019-09-07 10:44:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-07 10:44:14,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:14,117 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:14,117 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1180588285, now seen corresponding path program 30 times [2019-09-07 10:44:14,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:14,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:14,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:14,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 12 proven. 1225 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 10:44:14,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:14,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:44:14,828 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:44:14,997 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:44:14,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:15,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:44:15,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 84 proven. 42 refuted. 0 times theorem prover too weak. 1285 trivial. 0 not checked. [2019-09-07 10:44:15,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:15,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 16] total 52 [2019-09-07 10:44:15,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 10:44:15,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 10:44:15,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1872, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:44:15,340 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 52 states. [2019-09-07 10:44:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:16,887 INFO L93 Difference]: Finished difference Result 250 states and 261 transitions. [2019-09-07 10:44:16,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:44:16,888 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 145 [2019-09-07 10:44:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:16,889 INFO L225 Difference]: With dead ends: 250 [2019-09-07 10:44:16,889 INFO L226 Difference]: Without dead ends: 153 [2019-09-07 10:44:16,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2400, Invalid=5256, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 10:44:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-07 10:44:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-09-07 10:44:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 10:44:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2019-09-07 10:44:16,899 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 145 [2019-09-07 10:44:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:16,900 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2019-09-07 10:44:16,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 10:44:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2019-09-07 10:44:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 10:44:16,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:16,901 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:16,901 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:16,902 INFO L82 PathProgramCache]: Analyzing trace with hash 663800742, now seen corresponding path program 31 times [2019-09-07 10:44:16,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:16,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:16,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:16,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:16,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 12 proven. 1296 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-07 10:44:17,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:17,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:44:17,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:44:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:17,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:44:17,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-07 10:44:17,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:17,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-07 10:44:17,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 10:44:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 10:44:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:44:17,920 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 40 states. [2019-09-07 10:44:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:18,101 INFO L93 Difference]: Finished difference Result 228 states and 232 transitions. [2019-09-07 10:44:18,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:44:18,102 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 149 [2019-09-07 10:44:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:18,104 INFO L225 Difference]: With dead ends: 228 [2019-09-07 10:44:18,105 INFO L226 Difference]: Without dead ends: 155 [2019-09-07 10:44:18,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:44:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-07 10:44:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-07 10:44:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-07 10:44:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2019-09-07 10:44:18,116 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 149 [2019-09-07 10:44:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:18,117 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2019-09-07 10:44:18,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 10:44:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2019-09-07 10:44:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 10:44:18,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:18,119 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:18,119 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:18,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2017143748, now seen corresponding path program 32 times [2019-09-07 10:44:18,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:18,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:18,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:44:18,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 12 proven. 1369 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-07 10:44:18,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:18,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:19,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:44:19,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:44:19,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:19,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:44:19,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-07 10:44:19,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:19,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 10:44:19,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:44:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:44:19,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:44:19,127 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 41 states. [2019-09-07 10:44:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:19,253 INFO L93 Difference]: Finished difference Result 230 states and 234 transitions. [2019-09-07 10:44:19,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:44:19,254 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 151 [2019-09-07 10:44:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:19,255 INFO L225 Difference]: With dead ends: 230 [2019-09-07 10:44:19,255 INFO L226 Difference]: Without dead ends: 157 [2019-09-07 10:44:19,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:44:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-07 10:44:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-07 10:44:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-07 10:44:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2019-09-07 10:44:19,264 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 151 [2019-09-07 10:44:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:19,264 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2019-09-07 10:44:19,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:44:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2019-09-07 10:44:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-07 10:44:19,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:19,266 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:19,266 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1204681826, now seen corresponding path program 33 times [2019-09-07 10:44:19,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:19,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:19,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:19,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:19,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 12 proven. 1444 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-07 10:44:20,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:20,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 10:44:20,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:44:20,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 10:44:20,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:20,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:44:20,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:21,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:44:21,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:44:21,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:44:21,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:44:21,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:44:21,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:44:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 15 proven. 140 refuted. 0 times theorem prover too weak. 1489 trivial. 0 not checked. [2019-09-07 10:44:21,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:21,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 24] total 63 [2019-09-07 10:44:21,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:44:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:44:21,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=3025, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:44:21,490 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 63 states. [2019-09-07 10:44:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:34,930 INFO L93 Difference]: Finished difference Result 242 states and 247 transitions. [2019-09-07 10:44:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-07 10:44:34,931 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 153 [2019-09-07 10:44:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:34,932 INFO L225 Difference]: With dead ends: 242 [2019-09-07 10:44:34,932 INFO L226 Difference]: Without dead ends: 169 [2019-09-07 10:44:34,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 121 SyntacticMatches, 11 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3018 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2596, Invalid=10286, Unknown=0, NotChecked=0, Total=12882 [2019-09-07 10:44:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-07 10:44:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-09-07 10:44:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-07 10:44:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2019-09-07 10:44:34,943 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 153 [2019-09-07 10:44:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:34,944 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2019-09-07 10:44:34,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:44:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2019-09-07 10:44:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 10:44:34,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:34,945 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:34,945 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash -785470025, now seen corresponding path program 34 times [2019-09-07 10:44:34,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:34,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:34,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 14 proven. 1521 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-07 10:44:36,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:36,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:36,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:44:36,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:44:36,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:36,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 10:44:36,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-07 10:44:36,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:36,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 10:44:36,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:44:36,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:44:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:44:36,189 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 43 states. [2019-09-07 10:44:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:36,328 INFO L93 Difference]: Finished difference Result 250 states and 254 transitions. [2019-09-07 10:44:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 10:44:36,331 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 163 [2019-09-07 10:44:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:36,332 INFO L225 Difference]: With dead ends: 250 [2019-09-07 10:44:36,332 INFO L226 Difference]: Without dead ends: 169 [2019-09-07 10:44:36,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:44:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-07 10:44:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-07 10:44:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-07 10:44:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-09-07 10:44:36,341 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-09-07 10:44:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:36,341 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-09-07 10:44:36,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:44:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-09-07 10:44:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-07 10:44:36,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:36,343 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:36,343 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2145878357, now seen corresponding path program 35 times [2019-09-07 10:44:36,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:36,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:36,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:36,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:36,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 14 proven. 1600 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-07 10:44:37,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:37,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:37,083 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:44:39,397 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-09-07 10:44:39,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:39,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 10:44:39,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-07 10:44:39,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:39,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-07 10:44:39,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:44:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:44:39,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:44:39,484 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 44 states. [2019-09-07 10:44:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:39,637 INFO L93 Difference]: Finished difference Result 252 states and 256 transitions. [2019-09-07 10:44:39,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:44:39,638 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 165 [2019-09-07 10:44:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:39,640 INFO L225 Difference]: With dead ends: 252 [2019-09-07 10:44:39,640 INFO L226 Difference]: Without dead ends: 171 [2019-09-07 10:44:39,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:44:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-07 10:44:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-07 10:44:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-07 10:44:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2019-09-07 10:44:39,655 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 165 [2019-09-07 10:44:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:39,656 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2019-09-07 10:44:39,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:44:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2019-09-07 10:44:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 10:44:39,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:39,665 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:39,665 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:39,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1673127283, now seen corresponding path program 36 times [2019-09-07 10:44:39,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:39,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:39,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 14 proven. 1681 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-07 10:44:40,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:40,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:40,492 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:44:40,806 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-07 10:44:40,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:40,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:44:40,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 112 proven. 56 refuted. 0 times theorem prover too weak. 1765 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:44:41,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:41,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 18] total 60 [2019-09-07 10:44:41,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 10:44:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 10:44:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=2498, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:44:41,499 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 60 states. [2019-09-07 10:44:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:42,903 INFO L93 Difference]: Finished difference Result 286 states and 298 transitions. [2019-09-07 10:44:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 10:44:42,909 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 167 [2019-09-07 10:44:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:42,910 INFO L225 Difference]: With dead ends: 286 [2019-09-07 10:44:42,910 INFO L226 Difference]: Without dead ends: 175 [2019-09-07 10:44:42,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3226, Invalid=7076, Unknown=0, NotChecked=0, Total=10302 [2019-09-07 10:44:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-07 10:44:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-07 10:44:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-07 10:44:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2019-09-07 10:44:42,922 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 167 [2019-09-07 10:44:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:42,922 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2019-09-07 10:44:42,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 10:44:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2019-09-07 10:44:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-07 10:44:42,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:42,924 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:42,924 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1922162602, now seen corresponding path program 37 times [2019-09-07 10:44:42,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:42,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:42,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:42,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:42,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 14 proven. 1764 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-09-07 10:44:43,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:43,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:43,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:44:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:43,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:44:43,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-07 10:44:43,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:43,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-07 10:44:43,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:44:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:44:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:44:43,836 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 46 states. [2019-09-07 10:44:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:43,961 INFO L93 Difference]: Finished difference Result 260 states and 264 transitions. [2019-09-07 10:44:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:44:43,962 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 171 [2019-09-07 10:44:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:43,965 INFO L225 Difference]: With dead ends: 260 [2019-09-07 10:44:43,965 INFO L226 Difference]: Without dead ends: 177 [2019-09-07 10:44:43,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:44:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-07 10:44:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-07 10:44:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-07 10:44:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2019-09-07 10:44:43,978 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 171 [2019-09-07 10:44:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:43,978 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2019-09-07 10:44:43,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:44:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2019-09-07 10:44:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-07 10:44:43,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:43,980 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:43,980 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash -304056844, now seen corresponding path program 38 times [2019-09-07 10:44:43,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:43,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:43,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:44:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 14 proven. 1849 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-09-07 10:44:44,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:44,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:44,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:44:44,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:44:44,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:44,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:44:44,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-07 10:44:44,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:44,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-07 10:44:44,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:44:44,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:44:44,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:44:44,979 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 47 states. [2019-09-07 10:44:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:44:45,146 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2019-09-07 10:44:45,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:44:45,147 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 173 [2019-09-07 10:44:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:44:45,148 INFO L225 Difference]: With dead ends: 262 [2019-09-07 10:44:45,148 INFO L226 Difference]: Without dead ends: 179 [2019-09-07 10:44:45,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:44:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-07 10:44:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-07 10:44:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 10:44:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-09-07 10:44:45,156 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 173 [2019-09-07 10:44:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:44:45,156 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-09-07 10:44:45,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:44:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-09-07 10:44:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-07 10:44:45,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:44:45,158 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:44:45,158 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:44:45,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:44:45,158 INFO L82 PathProgramCache]: Analyzing trace with hash -82584558, now seen corresponding path program 39 times [2019-09-07 10:44:45,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:44:45,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:44:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:45,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:44:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:44:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:44:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 14 proven. 1936 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-09-07 10:44:46,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:44:46,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:44:46,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:44:46,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:44:46,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:44:46,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:44:46,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:44:47,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:44:47,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:44:47,874 INFO L375 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 19 treesize of output 10 [2019-09-07 10:44:47,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:44:47,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:44:47,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:44:47,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-09-07 10:44:47,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:44:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 91 proven. 93 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2019-09-07 10:44:48,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:44:48,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 24] total 69 [2019-09-07 10:44:48,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 10:44:48,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 10:44:48,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=3493, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:44:48,064 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 69 states. [2019-09-07 10:45:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:01,867 INFO L93 Difference]: Finished difference Result 303 states and 316 transitions. [2019-09-07 10:45:01,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 10:45:01,867 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 175 [2019-09-07 10:45:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:01,868 INFO L225 Difference]: With dead ends: 303 [2019-09-07 10:45:01,868 INFO L226 Difference]: Without dead ends: 183 [2019-09-07 10:45:01,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 141 SyntacticMatches, 13 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4317 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3897, Invalid=13395, Unknown=0, NotChecked=0, Total=17292 [2019-09-07 10:45:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-07 10:45:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-07 10:45:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 10:45:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-09-07 10:45:01,881 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 175 [2019-09-07 10:45:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:01,881 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-09-07 10:45:01,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 10:45:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-09-07 10:45:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-07 10:45:01,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:01,883 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 10, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:01,883 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1664412981, now seen corresponding path program 40 times [2019-09-07 10:45:01,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:01,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:01,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:01,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 14 proven. 2025 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 10:45:02,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:02,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:02,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:45:02,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:45:02,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:02,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:45:02,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2311 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 10:45:03,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:03,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 10:45:03,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:45:03,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:45:03,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:45:03,065 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 49 states. [2019-09-07 10:45:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:03,207 INFO L93 Difference]: Finished difference Result 270 states and 274 transitions. [2019-09-07 10:45:03,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:45:03,207 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 179 [2019-09-07 10:45:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:03,208 INFO L225 Difference]: With dead ends: 270 [2019-09-07 10:45:03,208 INFO L226 Difference]: Without dead ends: 185 [2019-09-07 10:45:03,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:45:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-07 10:45:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-07 10:45:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-07 10:45:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2019-09-07 10:45:03,219 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 179 [2019-09-07 10:45:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:03,219 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2019-09-07 10:45:03,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:45:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2019-09-07 10:45:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-07 10:45:03,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:03,221 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 10, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:03,221 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:03,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:03,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1824441555, now seen corresponding path program 41 times [2019-09-07 10:45:03,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:03,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:03,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2402 backedges. 14 proven. 2116 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 10:45:04,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:04,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:04,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:45:30,774 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-09-07 10:45:30,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:30,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:45:30,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2402 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 10:45:30,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:30,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 10:45:30,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 10:45:30,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 10:45:30,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:45:30,843 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 50 states. [2019-09-07 10:45:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:31,013 INFO L93 Difference]: Finished difference Result 272 states and 276 transitions. [2019-09-07 10:45:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:45:31,014 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 181 [2019-09-07 10:45:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:31,015 INFO L225 Difference]: With dead ends: 272 [2019-09-07 10:45:31,015 INFO L226 Difference]: Without dead ends: 187 [2019-09-07 10:45:31,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:45:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-07 10:45:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-07 10:45:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-07 10:45:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2019-09-07 10:45:31,024 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 181 [2019-09-07 10:45:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:31,024 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2019-09-07 10:45:31,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 10:45:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2019-09-07 10:45:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-07 10:45:31,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:31,026 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 10, 9, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:31,026 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash 993078513, now seen corresponding path program 42 times [2019-09-07 10:45:31,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:31,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:31,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:31,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2495 backedges. 14 proven. 2209 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 10:45:31,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:31,984 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:31,994 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:45:32,563 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:45:32,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:32,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:45:32,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:34,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:45:34,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:45:34,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:45:34,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:45:34,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:45:34,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:45:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2495 backedges. 18 proven. 200 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-09-07 10:45:34,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:34,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 26] total 74 [2019-09-07 10:45:34,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 10:45:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 10:45:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=4110, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 10:45:34,202 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 74 states. [2019-09-07 10:45:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:48,117 INFO L93 Difference]: Finished difference Result 284 states and 289 transitions. [2019-09-07 10:45:48,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-07 10:45:48,117 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 183 [2019-09-07 10:45:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:48,118 INFO L225 Difference]: With dead ends: 284 [2019-09-07 10:45:48,119 INFO L226 Difference]: Without dead ends: 199 [2019-09-07 10:45:48,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 147 SyntacticMatches, 13 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4214 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3824, Invalid=14266, Unknown=0, NotChecked=0, Total=18090 [2019-09-07 10:45:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-07 10:45:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-09-07 10:45:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-07 10:45:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-09-07 10:45:48,133 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 183 [2019-09-07 10:45:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:48,133 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-09-07 10:45:48,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 10:45:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-09-07 10:45:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-07 10:45:48,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:48,135 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:48,135 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:48,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:48,135 INFO L82 PathProgramCache]: Analyzing trace with hash -461105466, now seen corresponding path program 43 times [2019-09-07 10:45:48,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:48,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2650 backedges. 16 proven. 2304 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 10:45:49,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:49,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:49,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:45:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:49,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:45:49,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2650 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 10:45:49,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:49,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-07 10:45:49,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 10:45:49,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 10:45:49,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:45:49,337 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 52 states. [2019-09-07 10:45:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:49,529 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2019-09-07 10:45:49,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:45:49,529 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 193 [2019-09-07 10:45:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:49,530 INFO L225 Difference]: With dead ends: 292 [2019-09-07 10:45:49,530 INFO L226 Difference]: Without dead ends: 199 [2019-09-07 10:45:49,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:45:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-07 10:45:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-07 10:45:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-07 10:45:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2019-09-07 10:45:49,542 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 193 [2019-09-07 10:45:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:49,542 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2019-09-07 10:45:49,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 10:45:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2019-09-07 10:45:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-07 10:45:49,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:49,544 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:49,544 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash -973782556, now seen corresponding path program 44 times [2019-09-07 10:45:49,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:49,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:49,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:49,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:45:49,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2747 backedges. 16 proven. 2401 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 10:45:50,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:50,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:50,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:45:50,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:45:50,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:50,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:45:50,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2747 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 10:45:50,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:50,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-07 10:45:50,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:45:50,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:45:50,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:45:50,822 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand 53 states. [2019-09-07 10:45:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:45:51,037 INFO L93 Difference]: Finished difference Result 294 states and 298 transitions. [2019-09-07 10:45:51,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:45:51,039 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 195 [2019-09-07 10:45:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:45:51,040 INFO L225 Difference]: With dead ends: 294 [2019-09-07 10:45:51,040 INFO L226 Difference]: Without dead ends: 201 [2019-09-07 10:45:51,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:45:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-07 10:45:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-07 10:45:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-07 10:45:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2019-09-07 10:45:51,050 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 195 [2019-09-07 10:45:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:45:51,051 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2019-09-07 10:45:51,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:45:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2019-09-07 10:45:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-07 10:45:51,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:45:51,052 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:45:51,053 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:45:51,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:45:51,053 INFO L82 PathProgramCache]: Analyzing trace with hash 264772994, now seen corresponding path program 45 times [2019-09-07 10:45:51,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:45:51,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:45:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:51,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:45:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:45:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:45:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2846 backedges. 16 proven. 2500 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 10:45:52,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:45:52,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:45:52,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:45:52,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 10:45:52,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:45:52,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:45:52,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:45:53,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:45:53,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:45:53,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:45:53,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:45:53,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:45:53,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:45:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2846 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:45:54,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:45:54,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 26] total 77 [2019-09-07 10:45:54,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-07 10:45:54,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-07 10:45:54,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=4407, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 10:45:54,086 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 77 states. [2019-09-07 10:46:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:04,784 INFO L93 Difference]: Finished difference Result 306 states and 311 transitions. [2019-09-07 10:46:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-07 10:46:04,784 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 197 [2019-09-07 10:46:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:04,785 INFO L225 Difference]: With dead ends: 306 [2019-09-07 10:46:04,785 INFO L226 Difference]: Without dead ends: 213 [2019-09-07 10:46:04,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 159 SyntacticMatches, 15 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4054 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4219, Invalid=13073, Unknown=0, NotChecked=0, Total=17292 [2019-09-07 10:46:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-07 10:46:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2019-09-07 10:46:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-07 10:46:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-09-07 10:46:04,797 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 197 [2019-09-07 10:46:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:04,798 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-09-07 10:46:04,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-07 10:46:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-09-07 10:46:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-07 10:46:04,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:04,799 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:04,800 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash -671876649, now seen corresponding path program 46 times [2019-09-07 10:46:04,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:04,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 18 proven. 2601 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-09-07 10:46:06,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:06,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:46:06,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:06,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:06,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 10:46:06,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (52)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:46:06,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:06,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-07 10:46:06,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:46:06,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:46:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:46:06,222 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 55 states. [2019-09-07 10:46:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:06,420 INFO L93 Difference]: Finished difference Result 314 states and 318 transitions. [2019-09-07 10:46:06,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 10:46:06,420 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 207 [2019-09-07 10:46:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:06,422 INFO L225 Difference]: With dead ends: 314 [2019-09-07 10:46:06,422 INFO L226 Difference]: Without dead ends: 213 [2019-09-07 10:46:06,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:46:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-07 10:46:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-07 10:46:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 10:46:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2019-09-07 10:46:06,439 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 207 [2019-09-07 10:46:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:06,439 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2019-09-07 10:46:06,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:46:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2019-09-07 10:46:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 10:46:06,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:06,442 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:06,443 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1110726773, now seen corresponding path program 47 times [2019-09-07 10:46:06,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:06,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:06,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:06,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:06,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3118 backedges. 18 proven. 2704 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-09-07 10:46:07,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:07,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:07,612 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:46:23,687 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-09-07 10:46:23,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:23,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:46:23,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3118 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2019-09-07 10:46:23,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:23,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-07 10:46:23,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:46:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:46:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:46:23,761 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 56 states. [2019-09-07 10:46:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:23,984 INFO L93 Difference]: Finished difference Result 316 states and 320 transitions. [2019-09-07 10:46:23,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:46:23,985 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 209 [2019-09-07 10:46:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:23,985 INFO L225 Difference]: With dead ends: 316 [2019-09-07 10:46:23,986 INFO L226 Difference]: Without dead ends: 215 [2019-09-07 10:46:23,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:46:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-07 10:46:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-09-07 10:46:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-07 10:46:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2019-09-07 10:46:23,996 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 209 [2019-09-07 10:46:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:23,997 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2019-09-07 10:46:23,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:46:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2019-09-07 10:46:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 10:46:23,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:23,998 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:23,999 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash 500664211, now seen corresponding path program 48 times [2019-09-07 10:46:23,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:23,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:24,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:24,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:24,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 18 proven. 2809 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-09-07 10:46:25,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:25,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:25,216 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:46:25,615 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:46:25,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:25,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:46:25,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 180 proven. 90 refuted. 0 times theorem prover too weak. 2953 trivial. 0 not checked. [2019-09-07 10:46:26,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:26,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 22] total 76 [2019-09-07 10:46:26,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-07 10:46:26,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-07 10:46:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4020, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 10:46:26,273 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 76 states. [2019-09-07 10:46:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:28,864 INFO L93 Difference]: Finished difference Result 358 states and 372 transitions. [2019-09-07 10:46:28,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 10:46:28,864 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 211 [2019-09-07 10:46:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:28,865 INFO L225 Difference]: With dead ends: 358 [2019-09-07 10:46:28,866 INFO L226 Difference]: Without dead ends: 219 [2019-09-07 10:46:28,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5244, Invalid=11526, Unknown=0, NotChecked=0, Total=16770 [2019-09-07 10:46:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-07 10:46:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2019-09-07 10:46:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-07 10:46:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 220 transitions. [2019-09-07 10:46:28,878 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 220 transitions. Word has length 211 [2019-09-07 10:46:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:28,879 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 220 transitions. [2019-09-07 10:46:28,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-07 10:46:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 220 transitions. [2019-09-07 10:46:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-07 10:46:28,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:28,880 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:28,881 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash -856949002, now seen corresponding path program 49 times [2019-09-07 10:46:28,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:28,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:28,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 18 proven. 2916 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-09-07 10:46:30,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:30,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:30,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:30,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 10:46:30,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-09-07 10:46:30,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:30,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-07 10:46:30,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 10:46:30,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 10:46:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:46:30,282 INFO L87 Difference]: Start difference. First operand 218 states and 220 transitions. Second operand 58 states. [2019-09-07 10:46:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:30,483 INFO L93 Difference]: Finished difference Result 324 states and 328 transitions. [2019-09-07 10:46:30,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 10:46:30,483 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 215 [2019-09-07 10:46:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:30,485 INFO L225 Difference]: With dead ends: 324 [2019-09-07 10:46:30,485 INFO L226 Difference]: Without dead ends: 221 [2019-09-07 10:46:30,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:46:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-07 10:46:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-09-07 10:46:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-07 10:46:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-09-07 10:46:30,497 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 215 [2019-09-07 10:46:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:30,497 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-09-07 10:46:30,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 10:46:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-09-07 10:46:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-07 10:46:30,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:30,499 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:30,499 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1708466284, now seen corresponding path program 50 times [2019-09-07 10:46:30,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:30,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3459 backedges. 18 proven. 3025 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-09-07 10:46:31,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:31,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:46:31,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:46:31,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:31,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 10:46:31,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3459 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-09-07 10:46:31,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:31,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-07 10:46:31,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 10:46:31,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 10:46:31,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:46:31,987 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 59 states. [2019-09-07 10:46:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:32,293 INFO L93 Difference]: Finished difference Result 326 states and 330 transitions. [2019-09-07 10:46:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 10:46:32,294 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 217 [2019-09-07 10:46:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:32,296 INFO L225 Difference]: With dead ends: 326 [2019-09-07 10:46:32,296 INFO L226 Difference]: Without dead ends: 223 [2019-09-07 10:46:32,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:46:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-07 10:46:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-09-07 10:46:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-07 10:46:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 224 transitions. [2019-09-07 10:46:32,316 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 224 transitions. Word has length 217 [2019-09-07 10:46:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:32,316 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 224 transitions. [2019-09-07 10:46:32,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 10:46:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 224 transitions. [2019-09-07 10:46:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-07 10:46:32,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:32,319 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:32,319 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash 322179250, now seen corresponding path program 51 times [2019-09-07 10:46:32,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:32,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:32,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:32,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:32,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 18 proven. 3136 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-09-07 10:46:33,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:33,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:33,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:46:33,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 10:46:33,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:33,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 10:46:33,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:35,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:46:35,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:46:35,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:46:35,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:46:35,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:46:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:46:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 24 proven. 290 refuted. 0 times theorem prover too weak. 3256 trivial. 0 not checked. [2019-09-07 10:46:36,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:36,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 30] total 87 [2019-09-07 10:46:36,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-07 10:46:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-07 10:46:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1790, Invalid=5692, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 10:46:36,124 INFO L87 Difference]: Start difference. First operand 222 states and 224 transitions. Second operand 87 states. [2019-09-07 10:46:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:50,325 INFO L93 Difference]: Finished difference Result 338 states and 343 transitions. [2019-09-07 10:46:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-07 10:46:50,326 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 219 [2019-09-07 10:46:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:50,327 INFO L225 Difference]: With dead ends: 338 [2019-09-07 10:46:50,327 INFO L226 Difference]: Without dead ends: 235 [2019-09-07 10:46:50,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 175 SyntacticMatches, 17 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5308, Invalid=19814, Unknown=0, NotChecked=0, Total=25122 [2019-09-07 10:46:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-07 10:46:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-09-07 10:46:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-07 10:46:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2019-09-07 10:46:50,339 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 219 [2019-09-07 10:46:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:50,340 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2019-09-07 10:46:50,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-07 10:46:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2019-09-07 10:46:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-07 10:46:50,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:50,342 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:50,342 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2013580665, now seen corresponding path program 52 times [2019-09-07 10:46:50,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:50,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:50,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:50,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 20 proven. 3249 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-07 10:46:52,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:52,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:46:52,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:52,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:52,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 10:46:52,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2019-09-07 10:46:52,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:52,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-09-07 10:46:52,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 10:46:52,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 10:46:52,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:46:52,436 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 61 states. [2019-09-07 10:46:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:52,693 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2019-09-07 10:46:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 10:46:52,694 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 229 [2019-09-07 10:46:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:52,695 INFO L225 Difference]: With dead ends: 346 [2019-09-07 10:46:52,695 INFO L226 Difference]: Without dead ends: 235 [2019-09-07 10:46:52,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:46:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-07 10:46:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-09-07 10:46:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-07 10:46:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-09-07 10:46:52,707 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 229 [2019-09-07 10:46:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:52,707 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-09-07 10:46:52,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 10:46:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-09-07 10:46:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-07 10:46:52,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:52,709 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:52,709 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:52,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:52,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1021466971, now seen corresponding path program 53 times [2019-09-07 10:46:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:52,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:52,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3874 backedges. 20 proven. 3364 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-07 10:46:54,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:54,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:54,437 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:12,652 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-09-07 10:47:12,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:12,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 10:47:12,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3874 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2019-09-07 10:47:12,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:12,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-09-07 10:47:12,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 10:47:12,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 10:47:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:47:12,722 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 62 states. [2019-09-07 10:47:12,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:12,912 INFO L93 Difference]: Finished difference Result 348 states and 352 transitions. [2019-09-07 10:47:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 10:47:12,912 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 231 [2019-09-07 10:47:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:12,913 INFO L225 Difference]: With dead ends: 348 [2019-09-07 10:47:12,913 INFO L226 Difference]: Without dead ends: 237 [2019-09-07 10:47:12,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:47:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-07 10:47:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2019-09-07 10:47:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-07 10:47:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2019-09-07 10:47:12,925 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 231 [2019-09-07 10:47:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:12,925 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2019-09-07 10:47:12,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 10:47:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2019-09-07 10:47:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-07 10:47:12,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:12,927 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:12,928 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1082946749, now seen corresponding path program 54 times [2019-09-07 10:47:12,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:12,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:12,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3991 backedges. 20 proven. 3481 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-07 10:47:14,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:14,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:14,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:47:15,502 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-09-07 10:47:15,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:15,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:47:15,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3991 backedges. 220 proven. 110 refuted. 0 times theorem prover too weak. 3661 trivial. 0 not checked. [2019-09-07 10:47:16,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:16,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 24] total 84 [2019-09-07 10:47:16,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-07 10:47:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-07 10:47:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2056, Invalid=4916, Unknown=0, NotChecked=0, Total=6972 [2019-09-07 10:47:16,275 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 84 states. [2019-09-07 10:47:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:19,145 INFO L93 Difference]: Finished difference Result 394 states and 409 transitions. [2019-09-07 10:47:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-07 10:47:19,146 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 233 [2019-09-07 10:47:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:19,147 INFO L225 Difference]: With dead ends: 394 [2019-09-07 10:47:19,147 INFO L226 Difference]: Without dead ends: 241 [2019-09-07 10:47:19,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3778 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6436, Invalid=14156, Unknown=0, NotChecked=0, Total=20592 [2019-09-07 10:47:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-07 10:47:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-09-07 10:47:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-07 10:47:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2019-09-07 10:47:19,161 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 233 [2019-09-07 10:47:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:19,161 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2019-09-07 10:47:19,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-07 10:47:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2019-09-07 10:47:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-07 10:47:19,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:19,163 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:19,163 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:19,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1817499418, now seen corresponding path program 55 times [2019-09-07 10:47:19,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:19,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:19,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 20 proven. 3600 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-09-07 10:47:20,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:20,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:20,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 10:47:20,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (61)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:47:20,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:20,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-09-07 10:47:20,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 10:47:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 10:47:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 10:47:20,894 INFO L87 Difference]: Start difference. First operand 240 states and 242 transitions. Second operand 64 states. [2019-09-07 10:47:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:21,139 INFO L93 Difference]: Finished difference Result 356 states and 360 transitions. [2019-09-07 10:47:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 10:47:21,140 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 237 [2019-09-07 10:47:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:21,141 INFO L225 Difference]: With dead ends: 356 [2019-09-07 10:47:21,141 INFO L226 Difference]: Without dead ends: 243 [2019-09-07 10:47:21,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 10:47:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-07 10:47:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-09-07 10:47:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 10:47:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2019-09-07 10:47:21,153 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 237 [2019-09-07 10:47:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:21,154 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2019-09-07 10:47:21,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 10:47:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2019-09-07 10:47:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-07 10:47:21,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:21,156 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:21,157 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash -283205884, now seen corresponding path program 56 times [2019-09-07 10:47:21,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:21,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:21,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 20 proven. 3721 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-09-07 10:47:22,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:22,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:22,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:47:22,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:47:22,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:22,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-07 10:47:22,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4253 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-07 10:47:22,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:22,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-09-07 10:47:22,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 10:47:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 10:47:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:47:22,874 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 65 states. [2019-09-07 10:47:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:23,138 INFO L93 Difference]: Finished difference Result 358 states and 362 transitions. [2019-09-07 10:47:23,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 10:47:23,139 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 239 [2019-09-07 10:47:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:23,140 INFO L225 Difference]: With dead ends: 358 [2019-09-07 10:47:23,140 INFO L226 Difference]: Without dead ends: 245 [2019-09-07 10:47:23,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:47:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-07 10:47:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-09-07 10:47:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-07 10:47:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 246 transitions. [2019-09-07 10:47:23,152 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 246 transitions. Word has length 239 [2019-09-07 10:47:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:23,152 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 246 transitions. [2019-09-07 10:47:23,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 10:47:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 246 transitions. [2019-09-07 10:47:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-07 10:47:23,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:23,154 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:23,154 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash 999097762, now seen corresponding path program 57 times [2019-09-07 10:47:23,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:23,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:23,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 20 proven. 3844 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-09-07 10:47:24,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:24,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:24,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:47:25,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:47:25,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:25,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:47:25,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:27,433 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:47:27,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:47:27,443 INFO L375 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 19 treesize of output 10 [2019-09-07 10:47:27,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:47:27,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:47:27,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:47:27,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-09-07 10:47:27,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:47:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 190 proven. 162 refuted. 0 times theorem prover too weak. 4024 trivial. 0 not checked. [2019-09-07 10:47:27,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:27,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 30] total 93 [2019-09-07 10:47:27,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-07 10:47:27,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-07 10:47:27,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2270, Invalid=6286, Unknown=0, NotChecked=0, Total=8556 [2019-09-07 10:47:27,711 INFO L87 Difference]: Start difference. First operand 244 states and 246 transitions. Second operand 93 states. [2019-09-07 10:47:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:44,605 INFO L93 Difference]: Finished difference Result 411 states and 427 transitions. [2019-09-07 10:47:44,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-07 10:47:44,606 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 241 [2019-09-07 10:47:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:44,608 INFO L225 Difference]: With dead ends: 411 [2019-09-07 10:47:44,608 INFO L226 Difference]: Without dead ends: 249 [2019-09-07 10:47:44,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 195 SyntacticMatches, 19 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8199 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7443, Invalid=24777, Unknown=0, NotChecked=0, Total=32220 [2019-09-07 10:47:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-07 10:47:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-09-07 10:47:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-07 10:47:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-09-07 10:47:44,641 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 241 [2019-09-07 10:47:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:44,642 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-09-07 10:47:44,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-07 10:47:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-09-07 10:47:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-07 10:47:44,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:44,645 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:44,646 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 458688901, now seen corresponding path program 58 times [2019-09-07 10:47:44,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:44,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:44,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:44,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4525 backedges. 20 proven. 3969 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-09-07 10:47:46,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:46,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:46,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:47:46,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:47:46,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:46,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-07 10:47:46,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4525 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-09-07 10:47:46,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:46,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-09-07 10:47:46,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 10:47:46,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 10:47:46,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 10:47:46,646 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 67 states. [2019-09-07 10:47:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:46,968 INFO L93 Difference]: Finished difference Result 366 states and 370 transitions. [2019-09-07 10:47:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 10:47:46,969 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 245 [2019-09-07 10:47:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:46,971 INFO L225 Difference]: With dead ends: 366 [2019-09-07 10:47:46,971 INFO L226 Difference]: Without dead ends: 251 [2019-09-07 10:47:46,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 10:47:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-07 10:47:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-09-07 10:47:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-07 10:47:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 252 transitions. [2019-09-07 10:47:46,993 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 252 transitions. Word has length 245 [2019-09-07 10:47:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:46,993 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 252 transitions. [2019-09-07 10:47:46,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 10:47:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 252 transitions. [2019-09-07 10:47:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-07 10:47:46,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:46,996 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:46,997 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1056539043, now seen corresponding path program 59 times [2019-09-07 10:47:46,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:46,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:46,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4652 backedges. 20 proven. 4096 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-09-07 10:47:48,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:48,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:48,740 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:49:06,273 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-09-07 10:49:06,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:49:06,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-07 10:49:06,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:49:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4652 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-09-07 10:49:06,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:49:06,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-09-07 10:49:06,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-07 10:49:06,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-07 10:49:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 10:49:06,372 INFO L87 Difference]: Start difference. First operand 250 states and 252 transitions. Second operand 68 states. [2019-09-07 10:49:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:49:06,632 INFO L93 Difference]: Finished difference Result 368 states and 372 transitions. [2019-09-07 10:49:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 10:49:06,633 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 247 [2019-09-07 10:49:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:49:06,634 INFO L225 Difference]: With dead ends: 368 [2019-09-07 10:49:06,634 INFO L226 Difference]: Without dead ends: 253 [2019-09-07 10:49:06,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 10:49:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-07 10:49:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-09-07 10:49:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-07 10:49:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2019-09-07 10:49:06,647 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 247 [2019-09-07 10:49:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:49:06,647 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2019-09-07 10:49:06,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-07 10:49:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2019-09-07 10:49:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-07 10:49:06,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:49:06,649 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 13, 12, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:49:06,649 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:49:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:49:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash 64907841, now seen corresponding path program 60 times [2019-09-07 10:49:06,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:49:06,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:49:06,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:06,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:49:06,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:49:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4781 backedges. 20 proven. 4225 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-09-07 10:49:08,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:49:08,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:49:08,394 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:49:10,960 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 10:49:10,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:49:10,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 10:49:10,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:49:13,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:49:13,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:49:13,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:49:13,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:49:13,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:49:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:49:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4781 backedges. 0 proven. 374 refuted. 0 times theorem prover too weak. 4407 trivial. 0 not checked. [2019-09-07 10:49:13,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:49:13,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 30] total 96 [2019-09-07 10:49:13,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-07 10:49:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-07 10:49:13,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2357, Invalid=6763, Unknown=0, NotChecked=0, Total=9120 [2019-09-07 10:49:13,576 INFO L87 Difference]: Start difference. First operand 252 states and 254 transitions. Second operand 96 states. [2019-09-07 10:49:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:49:28,969 INFO L93 Difference]: Finished difference Result 380 states and 385 transitions. [2019-09-07 10:49:28,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-07 10:49:28,970 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 249 [2019-09-07 10:49:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:49:28,972 INFO L225 Difference]: With dead ends: 380 [2019-09-07 10:49:28,972 INFO L226 Difference]: Without dead ends: 265 [2019-09-07 10:49:28,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 203 SyntacticMatches, 19 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6414 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=6931, Invalid=20459, Unknown=0, NotChecked=0, Total=27390 [2019-09-07 10:49:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-07 10:49:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2019-09-07 10:49:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-07 10:49:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-09-07 10:49:28,985 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 249 [2019-09-07 10:49:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:49:28,985 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-09-07 10:49:28,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-07 10:49:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-09-07 10:49:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-07 10:49:28,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:49:28,987 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:49:28,988 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:49:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:49:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash 800253078, now seen corresponding path program 61 times [2019-09-07 10:49:28,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:49:28,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:49:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:28,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:49:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:49:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4996 backedges. 22 proven. 4356 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-09-07 10:49:30,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:49:30,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:49:30,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:49:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:49:30,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-07 10:49:30,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:49:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4996 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-09-07 10:49:30,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:49:30,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 70 [2019-09-07 10:49:30,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-07 10:49:30,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-07 10:49:30,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:49:30,941 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 70 states. [2019-09-07 10:49:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:49:31,243 INFO L93 Difference]: Finished difference Result 388 states and 392 transitions. [2019-09-07 10:49:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 10:49:31,244 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 259 [2019-09-07 10:49:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:49:31,245 INFO L225 Difference]: With dead ends: 388 [2019-09-07 10:49:31,245 INFO L226 Difference]: Without dead ends: 265 [2019-09-07 10:49:31,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:49:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-07 10:49:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2019-09-07 10:49:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-07 10:49:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 266 transitions. [2019-09-07 10:49:31,258 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 266 transitions. Word has length 259 [2019-09-07 10:49:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:49:31,259 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 266 transitions. [2019-09-07 10:49:31,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-07 10:49:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 266 transitions. [2019-09-07 10:49:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-07 10:49:31,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:49:31,261 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:49:31,261 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:49:31,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:49:31,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1319514060, now seen corresponding path program 62 times [2019-09-07 10:49:31,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:49:31,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:49:31,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:31,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:49:31,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:49:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5129 backedges. 22 proven. 4489 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-09-07 10:49:33,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:49:33,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:49:33,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:49:33,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:49:33,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:49:33,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-07 10:49:33,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:49:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5129 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-09-07 10:49:33,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:49:33,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 71 [2019-09-07 10:49:33,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 10:49:33,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 10:49:33,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:49:33,336 INFO L87 Difference]: Start difference. First operand 264 states and 266 transitions. Second operand 71 states. [2019-09-07 10:49:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:49:33,658 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-09-07 10:49:33,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-07 10:49:33,658 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 261 [2019-09-07 10:49:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:49:33,659 INFO L225 Difference]: With dead ends: 390 [2019-09-07 10:49:33,659 INFO L226 Difference]: Without dead ends: 267 [2019-09-07 10:49:33,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:49:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-07 10:49:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2019-09-07 10:49:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-07 10:49:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 268 transitions. [2019-09-07 10:49:33,673 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 268 transitions. Word has length 261 [2019-09-07 10:49:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:49:33,673 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 268 transitions. [2019-09-07 10:49:33,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 10:49:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 268 transitions. [2019-09-07 10:49:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-07 10:49:33,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:49:33,675 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:49:33,675 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:49:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:49:33,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1693731922, now seen corresponding path program 63 times [2019-09-07 10:49:33,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:49:33,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:49:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:33,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:49:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:49:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5264 backedges. 22 proven. 4624 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-09-07 10:49:35,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:49:35,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:49:35,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:49:35,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-07 10:49:35,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:49:35,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-07 10:49:35,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:49:38,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:49:38,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:49:38,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:49:38,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:49:38,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:49:38,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:49:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5264 backedges. 30 proven. 420 refuted. 0 times theorem prover too weak. 4814 trivial. 0 not checked. [2019-09-07 10:49:38,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:49:38,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 34] total 103 [2019-09-07 10:49:38,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-07 10:49:38,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-07 10:49:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=7930, Unknown=0, NotChecked=0, Total=10506 [2019-09-07 10:49:38,902 INFO L87 Difference]: Start difference. First operand 266 states and 268 transitions. Second operand 103 states. [2019-09-07 10:49:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:49:51,395 INFO L93 Difference]: Finished difference Result 402 states and 407 transitions. [2019-09-07 10:49:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-07 10:49:51,395 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 263 [2019-09-07 10:49:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:49:51,397 INFO L225 Difference]: With dead ends: 402 [2019-09-07 10:49:51,397 INFO L226 Difference]: Without dead ends: 279 [2019-09-07 10:49:51,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 211 SyntacticMatches, 21 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8518 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=7656, Invalid=27876, Unknown=0, NotChecked=0, Total=35532 [2019-09-07 10:49:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-07 10:49:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-09-07 10:49:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-07 10:49:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-09-07 10:49:51,409 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 263 [2019-09-07 10:49:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:49:51,409 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-09-07 10:49:51,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-07 10:49:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-09-07 10:49:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-07 10:49:51,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:49:51,411 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:49:51,411 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:49:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:49:51,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2084218585, now seen corresponding path program 64 times [2019-09-07 10:49:51,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:49:51,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:49:51,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:51,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:49:51,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:49:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5493 backedges. 24 proven. 4761 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2019-09-07 10:49:53,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:49:53,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:49:53,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:49:53,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:49:53,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:49:53,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-07 10:49:53,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:49:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5493 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-07 10:49:53,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:49:53,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 73 [2019-09-07 10:49:53,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 10:49:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 10:49:53,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:49:53,632 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 73 states. [2019-09-07 10:49:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:49:53,944 INFO L93 Difference]: Finished difference Result 410 states and 414 transitions. [2019-09-07 10:49:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 10:49:53,944 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 273 [2019-09-07 10:49:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:49:53,946 INFO L225 Difference]: With dead ends: 410 [2019-09-07 10:49:53,946 INFO L226 Difference]: Without dead ends: 279 [2019-09-07 10:49:53,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:49:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-07 10:49:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 278. [2019-09-07 10:49:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-07 10:49:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 280 transitions. [2019-09-07 10:49:53,960 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 280 transitions. Word has length 273 [2019-09-07 10:49:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:49:53,961 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 280 transitions. [2019-09-07 10:49:53,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 10:49:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 280 transitions. [2019-09-07 10:49:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-07 10:49:53,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:49:53,963 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:49:53,963 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:49:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:49:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash 182491205, now seen corresponding path program 65 times [2019-09-07 10:49:53,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:49:53,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:49:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:53,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:49:53,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:49:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5632 backedges. 24 proven. 4900 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2019-09-07 10:49:55,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:49:55,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:49:56,005 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:51:23,807 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 71 check-sat command(s) [2019-09-07 10:51:23,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:23,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-07 10:51:23,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5632 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-07 10:51:23,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:23,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 74 [2019-09-07 10:51:23,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 10:51:23,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 10:51:23,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 10:51:23,955 INFO L87 Difference]: Start difference. First operand 278 states and 280 transitions. Second operand 74 states. [2019-09-07 10:51:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:24,267 INFO L93 Difference]: Finished difference Result 412 states and 416 transitions. [2019-09-07 10:51:24,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-07 10:51:24,267 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 275 [2019-09-07 10:51:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:24,269 INFO L225 Difference]: With dead ends: 412 [2019-09-07 10:51:24,269 INFO L226 Difference]: Without dead ends: 281 [2019-09-07 10:51:24,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 10:51:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-07 10:51:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-09-07 10:51:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-07 10:51:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 282 transitions. [2019-09-07 10:51:24,282 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 282 transitions. Word has length 275 [2019-09-07 10:51:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:24,283 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 282 transitions. [2019-09-07 10:51:24,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 10:51:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 282 transitions. [2019-09-07 10:51:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-07 10:51:24,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:24,285 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:24,285 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:24,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash 942180323, now seen corresponding path program 66 times [2019-09-07 10:51:24,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:24,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:24,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5773 backedges. 24 proven. 5041 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2019-09-07 10:51:26,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:26,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:26,338 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:51:28,874 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 10:51:28,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:28,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:51:28,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5773 backedges. 312 proven. 156 refuted. 0 times theorem prover too weak. 5305 trivial. 0 not checked. [2019-09-07 10:51:29,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:29,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 28] total 100 [2019-09-07 10:51:29,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-07 10:51:29,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-07 10:51:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2922, Invalid=6978, Unknown=0, NotChecked=0, Total=9900 [2019-09-07 10:51:29,982 INFO L87 Difference]: Start difference. First operand 280 states and 282 transitions. Second operand 100 states. [2019-09-07 10:51:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:33,811 INFO L93 Difference]: Finished difference Result 466 states and 483 transitions. [2019-09-07 10:51:33,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-07 10:51:33,812 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 277 [2019-09-07 10:51:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:33,813 INFO L225 Difference]: With dead ends: 466 [2019-09-07 10:51:33,813 INFO L226 Difference]: Without dead ends: 285 [2019-09-07 10:51:33,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5422 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9186, Invalid=20226, Unknown=0, NotChecked=0, Total=29412 [2019-09-07 10:51:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-07 10:51:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2019-09-07 10:51:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-07 10:51:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 286 transitions. [2019-09-07 10:51:33,829 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 286 transitions. Word has length 277 [2019-09-07 10:51:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:33,830 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 286 transitions. [2019-09-07 10:51:33,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-07 10:51:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 286 transitions. [2019-09-07 10:51:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-07 10:51:33,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:33,832 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:33,832 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:33,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash -18841082, now seen corresponding path program 67 times [2019-09-07 10:51:33,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:33,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:33,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:33,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:33,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5942 backedges. 24 proven. 5184 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-09-07 10:51:35,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:35,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:35,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:51:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:36,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-07 10:51:36,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5942 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2019-09-07 10:51:36,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:36,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 76 [2019-09-07 10:51:36,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-07 10:51:36,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-07 10:51:36,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 10:51:36,120 INFO L87 Difference]: Start difference. First operand 284 states and 286 transitions. Second operand 76 states. [2019-09-07 10:51:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:36,432 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-09-07 10:51:36,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 10:51:36,433 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 281 [2019-09-07 10:51:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:36,434 INFO L225 Difference]: With dead ends: 420 [2019-09-07 10:51:36,434 INFO L226 Difference]: Without dead ends: 287 [2019-09-07 10:51:36,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 10:51:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-07 10:51:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-09-07 10:51:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-07 10:51:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 288 transitions. [2019-09-07 10:51:36,443 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 288 transitions. Word has length 281 [2019-09-07 10:51:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:36,443 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 288 transitions. [2019-09-07 10:51:36,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-07 10:51:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 288 transitions. [2019-09-07 10:51:36,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 10:51:36,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:36,445 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:36,445 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:36,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:36,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1917960996, now seen corresponding path program 68 times [2019-09-07 10:51:36,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:36,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:36,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:36,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:51:36,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6087 backedges. 24 proven. 5329 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-09-07 10:51:38,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:38,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:38,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:51:38,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:51:38,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:38,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-07 10:51:38,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6087 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2019-09-07 10:51:38,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:38,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 77 [2019-09-07 10:51:38,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-07 10:51:38,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-07 10:51:38,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 10:51:38,777 INFO L87 Difference]: Start difference. First operand 286 states and 288 transitions. Second operand 77 states. [2019-09-07 10:51:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:39,059 INFO L93 Difference]: Finished difference Result 422 states and 426 transitions. [2019-09-07 10:51:39,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 10:51:39,059 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 283 [2019-09-07 10:51:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:39,060 INFO L225 Difference]: With dead ends: 422 [2019-09-07 10:51:39,060 INFO L226 Difference]: Without dead ends: 289 [2019-09-07 10:51:39,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 10:51:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-07 10:51:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 288. [2019-09-07 10:51:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-07 10:51:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 290 transitions. [2019-09-07 10:51:39,070 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 290 transitions. Word has length 283 [2019-09-07 10:51:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:39,070 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 290 transitions. [2019-09-07 10:51:39,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-07 10:51:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 290 transitions. [2019-09-07 10:51:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-07 10:51:39,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:39,072 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:39,072 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:39,072 INFO L82 PathProgramCache]: Analyzing trace with hash -831048510, now seen corresponding path program 69 times [2019-09-07 10:51:39,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:39,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:39,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6234 backedges. 24 proven. 5476 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-09-07 10:51:41,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:41,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:41,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:51:42,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 10:51:42,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:42,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-07 10:51:42,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:45,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:51:45,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:51:45,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:51:45,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:51:45,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:51:45,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:51:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6234 backedges. 33 proven. 494 refuted. 0 times theorem prover too weak. 5707 trivial. 0 not checked. [2019-09-07 10:51:45,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:45,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 36] total 111 [2019-09-07 10:51:45,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-07 10:51:45,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-07 10:51:45,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3023, Invalid=9187, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 10:51:45,884 INFO L87 Difference]: Start difference. First operand 288 states and 290 transitions. Second operand 111 states. [2019-09-07 10:52:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:52:06,414 INFO L93 Difference]: Finished difference Result 434 states and 439 transitions. [2019-09-07 10:52:06,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-07 10:52:06,415 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 285 [2019-09-07 10:52:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:52:06,416 INFO L225 Difference]: With dead ends: 434 [2019-09-07 10:52:06,416 INFO L226 Difference]: Without dead ends: 301 [2019-09-07 10:52:06,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 229 SyntacticMatches, 23 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9951 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=8992, Invalid=32420, Unknown=0, NotChecked=0, Total=41412 [2019-09-07 10:52:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-07 10:52:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2019-09-07 10:52:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-07 10:52:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 300 transitions. [2019-09-07 10:52:06,428 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 300 transitions. Word has length 285 [2019-09-07 10:52:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:52:06,428 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 300 transitions. [2019-09-07 10:52:06,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-07 10:52:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 300 transitions. [2019-09-07 10:52:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-07 10:52:06,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:52:06,430 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:52:06,430 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:52:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:52:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2092505321, now seen corresponding path program 70 times [2019-09-07 10:52:06,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:52:06,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:52:06,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:06,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:52:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:52:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6483 backedges. 26 proven. 5625 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-09-07 10:52:08,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:52:08,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:52:08,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:52:08,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:52:08,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:52:08,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-07 10:52:08,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:52:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6483 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (76)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:52:08,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:52:08,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 79 [2019-09-07 10:52:08,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-07 10:52:08,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-07 10:52:08,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 10:52:08,940 INFO L87 Difference]: Start difference. First operand 298 states and 300 transitions. Second operand 79 states. [2019-09-07 10:52:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:52:09,270 INFO L93 Difference]: Finished difference Result 442 states and 446 transitions. [2019-09-07 10:52:09,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-07 10:52:09,273 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 295 [2019-09-07 10:52:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:52:09,274 INFO L225 Difference]: With dead ends: 442 [2019-09-07 10:52:09,275 INFO L226 Difference]: Without dead ends: 301 [2019-09-07 10:52:09,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 10:52:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-07 10:52:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2019-09-07 10:52:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-07 10:52:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 302 transitions. [2019-09-07 10:52:09,290 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 302 transitions. Word has length 295 [2019-09-07 10:52:09,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:52:09,290 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 302 transitions. [2019-09-07 10:52:09,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-07 10:52:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 302 transitions. [2019-09-07 10:52:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-07 10:52:09,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:52:09,292 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:52:09,293 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:52:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:52:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash -626467915, now seen corresponding path program 71 times [2019-09-07 10:52:09,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:52:09,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:52:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:09,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:52:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:52:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6634 backedges. 26 proven. 5776 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-09-07 10:52:11,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:52:11,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:52:11,632 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:53:28,708 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2019-09-07 10:53:28,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:28,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-07 10:53:28,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6634 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2019-09-07 10:53:28,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:28,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 80 [2019-09-07 10:53:28,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-07 10:53:28,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-07 10:53:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 10:53:28,849 INFO L87 Difference]: Start difference. First operand 300 states and 302 transitions. Second operand 80 states. [2019-09-07 10:53:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:29,205 INFO L93 Difference]: Finished difference Result 444 states and 448 transitions. [2019-09-07 10:53:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 10:53:29,206 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 297 [2019-09-07 10:53:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:29,207 INFO L225 Difference]: With dead ends: 444 [2019-09-07 10:53:29,207 INFO L226 Difference]: Without dead ends: 303 [2019-09-07 10:53:29,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 10:53:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-07 10:53:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2019-09-07 10:53:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-07 10:53:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 304 transitions. [2019-09-07 10:53:29,218 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 304 transitions. Word has length 297 [2019-09-07 10:53:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:29,218 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 304 transitions. [2019-09-07 10:53:29,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-07 10:53:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 304 transitions. [2019-09-07 10:53:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-07 10:53:29,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:29,220 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:29,220 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash -513793837, now seen corresponding path program 72 times [2019-09-07 10:53:29,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:29,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:29,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:29,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:29,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6787 backedges. 26 proven. 5929 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-09-07 10:53:31,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:31,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:31,579 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:53:33,179 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-07 10:53:33,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:33,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:53:33,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6787 backedges. 364 proven. 182 refuted. 0 times theorem prover too weak. 6241 trivial. 0 not checked. [2019-09-07 10:53:34,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:34,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 30] total 108 [2019-09-07 10:53:34,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-07 10:53:34,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-07 10:53:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3412, Invalid=8144, Unknown=0, NotChecked=0, Total=11556 [2019-09-07 10:53:34,449 INFO L87 Difference]: Start difference. First operand 302 states and 304 transitions. Second operand 108 states. [2019-09-07 10:53:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:38,935 INFO L93 Difference]: Finished difference Result 502 states and 520 transitions. [2019-09-07 10:53:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-07 10:53:38,936 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 299 [2019-09-07 10:53:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:38,937 INFO L225 Difference]: With dead ends: 502 [2019-09-07 10:53:38,937 INFO L226 Difference]: Without dead ends: 307 [2019-09-07 10:53:38,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6355 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10744, Invalid=23666, Unknown=0, NotChecked=0, Total=34410 [2019-09-07 10:53:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-07 10:53:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 306. [2019-09-07 10:53:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-07 10:53:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 308 transitions. [2019-09-07 10:53:38,951 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 308 transitions. Word has length 299 [2019-09-07 10:53:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:38,951 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 308 transitions. [2019-09-07 10:53:38,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-07 10:53:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 308 transitions. [2019-09-07 10:53:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-07 10:53:38,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:38,953 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:38,953 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1123897654, now seen corresponding path program 73 times [2019-09-07 10:53:38,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:38,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:38,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 26 proven. 6084 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-07 10:53:41,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:41,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:41,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:41,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-07 10:53:41,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-09-07 10:53:41,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:41,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 82 [2019-09-07 10:53:41,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-07 10:53:41,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-07 10:53:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-07 10:53:41,601 INFO L87 Difference]: Start difference. First operand 306 states and 308 transitions. Second operand 82 states. [2019-09-07 10:53:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:41,938 INFO L93 Difference]: Finished difference Result 452 states and 456 transitions. [2019-09-07 10:53:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-07 10:53:41,938 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 303 [2019-09-07 10:53:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:41,940 INFO L225 Difference]: With dead ends: 452 [2019-09-07 10:53:41,940 INFO L226 Difference]: Without dead ends: 309 [2019-09-07 10:53:41,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-07 10:53:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-07 10:53:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2019-09-07 10:53:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-07 10:53:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 310 transitions. [2019-09-07 10:53:41,950 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 310 transitions. Word has length 303 [2019-09-07 10:53:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:41,951 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 310 transitions. [2019-09-07 10:53:41,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-07 10:53:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 310 transitions. [2019-09-07 10:53:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-07 10:53:41,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:41,953 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:41,953 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:41,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1701300180, now seen corresponding path program 74 times [2019-09-07 10:53:41,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:41,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:41,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:41,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:53:41,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7127 backedges. 26 proven. 6241 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-07 10:53:44,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:44,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:44,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:53:44,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:53:44,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:44,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-07 10:53:44,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7127 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-09-07 10:53:44,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:44,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 83 [2019-09-07 10:53:44,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-07 10:53:44,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-07 10:53:44,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:53:44,577 INFO L87 Difference]: Start difference. First operand 308 states and 310 transitions. Second operand 83 states. [2019-09-07 10:53:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:44,911 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2019-09-07 10:53:44,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-07 10:53:44,911 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 305 [2019-09-07 10:53:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:44,912 INFO L225 Difference]: With dead ends: 454 [2019-09-07 10:53:44,912 INFO L226 Difference]: Without dead ends: 311 [2019-09-07 10:53:44,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 10:53:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-07 10:53:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2019-09-07 10:53:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-07 10:53:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 312 transitions. [2019-09-07 10:53:44,922 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 312 transitions. Word has length 305 [2019-09-07 10:53:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:44,922 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 312 transitions. [2019-09-07 10:53:44,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-07 10:53:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 312 transitions. [2019-09-07 10:53:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-07 10:53:44,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:44,924 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:44,924 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1760620814, now seen corresponding path program 75 times [2019-09-07 10:53:44,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:44,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:44,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7286 backedges. 26 proven. 6400 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-07 10:53:47,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:47,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:47,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:53:47,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:53:47,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:47,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-07 10:53:47,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:51,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 10:53:51,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:53:51,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:53:51,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:53:51,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 10:53:51,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:53:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7286 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 6712 trivial. 0 not checked. [2019-09-07 10:53:51,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:51,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 36] total 117 [2019-09-07 10:53:51,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-07 10:53:51,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-07 10:53:51,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3500, Invalid=10072, Unknown=0, NotChecked=0, Total=13572 [2019-09-07 10:53:51,674 INFO L87 Difference]: Start difference. First operand 310 states and 312 transitions. Second operand 117 states. [2019-09-07 10:54:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:10,142 INFO L93 Difference]: Finished difference Result 466 states and 471 transitions. [2019-09-07 10:54:10,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-07 10:54:10,143 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 307 [2019-09-07 10:54:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:10,145 INFO L225 Difference]: With dead ends: 466 [2019-09-07 10:54:10,145 INFO L226 Difference]: Without dead ends: 323 [2019-09-07 10:54:10,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 249 SyntacticMatches, 25 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9744 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=10324, Invalid=30278, Unknown=0, NotChecked=0, Total=40602 [2019-09-07 10:54:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-07 10:54:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2019-09-07 10:54:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-07 10:54:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 322 transitions. [2019-09-07 10:54:10,158 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 322 transitions. Word has length 307 [2019-09-07 10:54:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:10,158 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 322 transitions. [2019-09-07 10:54:10,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-07 10:54:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 322 transitions. [2019-09-07 10:54:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-07 10:54:10,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:10,160 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:10,160 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:10,160 INFO L82 PathProgramCache]: Analyzing trace with hash 999196359, now seen corresponding path program 76 times [2019-09-07 10:54:10,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:10,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:10,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:54:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7555 backedges. 28 proven. 6561 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-09-07 10:54:12,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:12,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:54:12,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:54:12,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:54:12,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:54:12,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-07 10:54:12,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:54:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7555 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2019-09-07 10:54:12,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:54:12,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 85 [2019-09-07 10:54:12,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-07 10:54:12,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-07 10:54:12,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 10:54:12,997 INFO L87 Difference]: Start difference. First operand 320 states and 322 transitions. Second operand 85 states. [2019-09-07 10:54:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:13,347 INFO L93 Difference]: Finished difference Result 474 states and 478 transitions. [2019-09-07 10:54:13,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-07 10:54:13,348 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 317 [2019-09-07 10:54:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:13,349 INFO L225 Difference]: With dead ends: 474 [2019-09-07 10:54:13,349 INFO L226 Difference]: Without dead ends: 323 [2019-09-07 10:54:13,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 10:54:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-07 10:54:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2019-09-07 10:54:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-07 10:54:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 324 transitions. [2019-09-07 10:54:13,361 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 324 transitions. Word has length 317 [2019-09-07 10:54:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:13,361 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 324 transitions. [2019-09-07 10:54:13,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-07 10:54:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 324 transitions. [2019-09-07 10:54:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-07 10:54:13,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:13,363 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:13,363 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:13,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1960710373, now seen corresponding path program 77 times [2019-09-07 10:54:13,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:13,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:13,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:13,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:54:13,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7718 backedges. 28 proven. 6724 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-09-07 10:54:16,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:16,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:54:16,046 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1