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/loop-new/gauss_sum.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:58:49,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:58:49,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:58:49,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:58:49,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:58:49,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:58:49,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:58:49,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:58:49,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:58:49,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:58:49,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:58:49,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:58:49,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:58:49,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:58:49,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:58:49,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:58:49,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:58:49,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:58:49,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:58:49,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:58:49,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:58:49,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:58:49,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:58:49,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:58:49,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:58:49,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:58:49,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:58:49,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:58:49,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:58:49,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:58:49,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:58:49,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:58:49,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:58:49,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:58:49,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:58:49,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:58:49,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:58:49,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:58:49,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:58:49,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:58:49,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:58:49,481 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-03 19:58:49,494 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:58:49,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:58:49,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:58:49,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:58:49,496 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:58:49,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:58:49,497 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:58:49,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:58:49,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:58:49,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:58:49,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:58:49,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:58:49,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:58:49,498 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:58:49,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:58:49,498 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:58:49,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:58:49,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:58:49,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:58:49,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:58:49,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:58:49,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:58:49,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:58:49,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:58:49,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:58:49,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:58:49,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:58:49,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:58:49,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:58:49,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:58:49,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:58:49,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:58:49,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:58:49,545 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:58:49,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2019-09-03 19:58:49,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a75bc92/ef182247786f41b4a492ba20a116faba/FLAG5ff61b9bc [2019-09-03 19:58:50,032 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:58:50,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2019-09-03 19:58:50,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a75bc92/ef182247786f41b4a492ba20a116faba/FLAG5ff61b9bc [2019-09-03 19:58:50,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a75bc92/ef182247786f41b4a492ba20a116faba [2019-09-03 19:58:50,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:58:50,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:58:50,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:58:50,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:58:50,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:58:50,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f002b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50, skipping insertion in model container [2019-09-03 19:58:50,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,484 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:58:50,513 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:58:50,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:58:50,719 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:58:50,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:58:50,768 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:58:50,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50 WrapperNode [2019-09-03 19:58:50,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:58:50,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:58:50,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:58:50,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:58:50,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (1/1) ... [2019-09-03 19:58:50,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:58:50,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:58:50,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:58:50,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:58:50,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (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-03 19:58:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:58:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:58:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:58:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:58:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:58:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:58:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:58:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:58:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:58:50,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:58:51,141 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:58:51,141 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 19:58:51,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:58:51 BoogieIcfgContainer [2019-09-03 19:58:51,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:58:51,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:58:51,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:58:51,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:58:51,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:58:50" (1/3) ... [2019-09-03 19:58:51,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8ea1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:58:51, skipping insertion in model container [2019-09-03 19:58:51,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:58:50" (2/3) ... [2019-09-03 19:58:51,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8ea1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:58:51, skipping insertion in model container [2019-09-03 19:58:51,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:58:51" (3/3) ... [2019-09-03 19:58:51,167 INFO L109 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+lhb-reducer.c [2019-09-03 19:58:51,189 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:58:51,205 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:58:51,230 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:58:51,257 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:58:51,257 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:58:51,258 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:58:51,258 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:58:51,258 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:58:51,258 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:58:51,258 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:58:51,258 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:58:51,258 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:58:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-03 19:58:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:58:51,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:51,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:51,282 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1720236422, now seen corresponding path program 1 times [2019-09-03 19:58:51,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:51,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:51,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:51,375 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:51,375 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:51,375 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:51,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:51,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:58:51,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:51,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:51,632 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-03 19:58:51,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:58:51,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-03 19:58:51,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:58:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:58:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:58:51,658 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 9 states. [2019-09-03 19:58:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:51,846 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-09-03 19:58:51,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:58:51,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-09-03 19:58:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:51,857 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:58:51,858 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:58:51,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:58:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:58:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 19:58:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 19:58:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-03 19:58:51,893 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-03 19:58:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:51,893 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-03 19:58:51,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:58:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-03 19:58:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:58:51,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:51,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:51,895 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:51,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1787659072, now seen corresponding path program 1 times [2019-09-03 19:58:51,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:51,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:51,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:51,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:51,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:51,910 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:51,911 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:51,911 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:51,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:51,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:58:51,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:52,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:52,072 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-03 19:58:52,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:52,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 19:58:52,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:58:52,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:58:52,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:58:52,078 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-09-03 19:58:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:52,200 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 19:58:52,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:58:52,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-09-03 19:58:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:52,202 INFO L225 Difference]: With dead ends: 22 [2019-09-03 19:58:52,202 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:58:52,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:58:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:58:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 19:58:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:58:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:58:52,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-03 19:58:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:52,215 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:58:52,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:58:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:58:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:58:52,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:52,217 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:52,217 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:52,218 INFO L82 PathProgramCache]: Analyzing trace with hash -417206074, now seen corresponding path program 2 times [2019-09-03 19:58:52,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:52,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:52,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:52,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:52,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:52,247 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:52,248 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:52,248 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:52,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:52,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:52,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:52,288 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:58:52,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:52,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:52,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:52,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-03 19:58:52,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:58:52,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:58:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:58:52,463 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-09-03 19:58:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:52,578 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 19:58:52,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:58:52,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-09-03 19:58:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:52,580 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:58:52,580 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:58:52,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:58:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:58:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 19:58:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 19:58:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-03 19:58:52,586 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-03 19:58:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:52,587 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-03 19:58:52,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:58:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-03 19:58:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:58:52,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:52,589 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:52,589 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:52,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash -48548864, now seen corresponding path program 3 times [2019-09-03 19:58:52,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:52,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:52,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:52,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:52,609 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:52,609 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:52,609 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:52,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:52,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:58:52,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:52,666 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:58:52,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:52,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:52,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:52,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-03 19:58:52,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:58:52,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:58:52,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:58:52,841 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2019-09-03 19:58:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:52,961 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 19:58:52,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:58:52,962 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-09-03 19:58:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:52,963 INFO L225 Difference]: With dead ends: 24 [2019-09-03 19:58:52,963 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 19:58:52,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:58:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 19:58:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 19:58:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:58:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 19:58:52,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-03 19:58:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:52,973 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 19:58:52,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:58:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 19:58:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:58:52,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:52,974 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:52,974 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1505077242, now seen corresponding path program 4 times [2019-09-03 19:58:52,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:52,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:52,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:52,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:52,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:53,004 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:53,004 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:53,004 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:53,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:53,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:53,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:53,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:58:53,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:53,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:53,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:53,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-09-03 19:58:53,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:58:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:58:53,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:58:53,256 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-09-03 19:58:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:53,426 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 19:58:53,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:58:53,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-09-03 19:58:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:53,427 INFO L225 Difference]: With dead ends: 25 [2019-09-03 19:58:53,427 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:58:53,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:58:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:58:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:58:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:58:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-03 19:58:53,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-03 19:58:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:53,433 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-03 19:58:53,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:58:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-03 19:58:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:58:53,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:53,435 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:53,435 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:53,435 INFO L82 PathProgramCache]: Analyzing trace with hash 587183296, now seen corresponding path program 5 times [2019-09-03 19:58:53,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:53,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:53,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:53,448 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:53,448 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:53,448 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 (exit command is (exit), workingDir is null) [2019-09-03 19:58:53,465 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:53,492 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:58:53,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:53,493 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:58:53,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:53,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:53,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:53,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-03 19:58:53,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:58:53,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:58:53,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:58:53,659 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2019-09-03 19:58:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:53,819 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 19:58:53,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:58:53,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-09-03 19:58:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:53,820 INFO L225 Difference]: With dead ends: 26 [2019-09-03 19:58:53,820 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:58:53,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:58:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:58:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 19:58:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:58:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 19:58:53,825 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-03 19:58:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:53,825 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 19:58:53,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:58:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 19:58:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:58:53,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:53,827 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:53,827 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1022750534, now seen corresponding path program 6 times [2019-09-03 19:58:53,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:53,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:53,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:53,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:53,847 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:53,847 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:53,847 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:53,894 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:58:53,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:53,896 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:58:53,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:54,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:58:54,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:54,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-09-03 19:58:54,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:58:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:58:54,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:58:54,051 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2019-09-03 19:58:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:54,231 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 19:58:54,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:58:54,231 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-09-03 19:58:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:54,232 INFO L225 Difference]: With dead ends: 27 [2019-09-03 19:58:54,232 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:58:54,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:58:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:58:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 19:58:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:58:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-03 19:58:54,237 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-03 19:58:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:54,237 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-03 19:58:54,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:58:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-03 19:58:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:58:54,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:54,238 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:54,239 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1640433024, now seen corresponding path program 7 times [2019-09-03 19:58:54,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:54,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:54,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:54,255 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:54,255 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:54,255 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:54,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:58:54,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:54,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:54,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:54,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-09-03 19:58:54,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:58:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:58:54,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:58:54,546 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2019-09-03 19:58:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:54,739 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 19:58:54,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:58:54,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-09-03 19:58:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:54,741 INFO L225 Difference]: With dead ends: 28 [2019-09-03 19:58:54,741 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:58:54,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:58:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:58:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 19:58:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:58:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 19:58:54,746 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-03 19:58:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:54,746 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 19:58:54,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:58:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 19:58:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:58:54,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:54,747 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:54,747 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash -686246266, now seen corresponding path program 8 times [2019-09-03 19:58:54,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:54,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:54,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:54,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:54,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:54,758 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:54,759 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:54,759 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:54,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:54,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:54,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:54,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 19:58:54,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:54,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:55,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:55,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-09-03 19:58:55,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:58:55,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:58:55,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:58:55,022 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 17 states. [2019-09-03 19:58:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:55,226 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 19:58:55,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:58:55,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-09-03 19:58:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:55,227 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:58:55,228 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:58:55,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:58:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:58:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 19:58:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:58:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-03 19:58:55,234 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-03 19:58:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:55,234 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-03 19:58:55,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:58:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-03 19:58:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:58:55,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:55,235 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:55,235 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash 201139776, now seen corresponding path program 9 times [2019-09-03 19:58:55,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:55,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:55,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:55,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:55,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:55,264 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:55,264 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:55,264 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:55,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:55,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:58:55,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:55,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 19:58:55,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:55,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:55,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:55,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-09-03 19:58:55,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:58:55,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:58:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:58:55,633 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 18 states. [2019-09-03 19:58:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:55,915 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 19:58:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:58:55,915 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-09-03 19:58:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:55,916 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:58:55,916 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:58:55,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:58:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:58:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 19:58:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:58:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 19:58:55,931 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-03 19:58:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:55,931 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 19:58:55,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:58:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 19:58:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:58:55,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:55,933 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:55,934 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1940303302, now seen corresponding path program 10 times [2019-09-03 19:58:55,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:55,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:55,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:55,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:55,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:55,960 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:55,961 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:55,961 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:55,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:56,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:56,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:56,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:58:56,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:56,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:56,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:56,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-09-03 19:58:56,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:58:56,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:58:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:58:56,622 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 19 states. [2019-09-03 19:58:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:56,901 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 19:58:56,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:58:56,902 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-09-03 19:58:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:56,903 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:58:56,903 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:58:56,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:58:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:58:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 19:58:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 19:58:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-03 19:58:56,911 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-03 19:58:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:56,912 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-03 19:58:56,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:58:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-03 19:58:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:58:56,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:56,914 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:56,916 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:56,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash 19797760, now seen corresponding path program 11 times [2019-09-03 19:58:56,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:56,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:56,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:56,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:56,940 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:56,940 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:56,940 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:56,987 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:58:56,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:56,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 19:58:56,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:57,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:58:57,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:57,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-09-03 19:58:57,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:58:57,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:58:57,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:58:57,280 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-09-03 19:58:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:57,558 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 19:58:57,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:58:57,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-09-03 19:58:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:57,560 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:58:57,560 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:58:57,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:58:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:58:57,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 19:58:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:58:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 19:58:57,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-03 19:58:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:57,567 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 19:58:57,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:58:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 19:58:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:58:57,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:57,568 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:57,568 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:57,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:57,568 INFO L82 PathProgramCache]: Analyzing trace with hash 613668102, now seen corresponding path program 12 times [2019-09-03 19:58:57,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:57,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:57,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:57,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:57,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:57,579 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:57,579 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:57,579 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 (exit command is (exit), workingDir is null) [2019-09-03 19:58:57,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:57,664 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:58:57,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:57,666 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 19:58:57,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:58,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:58,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-09-03 19:58:58,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:58:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:58:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:58:58,058 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-03 19:58:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:58,348 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 19:58:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:58:58,348 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-03 19:58:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:58,349 INFO L225 Difference]: With dead ends: 33 [2019-09-03 19:58:58,350 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:58:58,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:58:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:58:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 19:58:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:58:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-03 19:58:58,356 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-03 19:58:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:58,357 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-03 19:58:58,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:58:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-03 19:58:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:58:58,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:58,358 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:58,358 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1843779520, now seen corresponding path program 13 times [2019-09-03 19:58:58,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:58,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:58,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:58,370 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:58,371 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:58,371 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 (exit command is (exit), workingDir is null) [2019-09-03 19:58:58,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:58,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 19:58:58,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:58,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:58,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:58,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-09-03 19:58:58,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:58:58,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:58:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:58:58,731 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 22 states. [2019-09-03 19:58:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:59,089 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 19:58:59,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:58:59,089 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-09-03 19:58:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:59,090 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:58:59,090 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:58:59,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:58:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:58:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 19:58:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:58:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 19:58:59,095 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-03 19:58:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:59,096 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 19:58:59,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:58:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 19:58:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:58:59,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:59,097 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:59,097 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1322527814, now seen corresponding path program 14 times [2019-09-03 19:58:59,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:59,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:59,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:59,106 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:59,107 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:59,107 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:58:59,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:59,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:59,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:59,168 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 19:58:59,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:59,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:58:59,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-09-03 19:58:59,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:58:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:58:59,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:58:59,492 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 23 states. [2019-09-03 19:58:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:59,842 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 19:58:59,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:58:59,849 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-09-03 19:58:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:59,850 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:58:59,850 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:58:59,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:58:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:58:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 19:58:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:58:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-03 19:58:59,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-03 19:58:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:59,861 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-03 19:58:59,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:58:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-03 19:58:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:58:59,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:59,864 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:59,865 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1951373184, now seen corresponding path program 15 times [2019-09-03 19:58:59,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:59,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:59,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:59,878 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:58:59,878 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:58:59,878 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 (exit command is (exit), workingDir is null) [2019-09-03 19:58:59,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:00,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:59:00,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:00,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 19:59:00,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:00,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:00,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:00,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-09-03 19:59:00,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:59:00,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:59:00,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:59:00,474 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 24 states. [2019-09-03 19:59:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:00,884 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 19:59:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:59:00,885 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-09-03 19:59:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:00,885 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:59:00,886 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:59:00,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:59:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:59:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:59:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:59:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 19:59:00,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-03 19:59:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:00,891 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 19:59:00,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:59:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 19:59:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:59:00,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:00,892 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:00,892 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:00,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:00,892 INFO L82 PathProgramCache]: Analyzing trace with hash -363089018, now seen corresponding path program 16 times [2019-09-03 19:59:00,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:00,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:00,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:00,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:00,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:00,901 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:00,901 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:00,901 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:00,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:01,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:01,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:01,073 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 19:59:01,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:01,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:01,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:01,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-09-03 19:59:01,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:59:01,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:59:01,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:59:01,511 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 25 states. [2019-09-03 19:59:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:01,928 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 19:59:01,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:59:01,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2019-09-03 19:59:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:01,930 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:59:01,930 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:59:01,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:59:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:59:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 19:59:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:59:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-03 19:59:01,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-03 19:59:01,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:01,937 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-03 19:59:01,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:59:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-03 19:59:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:59:01,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:01,938 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:01,938 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:01,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1629079872, now seen corresponding path program 17 times [2019-09-03 19:59:01,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:01,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:01,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:01,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:01,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:01,946 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:01,947 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:01,947 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:01,982 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:02,026 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:59:02,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:02,029 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 19:59:02,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:02,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:02,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:02,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-09-03 19:59:02,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:59:02,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:59:02,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:59:02,408 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 26 states. [2019-09-03 19:59:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:02,852 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 19:59:02,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:59:02,852 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2019-09-03 19:59:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:02,853 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:59:02,853 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:59:02,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:59:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:59:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 19:59:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:59:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 19:59:02,863 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-03 19:59:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:02,863 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 19:59:02,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:59:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 19:59:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:59:02,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:02,864 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:02,864 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:02,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:02,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1038193978, now seen corresponding path program 18 times [2019-09-03 19:59:02,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:02,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:02,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:02,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:02,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:02,886 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:02,886 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:02,886 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:02,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:03,027 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:59:03,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:03,029 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 19:59:03,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:03,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:03,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:03,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-09-03 19:59:03,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:59:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:59:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:59:03,718 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 27 states. [2019-09-03 19:59:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:04,346 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 19:59:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:59:04,347 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-09-03 19:59:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:04,348 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:59:04,348 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:59:04,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:59:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:59:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-03 19:59:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 19:59:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-03 19:59:04,365 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-03 19:59:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:04,367 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-03 19:59:04,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:59:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-03 19:59:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 19:59:04,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:04,369 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:04,369 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2119304704, now seen corresponding path program 19 times [2019-09-03 19:59:04,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:04,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:04,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:04,390 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:04,391 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:04,391 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:04,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:04,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-03 19:59:04,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:04,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:04,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:04,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-09-03 19:59:04,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:59:04,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:59:04,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:59:04,974 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 28 states. [2019-09-03 19:59:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:05,504 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 19:59:05,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:59:05,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2019-09-03 19:59:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:05,506 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:59:05,506 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:59:05,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:59:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:59:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 19:59:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:59:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 19:59:05,512 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-03 19:59:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:05,512 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 19:59:05,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:59:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 19:59:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:59:05,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:05,513 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:05,513 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:05,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1273998842, now seen corresponding path program 20 times [2019-09-03 19:59:05,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:05,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:05,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:05,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:05,521 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:05,522 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:05,522 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:05,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:05,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:05,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:05,585 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-03 19:59:05,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:06,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:06,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:06,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-09-03 19:59:06,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:59:06,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:59:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:59:06,047 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 29 states. [2019-09-03 19:59:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:06,583 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 19:59:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:59:06,584 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2019-09-03 19:59:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:06,585 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:59:06,585 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:59:06,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:59:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:59:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 19:59:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 19:59:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-03 19:59:06,589 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-03 19:59:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:06,590 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-03 19:59:06,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:59:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-03 19:59:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:59:06,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:06,591 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:06,591 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:06,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash -839320896, now seen corresponding path program 21 times [2019-09-03 19:59:06,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:06,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:06,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:06,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:06,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:06,600 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:06,600 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:06,600 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:06,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:06,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:59:06,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:06,868 WARN L254 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-03 19:59:06,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:07,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:07,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:07,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-09-03 19:59:07,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:59:07,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:59:07,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:59:07,378 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 30 states. [2019-09-03 19:59:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:07,951 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 19:59:07,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:59:07,954 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2019-09-03 19:59:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:07,955 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:59:07,955 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:59:07,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:59:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:59:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 19:59:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:59:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 19:59:07,960 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-03 19:59:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:07,960 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 19:59:07,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:59:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 19:59:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:59:07,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:07,960 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:07,961 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:07,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -249206458, now seen corresponding path program 22 times [2019-09-03 19:59:07,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:07,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:07,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:07,969 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:07,969 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:07,969 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:07,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:08,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:08,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:08,205 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-03 19:59:08,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:08,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:08,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:08,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-09-03 19:59:08,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:59:08,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:59:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:59:08,752 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 31 states. [2019-09-03 19:59:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:09,385 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 19:59:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:59:09,386 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2019-09-03 19:59:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:09,386 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:59:09,387 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:59:09,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:59:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:59:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 19:59:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:59:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-03 19:59:09,394 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-03 19:59:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:09,394 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-03 19:59:09,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:59:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-03 19:59:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:59:09,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:09,395 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:09,395 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:09,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash 864471936, now seen corresponding path program 23 times [2019-09-03 19:59:09,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:09,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:09,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:09,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:09,404 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:09,404 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:09,404 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:09,419 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:09,466 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:59:09,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:09,470 WARN L254 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-03 19:59:09,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:10,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:10,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:10,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-09-03 19:59:10,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:59:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:59:10,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:59:10,059 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 32 states. [2019-09-03 19:59:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:10,735 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 19:59:10,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:59:10,739 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2019-09-03 19:59:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:10,740 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:59:10,740 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:59:10,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:59:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:59:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 19:59:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:59:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 19:59:10,747 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-03 19:59:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:10,747 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 19:59:10,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:59:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 19:59:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:59:10,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:10,748 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:10,748 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:10,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1028763782, now seen corresponding path program 24 times [2019-09-03 19:59:10,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:10,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:10,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:10,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:10,756 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:10,756 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:10,756 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:10,773 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:10,866 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:59:10,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:10,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-03 19:59:10,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:11,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:11,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:11,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-09-03 19:59:11,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:59:11,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:59:11,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:59:11,453 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 33 states. [2019-09-03 19:59:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:12,162 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 19:59:12,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:59:12,163 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-09-03 19:59:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:12,164 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:59:12,164 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:59:12,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:59:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:59:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 19:59:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:59:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-03 19:59:12,169 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-03 19:59:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:12,169 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-03 19:59:12,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:59:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-03 19:59:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:59:12,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:12,170 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:12,170 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1826843712, now seen corresponding path program 25 times [2019-09-03 19:59:12,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:12,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:12,178 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:12,178 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:12,178 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:12,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:12,271 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-03 19:59:12,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:12,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:12,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:12,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-09-03 19:59:12,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:59:12,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:59:12,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:59:12,881 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 34 states. [2019-09-03 19:59:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:13,648 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 19:59:13,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:59:13,649 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-09-03 19:59:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:13,649 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:59:13,649 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:59:13,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:59:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:59:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 19:59:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:59:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 19:59:13,656 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-03 19:59:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:13,656 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 19:59:13,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:59:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 19:59:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:59:13,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:13,657 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:13,657 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 797517766, now seen corresponding path program 26 times [2019-09-03 19:59:13,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:13,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:13,665 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:13,665 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:13,665 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:13,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:13,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:13,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:13,739 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-03 19:59:13,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:14,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:59:14,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:14,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-09-03 19:59:14,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:59:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:59:14,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:59:14,362 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 35 states. [2019-09-03 19:59:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:15,170 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 19:59:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:59:15,170 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-09-03 19:59:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:15,171 INFO L225 Difference]: With dead ends: 47 [2019-09-03 19:59:15,171 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:59:15,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:59:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:59:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 19:59:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:59:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 19:59:15,176 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-03 19:59:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:15,176 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 19:59:15,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:59:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 19:59:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:59:15,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:15,177 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:15,177 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1046815488, now seen corresponding path program 27 times [2019-09-03 19:59:15,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:15,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:15,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:15,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:15,185 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:15,185 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:15,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:16,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:59:16,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:16,135 WARN L254 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-03 19:59:16,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:16,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:16,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:16,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-09-03 19:59:16,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:59:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:59:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:59:16,789 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 36 states. [2019-09-03 19:59:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:17,622 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 19:59:17,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:59:17,623 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2019-09-03 19:59:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:17,623 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:59:17,624 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:59:17,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:59:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:59:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 19:59:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:59:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 19:59:17,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-03 19:59:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:17,629 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 19:59:17,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:59:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 19:59:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:59:17,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:17,629 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:17,629 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1908395782, now seen corresponding path program 28 times [2019-09-03 19:59:17,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:17,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:17,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:17,637 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:17,637 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:17,637 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:17,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:18,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:18,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:18,236 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 19:59:18,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:18,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:19,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-09-03 19:59:19,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:59:19,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:59:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:59:19,047 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 37 states. [2019-09-03 19:59:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:19,955 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 19:59:19,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:59:19,956 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2019-09-03 19:59:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:19,956 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:59:19,956 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:59:19,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:59:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:59:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 19:59:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:59:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-03 19:59:19,961 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-03 19:59:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:19,961 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-03 19:59:19,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:59:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-03 19:59:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:59:19,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:19,962 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:19,962 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:19,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:19,962 INFO L82 PathProgramCache]: Analyzing trace with hash -969335360, now seen corresponding path program 29 times [2019-09-03 19:59:19,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:19,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:19,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:19,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:19,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:19,970 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:19,970 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:19,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:19,986 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:20,043 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:59:20,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:20,047 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-03 19:59:20,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:20,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:20,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:20,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-09-03 19:59:20,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:59:20,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:59:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:59:20,786 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 38 states. [2019-09-03 19:59:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:21,721 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 19:59:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:59:21,721 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2019-09-03 19:59:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:21,722 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:59:21,722 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:59:21,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:59:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:59:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 19:59:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:59:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 19:59:21,728 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-03 19:59:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:21,728 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 19:59:21,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:59:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 19:59:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:59:21,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:21,729 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:21,729 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:21,730 INFO L82 PathProgramCache]: Analyzing trace with hash 15312454, now seen corresponding path program 30 times [2019-09-03 19:59:21,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:21,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:21,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:21,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,737 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:21,737 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:21,737 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:21,748 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:21,993 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:59:21,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:21,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-03 19:59:21,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:22,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:22,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:22,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-09-03 19:59:22,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:59:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:59:22,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:59:22,753 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 39 states. [2019-09-03 19:59:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:23,745 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-03 19:59:23,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:59:23,746 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 46 [2019-09-03 19:59:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:23,747 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:59:23,747 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:59:23,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:59:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:59:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 19:59:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:59:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-09-03 19:59:23,754 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-09-03 19:59:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:23,754 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-09-03 19:59:23,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:59:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-09-03 19:59:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:59:23,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:23,755 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:23,755 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:23,756 INFO L82 PathProgramCache]: Analyzing trace with hash 474623616, now seen corresponding path program 31 times [2019-09-03 19:59:23,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:23,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:23,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:23,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:23,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:23,766 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:23,766 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:23,766 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:23,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:23,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-03 19:59:23,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:24,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:24,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:24,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-09-03 19:59:24,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:59:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:59:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:59:24,658 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 40 states. [2019-09-03 19:59:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:25,715 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-03 19:59:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:59:25,715 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 47 [2019-09-03 19:59:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:25,716 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:59:25,716 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:59:25,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:59:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:59:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-03 19:59:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:59:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 19:59:25,722 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-09-03 19:59:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:25,723 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 19:59:25,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:59:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 19:59:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:59:25,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:25,723 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:25,724 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:25,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1828367750, now seen corresponding path program 32 times [2019-09-03 19:59:25,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:25,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:25,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:25,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:25,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:25,731 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:25,732 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:25,732 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:25,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:25,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:25,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:25,811 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-03 19:59:25,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:26,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:59:26,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:26,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-09-03 19:59:26,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:59:26,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:59:26,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:59:26,653 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 41 states. [2019-09-03 19:59:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:27,901 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-03 19:59:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:59:27,901 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2019-09-03 19:59:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:27,901 INFO L225 Difference]: With dead ends: 53 [2019-09-03 19:59:27,902 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:59:27,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:59:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:59:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-03 19:59:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:59:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-09-03 19:59:27,908 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-09-03 19:59:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:27,908 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-09-03 19:59:27,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:59:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-09-03 19:59:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:59:27,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:27,909 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:27,909 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:27,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash 844762944, now seen corresponding path program 33 times [2019-09-03 19:59:27,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:27,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:27,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:27,916 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:27,916 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:27,916 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:27,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:28,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 19:59:28,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:28,845 WARN L254 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-03 19:59:28,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:29,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:29,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:29,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-09-03 19:59:29,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:59:29,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:59:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:59:29,710 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 42 states. [2019-09-03 19:59:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:30,845 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-03 19:59:30,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:59:30,845 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 49 [2019-09-03 19:59:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:30,846 INFO L225 Difference]: With dead ends: 54 [2019-09-03 19:59:30,846 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:59:30,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:59:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:59:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-03 19:59:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:59:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-03 19:59:30,853 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-09-03 19:59:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:30,854 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-03 19:59:30,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:59:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-03 19:59:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:59:30,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:30,855 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:30,855 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:30,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash 417785030, now seen corresponding path program 34 times [2019-09-03 19:59:30,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:30,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:30,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:30,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:30,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:30,862 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:30,863 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:30,863 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:30,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:31,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:31,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:31,237 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-03 19:59:31,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:32,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:32,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:32,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-09-03 19:59:32,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:59:32,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:59:32,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:59:32,158 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 43 states. [2019-09-03 19:59:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:33,335 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-03 19:59:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:59:33,335 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2019-09-03 19:59:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:33,336 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:59:33,337 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:59:33,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:59:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:59:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-03 19:59:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:59:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-03 19:59:33,342 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-09-03 19:59:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:33,342 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-03 19:59:33,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:59:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-03 19:59:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:59:33,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:33,343 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:33,343 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash 66371584, now seen corresponding path program 35 times [2019-09-03 19:59:33,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:33,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:33,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:33,351 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:33,351 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:33,351 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:33,375 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:33,458 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 19:59:33,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:33,463 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 171 conjunts are in the unsatisfiable core [2019-09-03 19:59:33,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:34,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:34,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:34,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-09-03 19:59:34,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:59:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:59:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:59:34,404 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 44 states. [2019-09-03 19:59:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:35,655 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-03 19:59:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:59:35,655 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 51 [2019-09-03 19:59:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:35,656 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:59:35,656 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:59:35,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:59:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:59:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-09-03 19:59:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:59:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-03 19:59:35,663 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-09-03 19:59:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:35,664 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-03 19:59:35,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:59:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-03 19:59:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:59:35,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:35,665 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:35,665 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2057456646, now seen corresponding path program 36 times [2019-09-03 19:59:35,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:35,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:35,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:35,673 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:35,673 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:35,673 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:35,692 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:36,143 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:59:36,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:36,146 WARN L254 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-03 19:59:36,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:37,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:37,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:37,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-09-03 19:59:37,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:59:37,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:59:37,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:59:37,130 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 45 states. [2019-09-03 19:59:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:38,433 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-03 19:59:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:59:38,433 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2019-09-03 19:59:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:38,434 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:59:38,434 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:59:38,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:59:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:59:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-03 19:59:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:59:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-03 19:59:38,441 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-09-03 19:59:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:38,442 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-03 19:59:38,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:59:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-03 19:59:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:59:38,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:38,442 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:38,443 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:38,443 INFO L82 PathProgramCache]: Analyzing trace with hash -643415872, now seen corresponding path program 37 times [2019-09-03 19:59:38,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:38,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:38,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:38,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:38,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:38,451 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:38,451 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:38,451 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:38,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:38,555 WARN L254 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 179 conjunts are in the unsatisfiable core [2019-09-03 19:59:38,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:39,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:39,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:39,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-09-03 19:59:39,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:59:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:59:39,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:59:39,568 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 46 states. [2019-09-03 19:59:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:40,915 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-03 19:59:40,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:59:40,915 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 53 [2019-09-03 19:59:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:40,916 INFO L225 Difference]: With dead ends: 58 [2019-09-03 19:59:40,916 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 19:59:40,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:59:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 19:59:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-03 19:59:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:59:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 19:59:40,923 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-09-03 19:59:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:40,923 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 19:59:40,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:59:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 19:59:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:59:40,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:40,924 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:40,924 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:40,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1528881990, now seen corresponding path program 38 times [2019-09-03 19:59:40,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:40,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:40,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:40,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:40,932 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:40,933 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:40,933 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:40,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:41,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:41,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:41,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 183 conjunts are in the unsatisfiable core [2019-09-03 19:59:41,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:42,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:42,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:42,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-09-03 19:59:42,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:59:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:59:42,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:59:42,150 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 47 states. [2019-09-03 19:59:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:43,621 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-03 19:59:43,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:59:43,622 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 54 [2019-09-03 19:59:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:43,623 INFO L225 Difference]: With dead ends: 59 [2019-09-03 19:59:43,623 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:59:43,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:59:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:59:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-03 19:59:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 19:59:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-03 19:59:43,630 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-09-03 19:59:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:43,630 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-03 19:59:43,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:59:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-03 19:59:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:59:43,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:43,631 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:43,631 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 150638976, now seen corresponding path program 39 times [2019-09-03 19:59:43,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:43,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:43,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:43,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:43,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:43,641 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:43,641 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:43,641 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:43,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:45,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 19:59:45,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:45,519 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 187 conjunts are in the unsatisfiable core [2019-09-03 19:59:45,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:46,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:46,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-09-03 19:59:46,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:59:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:59:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:59:46,641 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 48 states. [2019-09-03 19:59:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:48,155 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-03 19:59:48,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:59:48,156 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 55 [2019-09-03 19:59:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:48,156 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:59:48,156 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 19:59:48,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:59:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 19:59:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-03 19:59:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:59:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-03 19:59:48,161 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-09-03 19:59:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:48,162 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-03 19:59:48,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:59:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-03 19:59:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:59:48,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:48,162 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:48,163 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash 374778502, now seen corresponding path program 40 times [2019-09-03 19:59:48,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:48,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:48,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:48,171 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:48,171 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:48,171 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:48,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:48,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:48,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:48,644 WARN L254 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 191 conjunts are in the unsatisfiable core [2019-09-03 19:59:48,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:49,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:49,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:49,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-09-03 19:59:49,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:59:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:59:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:59:49,824 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 49 states. [2019-09-03 19:59:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:51,389 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-03 19:59:51,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:59:51,389 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2019-09-03 19:59:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:51,390 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:59:51,390 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:59:51,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:59:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:59:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-03 19:59:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:59:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-03 19:59:51,395 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-09-03 19:59:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:51,396 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-03 19:59:51,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:59:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-03 19:59:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 19:59:51,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:51,396 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:51,397 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1266830784, now seen corresponding path program 41 times [2019-09-03 19:59:51,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:51,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:51,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:51,405 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:51,406 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:51,406 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 (exit command is (exit), workingDir is null) [2019-09-03 19:59:51,434 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:51,591 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-03 19:59:51,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:51,597 WARN L254 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 195 conjunts are in the unsatisfiable core [2019-09-03 19:59:51,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:52,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:52,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:52,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-09-03 19:59:52,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:59:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:59:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:59:52,787 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 50 states. [2019-09-03 19:59:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:54,413 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-03 19:59:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:59:54,414 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2019-09-03 19:59:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:54,414 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:59:54,415 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 19:59:54,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:59:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 19:59:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-03 19:59:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 19:59:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-03 19:59:54,420 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-09-03 19:59:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:54,421 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-03 19:59:54,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:59:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-03 19:59:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 19:59:54,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:54,422 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:54,422 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:54,422 INFO L82 PathProgramCache]: Analyzing trace with hash -617111098, now seen corresponding path program 42 times [2019-09-03 19:59:54,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:54,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:54,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:54,430 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:54,430 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:54,430 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:54,443 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:55,000 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-03 19:59:55,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:55,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 199 conjunts are in the unsatisfiable core [2019-09-03 19:59:55,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:56,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:56,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:56,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-09-03 19:59:56,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:59:56,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:59:56,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:59:56,295 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 51 states. [2019-09-03 19:59:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:58,022 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-03 19:59:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:59:58,022 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 58 [2019-09-03 19:59:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:58,023 INFO L225 Difference]: With dead ends: 63 [2019-09-03 19:59:58,023 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 19:59:58,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:59:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 19:59:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-03 19:59:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 19:59:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-09-03 19:59:58,031 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-09-03 19:59:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:58,031 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-09-03 19:59:58,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:59:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-09-03 19:59:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-03 19:59:58,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:58,032 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:58,032 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:58,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1950637312, now seen corresponding path program 43 times [2019-09-03 19:59:58,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:58,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:58,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:58,040 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 19:59:58,040 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 19:59:58,041 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 19:59:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:58,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 203 conjunts are in the unsatisfiable core [2019-09-03 19:59:58,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:59,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:59,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:59:59,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-09-03 19:59:59,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:59:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:59:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:59:59,470 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 52 states. [2019-09-03 20:00:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:01,243 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-09-03 20:00:01,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:00:01,243 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 59 [2019-09-03 20:00:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:01,244 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:00:01,244 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:00:01,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:00:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:00:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-09-03 20:00:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 20:00:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-03 20:00:01,251 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-09-03 20:00:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:01,251 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-03 20:00:01,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:00:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-03 20:00:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 20:00:01,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:01,252 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:01,252 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash -340276986, now seen corresponding path program 44 times [2019-09-03 20:00:01,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:01,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:01,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:01,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:01,260 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:01,261 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:01,261 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:01,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:01,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:01,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:01,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 207 conjunts are in the unsatisfiable core [2019-09-03 20:00:01,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:02,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:02,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-09-03 20:00:02,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:00:02,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:00:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:00:02,769 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 53 states. [2019-09-03 20:00:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:04,634 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-03 20:00:04,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:00:04,634 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 60 [2019-09-03 20:00:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:04,635 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:00:04,635 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:00:04,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2755, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:00:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:00:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-03 20:00:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:00:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-09-03 20:00:04,642 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-09-03 20:00:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:04,642 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-09-03 20:00:04,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:00:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-09-03 20:00:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 20:00:04,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:04,642 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:04,643 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1958714432, now seen corresponding path program 45 times [2019-09-03 20:00:04,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:04,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:04,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:04,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:04,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:04,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:04,650 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:04,650 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:04,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:07,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:00:07,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:07,313 WARN L254 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 211 conjunts are in the unsatisfiable core [2019-09-03 20:00:07,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:08,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:08,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:08,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-09-03 20:00:08,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:00:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:00:08,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:00:08,699 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 54 states. [2019-09-03 20:00:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:10,575 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-09-03 20:00:10,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:00:10,576 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 61 [2019-09-03 20:00:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:10,576 INFO L225 Difference]: With dead ends: 66 [2019-09-03 20:00:10,577 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 20:00:10,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:00:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 20:00:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-03 20:00:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:00:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-03 20:00:10,584 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-09-03 20:00:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:10,584 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-03 20:00:10,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:00:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-03 20:00:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:00:10,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:10,585 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:10,585 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash -590667706, now seen corresponding path program 46 times [2019-09-03 20:00:10,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:10,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:10,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:10,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:10,594 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:10,595 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:10,595 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:10,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:11,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:11,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:11,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 215 conjunts are in the unsatisfiable core [2019-09-03 20:00:11,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:12,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:12,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:12,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-09-03 20:00:12,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:00:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:00:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:00:12,623 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 55 states. [2019-09-03 20:00:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:14,600 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-03 20:00:14,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:00:14,600 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 62 [2019-09-03 20:00:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:14,600 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:00:14,601 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:00:14,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:00:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:00:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-03 20:00:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:00:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-09-03 20:00:14,607 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-09-03 20:00:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:14,607 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-09-03 20:00:14,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:00:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-09-03 20:00:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-03 20:00:14,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:14,608 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:14,608 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1130892160, now seen corresponding path program 47 times [2019-09-03 20:00:14,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:14,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:14,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:14,616 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:14,616 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:14,616 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 (exit command is (exit), workingDir is null) [2019-09-03 20:00:14,644 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:14,770 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-03 20:00:14,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:14,776 WARN L254 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 219 conjunts are in the unsatisfiable core [2019-09-03 20:00:14,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:16,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-09-03 20:00:16,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:00:16,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:00:16,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:00:16,331 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 56 states. [2019-09-03 20:00:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:18,394 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-09-03 20:00:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 20:00:18,395 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 63 [2019-09-03 20:00:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:18,396 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:00:18,396 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 20:00:18,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:00:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 20:00:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-03 20:00:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:00:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-03 20:00:18,404 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-09-03 20:00:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:18,405 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-03 20:00:18,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:00:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-03 20:00:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:00:18,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:18,406 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:18,406 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:18,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:18,406 INFO L82 PathProgramCache]: Analyzing trace with hash -697981050, now seen corresponding path program 48 times [2019-09-03 20:00:18,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:18,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:18,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:18,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:18,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:18,422 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:18,422 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:18,422 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 (exit command is (exit), workingDir is null) [2019-09-03 20:00:18,440 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:19,026 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 20:00:19,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:19,033 WARN L254 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 223 conjunts are in the unsatisfiable core [2019-09-03 20:00:19,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:20,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:20,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:20,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-09-03 20:00:20,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:00:20,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:00:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:00:20,581 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 57 states. [2019-09-03 20:00:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:22,729 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-03 20:00:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:00:22,729 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 64 [2019-09-03 20:00:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:22,730 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:00:22,730 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 20:00:22,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:00:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 20:00:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-03 20:00:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 20:00:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-09-03 20:00:22,736 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-09-03 20:00:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:22,736 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-09-03 20:00:22,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:00:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-09-03 20:00:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 20:00:22,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:22,737 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:22,737 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash -162638528, now seen corresponding path program 49 times [2019-09-03 20:00:22,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:22,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:22,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:22,746 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:22,746 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:22,746 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 (exit command is (exit), workingDir is null) [2019-09-03 20:00:22,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:22,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 227 conjunts are in the unsatisfiable core [2019-09-03 20:00:22,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:24,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:24,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:24,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-09-03 20:00:24,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:00:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:00:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:00:24,450 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 58 states. [2019-09-03 20:00:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:26,634 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-09-03 20:00:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 20:00:26,635 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 65 [2019-09-03 20:00:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:26,636 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:00:26,636 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:00:26,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=3305, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:00:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:00:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-03 20:00:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:00:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-03 20:00:26,644 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-09-03 20:00:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:26,644 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-03 20:00:26,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:00:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-03 20:00:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:00:26,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:26,645 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:26,645 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:26,646 INFO L82 PathProgramCache]: Analyzing trace with hash -746889530, now seen corresponding path program 50 times [2019-09-03 20:00:26,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:26,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:26,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:26,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:26,654 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:26,654 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:26,654 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:26,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:26,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:26,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:26,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 231 conjunts are in the unsatisfiable core [2019-09-03 20:00:26,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:28,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:28,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-09-03 20:00:28,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:00:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:00:28,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:00:28,418 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 59 states. [2019-09-03 20:00:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:30,699 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-03 20:00:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:00:30,699 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 66 [2019-09-03 20:00:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:30,700 INFO L225 Difference]: With dead ends: 71 [2019-09-03 20:00:30,701 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:00:30,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=3421, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:00:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:00:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-03 20:00:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 20:00:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-09-03 20:00:30,707 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-09-03 20:00:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:30,707 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-09-03 20:00:30,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:00:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-09-03 20:00:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 20:00:30,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:30,708 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:30,708 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:30,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1678801408, now seen corresponding path program 51 times [2019-09-03 20:00:30,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:30,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:30,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:30,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:30,724 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:30,724 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:30,724 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:30,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:35,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 20:00:35,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:35,117 WARN L254 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 235 conjunts are in the unsatisfiable core [2019-09-03 20:00:35,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:36,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:36,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:36,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-09-03 20:00:36,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:00:36,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:00:36,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:00:36,817 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 60 states. [2019-09-03 20:00:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:39,168 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-09-03 20:00:39,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 20:00:39,168 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 67 [2019-09-03 20:00:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:39,169 INFO L225 Difference]: With dead ends: 72 [2019-09-03 20:00:39,169 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 20:00:39,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:00:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 20:00:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-03 20:00:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 20:00:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-03 20:00:39,176 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-09-03 20:00:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:39,176 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-03 20:00:39,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:00:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-03 20:00:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:00:39,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:39,177 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:39,177 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:39,177 INFO L82 PathProgramCache]: Analyzing trace with hash -503298554, now seen corresponding path program 52 times [2019-09-03 20:00:39,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:39,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:39,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:39,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:39,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:39,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:39,185 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:39,185 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:39,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:39,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:39,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:39,802 WARN L254 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 239 conjunts are in the unsatisfiable core [2019-09-03 20:00:39,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:41,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:41,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:41,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-09-03 20:00:41,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:00:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:00:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:00:41,596 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 61 states. [2019-09-03 20:00:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:44,035 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-03 20:00:44,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:00:44,035 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 68 [2019-09-03 20:00:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:44,036 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:00:44,036 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:00:44,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=123, Invalid=3659, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:00:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:00:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-03 20:00:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:00:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-09-03 20:00:44,043 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-09-03 20:00:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:44,043 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-09-03 20:00:44,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:00:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-09-03 20:00:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 20:00:44,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:44,044 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:44,044 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1577551552, now seen corresponding path program 53 times [2019-09-03 20:00:44,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:44,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:44,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:44,052 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:44,052 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:44,053 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:44,079 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:44,244 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-03 20:00:44,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:44,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 243 conjunts are in the unsatisfiable core [2019-09-03 20:00:44,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:45,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:46,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:46,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-09-03 20:00:46,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:00:46,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:00:46,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:00:46,039 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 62 states. [2019-09-03 20:00:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:48,541 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-09-03 20:00:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 20:00:48,541 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 69 [2019-09-03 20:00:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:48,542 INFO L225 Difference]: With dead ends: 74 [2019-09-03 20:00:48,542 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 20:00:48,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=125, Invalid=3781, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:00:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 20:00:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-09-03 20:00:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:00:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-03 20:00:48,548 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-09-03 20:00:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:48,548 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-03 20:00:48,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:00:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-03 20:00:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:00:48,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:48,549 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:48,549 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1659395398, now seen corresponding path program 54 times [2019-09-03 20:00:48,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:48,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:48,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:48,558 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:48,558 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:48,558 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 (exit command is (exit), workingDir is null) [2019-09-03 20:00:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:50,898 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-03 20:00:50,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:50,905 WARN L254 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 247 conjunts are in the unsatisfiable core [2019-09-03 20:00:50,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:52,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:52,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:52,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-09-03 20:00:52,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:00:52,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:00:52,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:00:52,746 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 63 states. [2019-09-03 20:00:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:55,378 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-03 20:00:55,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:00:55,379 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 70 [2019-09-03 20:00:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:55,379 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:00:55,379 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:00:55,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=3905, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:00:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:00:55,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-03 20:00:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 20:00:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-09-03 20:00:55,386 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-09-03 20:00:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:55,386 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-09-03 20:00:55,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:00:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-09-03 20:00:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-03 20:00:55,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:55,387 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:55,387 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:55,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash -98412672, now seen corresponding path program 55 times [2019-09-03 20:00:55,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:55,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:55,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:55,396 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:00:55,396 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:00:55,396 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 (exit command is (exit), workingDir is null) [2019-09-03 20:00:55,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:00:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:55,582 WARN L254 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 251 conjunts are in the unsatisfiable core [2019-09-03 20:00:55,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:57,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:57,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:00:57,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-09-03 20:00:57,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:00:57,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:00:57,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:00:57,496 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 64 states. [2019-09-03 20:01:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:00,192 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-09-03 20:01:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:01:00,193 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 71 [2019-09-03 20:01:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:00,194 INFO L225 Difference]: With dead ends: 76 [2019-09-03 20:01:00,194 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:01:00,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=4031, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:01:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:01:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-03 20:01:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:01:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-03 20:01:00,200 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-09-03 20:01:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:00,200 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-03 20:01:00,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:01:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-03 20:01:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:01:00,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:00,201 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:00,201 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1244112006, now seen corresponding path program 56 times [2019-09-03 20:01:00,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:00,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:00,209 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:00,209 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:00,209 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 (exit command is (exit), workingDir is null) [2019-09-03 20:01:00,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:00,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:00,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:00,375 WARN L254 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 255 conjunts are in the unsatisfiable core [2019-09-03 20:01:00,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:02,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:02,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:01:02,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-09-03 20:01:02,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:01:02,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:01:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:01:02,359 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 65 states. [2019-09-03 20:01:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:05,109 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-03 20:01:05,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:01:05,109 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 72 [2019-09-03 20:01:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:05,110 INFO L225 Difference]: With dead ends: 77 [2019-09-03 20:01:05,110 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:01:05,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=131, Invalid=4159, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:01:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:01:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-03 20:01:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:01:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-09-03 20:01:05,119 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-09-03 20:01:05,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:05,119 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-09-03 20:01:05,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:01:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-09-03 20:01:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-03 20:01:05,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:05,120 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:05,120 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash -87295936, now seen corresponding path program 57 times [2019-09-03 20:01:05,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:05,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:05,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:05,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:05,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:05,129 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:05,129 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:05,129 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:05,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:01:09,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:01:09,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:09,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 259 conjunts are in the unsatisfiable core [2019-09-03 20:01:09,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:11,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:11,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:01:11,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-09-03 20:01:11,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:01:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:01:11,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:01:11,965 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 66 states. [2019-09-03 20:01:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:14,832 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-09-03 20:01:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 20:01:14,832 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 73 [2019-09-03 20:01:14,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:14,832 INFO L225 Difference]: With dead ends: 78 [2019-09-03 20:01:14,833 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:01:14,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=133, Invalid=4289, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:01:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:01:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-03 20:01:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 20:01:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-03 20:01:14,840 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-09-03 20:01:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:14,841 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-03 20:01:14,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:01:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-03 20:01:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 20:01:14,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:14,841 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:14,842 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:14,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1588730822, now seen corresponding path program 58 times [2019-09-03 20:01:14,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:14,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:14,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:14,850 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:14,850 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:14,850 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 (exit command is (exit), workingDir is null) [2019-09-03 20:01:14,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:15,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:01:15,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:15,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 263 conjunts are in the unsatisfiable core [2019-09-03 20:01:15,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:17,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:17,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:01:17,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-09-03 20:01:17,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:01:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:01:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:01:17,702 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 67 states. [2019-09-03 20:01:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:20,622 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-03 20:01:20,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:01:20,622 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 74 [2019-09-03 20:01:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:20,623 INFO L225 Difference]: With dead ends: 79 [2019-09-03 20:01:20,623 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 20:01:20,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=135, Invalid=4421, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:01:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 20:01:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-03 20:01:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 20:01:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-09-03 20:01:20,633 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-09-03 20:01:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:20,633 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-09-03 20:01:20,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:01:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-09-03 20:01:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 20:01:20,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:20,634 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:20,634 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2005952768, now seen corresponding path program 59 times [2019-09-03 20:01:20,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:20,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:20,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:20,644 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:20,644 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:20,644 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 (exit command is (exit), workingDir is null) [2019-09-03 20:01:20,670 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:20,971 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-03 20:01:20,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:20,978 WARN L254 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 267 conjunts are in the unsatisfiable core [2019-09-03 20:01:20,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:23,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:23,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:01:23,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-09-03 20:01:23,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:01:23,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:01:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:01:23,134 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 68 states. [2019-09-03 20:01:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:26,183 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-09-03 20:01:26,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 20:01:26,184 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 75 [2019-09-03 20:01:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:26,184 INFO L225 Difference]: With dead ends: 80 [2019-09-03 20:01:26,184 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 20:01:26,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=137, Invalid=4555, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:01:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 20:01:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-09-03 20:01:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:01:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-03 20:01:26,192 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-09-03 20:01:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:26,193 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-03 20:01:26,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:01:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-03 20:01:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:01:26,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:26,194 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:26,194 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2054931206, now seen corresponding path program 60 times [2019-09-03 20:01:26,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:26,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:26,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:26,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:26,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:26,203 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:26,204 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:26,204 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:26,231 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:28,753 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 20:01:28,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:28,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 271 conjunts are in the unsatisfiable core [2019-09-03 20:01:28,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:30,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:30,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:01:30,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-09-03 20:01:30,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:01:30,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:01:30,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:01:30,947 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 69 states. [2019-09-03 20:01:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:34,086 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-03 20:01:34,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:01:34,087 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 76 [2019-09-03 20:01:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:34,088 INFO L225 Difference]: With dead ends: 81 [2019-09-03 20:01:34,088 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 20:01:34,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=139, Invalid=4691, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:01:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 20:01:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-03 20:01:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 20:01:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-09-03 20:01:34,097 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-09-03 20:01:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:34,097 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-09-03 20:01:34,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:01:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-09-03 20:01:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 20:01:34,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:34,098 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:34,098 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:34,099 INFO L82 PathProgramCache]: Analyzing trace with hash -721704512, now seen corresponding path program 61 times [2019-09-03 20:01:34,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:34,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:34,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:34,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:34,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:34,107 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:34,108 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:34,108 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:34,322 WARN L254 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 275 conjunts are in the unsatisfiable core [2019-09-03 20:01:34,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:36,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:01:36,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:01:36,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-09-03 20:01:36,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:01:36,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:01:36,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:01:36,621 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 70 states. [2019-09-03 20:01:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:39,833 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-09-03 20:01:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 20:01:39,834 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 77 [2019-09-03 20:01:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:39,834 INFO L225 Difference]: With dead ends: 82 [2019-09-03 20:01:39,835 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 20:01:39,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=4829, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:01:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 20:01:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-09-03 20:01:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:01:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-03 20:01:39,843 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-09-03 20:01:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:39,844 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-03 20:01:39,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:01:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-03 20:01:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:01:39,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:39,845 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:39,845 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash -898065850, now seen corresponding path program 62 times [2019-09-03 20:01:39,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:39,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:39,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:39,853 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:39,854 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:39,854 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:39,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:01:40,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:40,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:40,081 WARN L254 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 279 conjunts are in the unsatisfiable core [2019-09-03 20:01:40,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:42,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:42,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:01:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-09-03 20:01:42,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:01:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:01:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:01:42,498 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 71 states. [2019-09-03 20:01:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:45,818 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-03 20:01:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:01:45,819 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 78 [2019-09-03 20:01:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:45,820 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:01:45,820 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:01:45,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=143, Invalid=4969, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:01:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:01:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-03 20:01:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:01:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-09-03 20:01:45,827 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-09-03 20:01:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:45,827 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-09-03 20:01:45,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:01:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-09-03 20:01:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 20:01:45,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:45,828 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:45,828 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2070300032, now seen corresponding path program 63 times [2019-09-03 20:01:45,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:45,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:45,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:45,837 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:45,837 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:45,837 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:01:50,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 20:01:50,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:50,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 283 conjunts are in the unsatisfiable core [2019-09-03 20:01:50,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:53,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:01:53,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-09-03 20:01:53,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:01:53,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:01:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:01:53,380 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 72 states. [2019-09-03 20:01:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:56,855 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-09-03 20:01:56,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 20:01:56,855 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 79 [2019-09-03 20:01:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:56,856 INFO L225 Difference]: With dead ends: 84 [2019-09-03 20:01:56,857 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 20:01:56,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=5111, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:01:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 20:01:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-03 20:01:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 20:01:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-03 20:01:56,865 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-09-03 20:01:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:56,866 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-03 20:01:56,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:01:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-03 20:01:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:01:56,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:56,866 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:56,867 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:56,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:56,867 INFO L82 PathProgramCache]: Analyzing trace with hash 245145990, now seen corresponding path program 64 times [2019-09-03 20:01:56,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:56,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:56,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:56,875 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:01:56,875 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:01:56,875 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:01:56,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:01:57,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:01:57,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:57,753 WARN L254 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 287 conjunts are in the unsatisfiable core [2019-09-03 20:01:57,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:00,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:02:00,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-09-03 20:02:00,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:02:00,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:02:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:02:00,269 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 73 states. [2019-09-03 20:02:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:03,840 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-03 20:02:03,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:02:03,840 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 80 [2019-09-03 20:02:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:03,841 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:02:03,841 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 20:02:03,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=147, Invalid=5255, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:02:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 20:02:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-03 20:02:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 20:02:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-09-03 20:02:03,850 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-09-03 20:02:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:03,850 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-09-03 20:02:03,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:02:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-09-03 20:02:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:02:03,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:03,851 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:03,851 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:03,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:03,851 INFO L82 PathProgramCache]: Analyzing trace with hash -990471360, now seen corresponding path program 65 times [2019-09-03 20:02:03,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:03,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:03,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:03,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:03,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:03,859 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:02:03,860 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:02:03,860 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:02:03,887 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:02:04,180 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-03 20:02:04,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:04,189 WARN L254 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 291 conjunts are in the unsatisfiable core [2019-09-03 20:02:04,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:06,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:07,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:02:07,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-09-03 20:02:07,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 20:02:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 20:02:07,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:02:07,050 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 74 states. [2019-09-03 20:02:10,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:10,677 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-09-03 20:02:10,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 20:02:10,678 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 81 [2019-09-03 20:02:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:10,679 INFO L225 Difference]: With dead ends: 86 [2019-09-03 20:02:10,679 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 20:02:10,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=149, Invalid=5401, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:02:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 20:02:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-03 20:02:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:02:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-03 20:02:10,688 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-09-03 20:02:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:10,689 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-03 20:02:10,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 20:02:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-03 20:02:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 20:02:10,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:10,689 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:10,690 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash -639903546, now seen corresponding path program 66 times [2019-09-03 20:02:10,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:10,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:10,698 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:02:10,698 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:02:10,698 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 (exit command is (exit), workingDir is null) [2019-09-03 20:02:10,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:02:14,669 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-03 20:02:14,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:14,675 WARN L254 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 295 conjunts are in the unsatisfiable core [2019-09-03 20:02:14,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:17,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:17,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:02:17,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-09-03 20:02:17,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:02:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:02:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:02:17,372 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 75 states. [2019-09-03 20:02:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:21,095 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-03 20:02:21,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:02:21,095 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 82 [2019-09-03 20:02:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:21,096 INFO L225 Difference]: With dead ends: 87 [2019-09-03 20:02:21,096 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 20:02:21,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=151, Invalid=5549, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:02:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 20:02:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-09-03 20:02:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-03 20:02:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-09-03 20:02:21,105 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-09-03 20:02:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:21,106 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-09-03 20:02:21,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:02:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-09-03 20:02:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 20:02:21,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:21,107 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:21,107 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:21,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1637764096, now seen corresponding path program 67 times [2019-09-03 20:02:21,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:21,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:21,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:21,115 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:02:21,115 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:02:21,115 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:02:21,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:21,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 299 conjunts are in the unsatisfiable core [2019-09-03 20:02:21,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:24,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:24,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:02:24,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-09-03 20:02:24,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:02:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:02:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:02:24,294 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 76 states. [2019-09-03 20:02:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:28,076 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-09-03 20:02:28,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 20:02:28,076 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 83 [2019-09-03 20:02:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:28,077 INFO L225 Difference]: With dead ends: 88 [2019-09-03 20:02:28,077 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 20:02:28,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=5699, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:02:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 20:02:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-09-03 20:02:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 20:02:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-03 20:02:28,085 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-09-03 20:02:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:28,085 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-03 20:02:28,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 20:02:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-03 20:02:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 20:02:28,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:28,085 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:28,086 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash -768983034, now seen corresponding path program 68 times [2019-09-03 20:02:28,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:28,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:28,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:28,094 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:02:28,094 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:02:28,094 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:02:28,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:28,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:28,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:28,336 WARN L254 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 303 conjunts are in the unsatisfiable core [2019-09-03 20:02:28,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:31,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:31,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:02:31,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-09-03 20:02:31,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:02:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:02:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:02:31,134 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 77 states. [2019-09-03 20:02:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:35,070 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-09-03 20:02:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:02:35,071 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 84 [2019-09-03 20:02:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:35,071 INFO L225 Difference]: With dead ends: 89 [2019-09-03 20:02:35,071 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 20:02:35,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=155, Invalid=5851, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:02:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 20:02:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-03 20:02:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 20:02:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-09-03 20:02:35,078 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-09-03 20:02:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:35,079 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-09-03 20:02:35,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:02:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-09-03 20:02:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-03 20:02:35,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:35,079 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:35,079 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1931267264, now seen corresponding path program 69 times [2019-09-03 20:02:35,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:35,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:35,089 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:02:35,089 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:02:35,089 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 (exit command is (exit), workingDir is null) [2019-09-03 20:02:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:02:40,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 20:02:40,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:40,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 307 conjunts are in the unsatisfiable core [2019-09-03 20:02:40,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:43,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:43,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:02:43,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-09-03 20:02:43,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:02:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:02:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:02:43,720 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 78 states. [2019-09-03 20:02:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:47,700 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-09-03 20:02:47,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 20:02:47,700 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 85 [2019-09-03 20:02:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:47,701 INFO L225 Difference]: With dead ends: 90 [2019-09-03 20:02:47,701 INFO L226 Difference]: Without dead ends: 87 [2019-09-03 20:02:47,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=157, Invalid=6005, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:02:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-03 20:02:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-09-03 20:02:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 20:02:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-03 20:02:47,711 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-09-03 20:02:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:47,711 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-03 20:02:47,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:02:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-03 20:02:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 20:02:47,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:47,712 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:47,712 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash -260319418, now seen corresponding path program 70 times [2019-09-03 20:02:47,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:47,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:47,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:47,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:47,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:47,721 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:02:47,721 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:02:47,721 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:02:47,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:02:48,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:48,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:48,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 311 conjunts are in the unsatisfiable core [2019-09-03 20:02:48,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:51,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:51,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:02:51,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-09-03 20:02:51,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:02:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:02:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:02:51,645 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 79 states. [2019-09-03 20:02:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:55,750 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-09-03 20:02:55,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:02:55,750 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 86 [2019-09-03 20:02:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:55,751 INFO L225 Difference]: With dead ends: 91 [2019-09-03 20:02:55,751 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 20:02:55,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=159, Invalid=6161, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:02:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 20:02:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-03 20:02:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 20:02:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-09-03 20:02:55,758 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-09-03 20:02:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:55,759 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-09-03 20:02:55,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:02:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-09-03 20:02:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 20:02:55,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:55,760 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:55,760 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash 519970176, now seen corresponding path program 71 times [2019-09-03 20:02:55,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:55,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:55,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:55,769 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:02:55,770 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:02:55,770 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 (exit command is (exit), workingDir is null) [2019-09-03 20:02:55,793 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:02:56,146 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-03 20:02:56,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:56,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 315 conjunts are in the unsatisfiable core [2019-09-03 20:02:56,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:59,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:02:59,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-09-03 20:02:59,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 20:02:59,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 20:02:59,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:02:59,197 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 80 states. [2019-09-03 20:03:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:03,421 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-09-03 20:03:03,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 20:03:03,422 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 87 [2019-09-03 20:03:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:03,422 INFO L225 Difference]: With dead ends: 92 [2019-09-03 20:03:03,423 INFO L226 Difference]: Without dead ends: 89 [2019-09-03 20:03:03,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=161, Invalid=6319, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:03:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-03 20:03:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-03 20:03:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 20:03:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-03 20:03:03,430 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-09-03 20:03:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:03,430 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-03 20:03:03,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 20:03:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-03 20:03:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:03:03,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:03,431 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:03,431 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:03,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:03,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1060856186, now seen corresponding path program 72 times [2019-09-03 20:03:03,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:03,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:03,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:03,442 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:03:03,442 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:03:03,442 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 (exit command is (exit), workingDir is null) [2019-09-03 20:03:03,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:03:08,544 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 20:03:08,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:08,553 WARN L254 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 319 conjunts are in the unsatisfiable core [2019-09-03 20:03:08,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:11,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:11,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:11,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-09-03 20:03:11,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 20:03:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 20:03:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:03:11,579 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 81 states. [2019-09-03 20:03:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:15,901 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-09-03 20:03:15,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 20:03:15,901 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 88 [2019-09-03 20:03:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:15,902 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:03:15,902 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 20:03:15,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=163, Invalid=6479, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:03:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 20:03:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-03 20:03:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:03:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-09-03 20:03:15,910 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-09-03 20:03:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:15,910 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-09-03 20:03:15,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 20:03:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-09-03 20:03:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-03 20:03:15,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:15,910 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:15,911 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:15,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1473134144, now seen corresponding path program 73 times [2019-09-03 20:03:15,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:15,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:15,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:15,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:15,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:15,918 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:03:15,919 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:03:15,919 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:03:15,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:16,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 323 conjunts are in the unsatisfiable core [2019-09-03 20:03:16,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:19,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:19,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:19,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-09-03 20:03:19,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 20:03:19,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 20:03:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:03:19,365 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 82 states. [2019-09-03 20:03:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:23,879 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-09-03 20:03:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 20:03:23,879 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 89 [2019-09-03 20:03:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:23,880 INFO L225 Difference]: With dead ends: 94 [2019-09-03 20:03:23,880 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 20:03:23,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=165, Invalid=6641, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:03:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 20:03:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-03 20:03:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:03:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-03 20:03:23,888 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-09-03 20:03:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:23,888 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-03 20:03:23,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 20:03:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-03 20:03:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 20:03:23,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:23,889 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:23,889 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1577544250, now seen corresponding path program 74 times [2019-09-03 20:03:23,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:23,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:23,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:23,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:23,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:23,898 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:03:23,898 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:03:23,898 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 (exit command is (exit), workingDir is null) [2019-09-03 20:03:23,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:03:24,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:03:24,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:24,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 327 conjunts are in the unsatisfiable core [2019-09-03 20:03:24,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:27,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:27,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:27,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-09-03 20:03:27,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 20:03:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 20:03:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:03:27,518 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 83 states. [2019-09-03 20:03:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:32,021 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-09-03 20:03:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:03:32,021 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 90 [2019-09-03 20:03:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:32,022 INFO L225 Difference]: With dead ends: 95 [2019-09-03 20:03:32,022 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 20:03:32,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=167, Invalid=6805, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:03:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 20:03:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-09-03 20:03:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-03 20:03:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-09-03 20:03:32,033 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-09-03 20:03:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:32,033 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-09-03 20:03:32,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 20:03:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-09-03 20:03:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-03 20:03:32,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:32,034 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:32,034 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:32,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:32,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1659293952, now seen corresponding path program 75 times [2019-09-03 20:03:32,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:32,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:32,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:32,049 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:03:32,049 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:03:32,049 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:03:32,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:03:38,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-03 20:03:38,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:38,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 331 conjunts are in the unsatisfiable core [2019-09-03 20:03:38,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:41,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:41,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:41,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-09-03 20:03:41,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 20:03:41,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 20:03:41,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:03:41,707 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 84 states. [2019-09-03 20:03:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:46,336 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-09-03 20:03:46,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 20:03:46,337 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 91 [2019-09-03 20:03:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:46,338 INFO L225 Difference]: With dead ends: 96 [2019-09-03 20:03:46,338 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:03:46,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=169, Invalid=6971, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:03:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:03:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-09-03 20:03:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 20:03:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-03 20:03:46,346 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-09-03 20:03:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:46,346 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-03 20:03:46,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 20:03:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-03 20:03:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 20:03:46,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:46,346 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:46,347 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash 101432582, now seen corresponding path program 76 times [2019-09-03 20:03:46,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:46,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:46,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:46,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:46,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:46,353 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:03:46,353 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:03:46,353 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:03:46,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:03:47,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:03:47,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:47,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 335 conjunts are in the unsatisfiable core [2019-09-03 20:03:47,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:50,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:50,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:50,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-09-03 20:03:50,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 20:03:50,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 20:03:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:03:50,868 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 85 states. [2019-09-03 20:03:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:55,624 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-09-03 20:03:55,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 20:03:55,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 92 [2019-09-03 20:03:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:55,626 INFO L225 Difference]: With dead ends: 97 [2019-09-03 20:03:55,626 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 20:03:55,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=171, Invalid=7139, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:03:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 20:03:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-03 20:03:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-03 20:03:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-09-03 20:03:55,634 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-09-03 20:03:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:55,634 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-09-03 20:03:55,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 20:03:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-09-03 20:03:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 20:03:55,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:55,635 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:55,635 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:55,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1150619712, now seen corresponding path program 77 times [2019-09-03 20:03:55,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:55,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:55,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:55,642 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:03:55,642 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:03:55,642 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:03:55,654 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:03:56,085 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-09-03 20:03:56,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:56,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 339 conjunts are in the unsatisfiable core [2019-09-03 20:03:56,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:59,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:59,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:03:59,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-09-03 20:03:59,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 20:03:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 20:03:59,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:03:59,521 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 86 states. [2019-09-03 20:04:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:04,392 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-09-03 20:04:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 20:04:04,393 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 93 [2019-09-03 20:04:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:04,394 INFO L225 Difference]: With dead ends: 98 [2019-09-03 20:04:04,394 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 20:04:04,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=173, Invalid=7309, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:04:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 20:04:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-03 20:04:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:04:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-03 20:04:04,401 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-09-03 20:04:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:04,401 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-03 20:04:04,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 20:04:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-03 20:04:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:04:04,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:04,402 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:04,402 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:04,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:04,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1309535162, now seen corresponding path program 78 times [2019-09-03 20:04:04,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:04,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:04,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:04,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:04,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:04,408 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:04:04,408 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:04:04,408 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:04:04,424 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:04:12,143 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-09-03 20:04:12,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:12,148 WARN L254 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 343 conjunts are in the unsatisfiable core [2019-09-03 20:04:12,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:15,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:04:15,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-09-03 20:04:15,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 20:04:15,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 20:04:15,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:04:15,664 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 87 states. [2019-09-03 20:04:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:20,674 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-09-03 20:04:20,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:04:20,674 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 94 [2019-09-03 20:04:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:20,675 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:04:20,676 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 20:04:20,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=175, Invalid=7481, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:04:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 20:04:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-03 20:04:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:04:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-09-03 20:04:20,683 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-09-03 20:04:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:20,684 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-09-03 20:04:20,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 20:04:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-09-03 20:04:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-03 20:04:20,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:20,684 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:20,684 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:20,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946816, now seen corresponding path program 79 times [2019-09-03 20:04:20,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:20,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:20,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:20,697 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:04:20,697 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:04:20,697 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:04:20,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:21,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 347 conjunts are in the unsatisfiable core [2019-09-03 20:04:21,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:24,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:24,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:04:24,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-09-03 20:04:24,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 20:04:24,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 20:04:24,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:04:24,555 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 88 states. [2019-09-03 20:04:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:29,635 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-09-03 20:04:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 20:04:29,635 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 95 [2019-09-03 20:04:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:29,636 INFO L225 Difference]: With dead ends: 100 [2019-09-03 20:04:29,636 INFO L226 Difference]: Without dead ends: 97 [2019-09-03 20:04:29,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=177, Invalid=7655, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:04:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-03 20:04:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-03 20:04:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 20:04:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-03 20:04:29,645 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-09-03 20:04:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:29,645 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-03 20:04:29,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 20:04:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-03 20:04:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:04:29,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:29,646 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:29,646 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash -39871610, now seen corresponding path program 80 times [2019-09-03 20:04:29,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:29,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:29,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:29,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:29,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:29,655 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:04:29,655 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:04:29,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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:04:29,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:04:29,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:29,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:30,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 351 conjunts are in the unsatisfiable core [2019-09-03 20:04:30,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:33,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:33,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:04:33,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-09-03 20:04:33,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:04:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:04:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:04:33,625 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 89 states. [2019-09-03 20:04:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:38,821 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-09-03 20:04:38,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:04:38,822 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 96 [2019-09-03 20:04:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:38,823 INFO L225 Difference]: With dead ends: 101 [2019-09-03 20:04:38,823 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 20:04:38,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=179, Invalid=7831, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:04:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 20:04:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-09-03 20:04:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-03 20:04:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-09-03 20:04:38,831 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-09-03 20:04:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:38,831 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-09-03 20:04:38,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:04:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-09-03 20:04:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-03 20:04:38,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:38,832 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:38,832 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1236082368, now seen corresponding path program 81 times [2019-09-03 20:04:38,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:38,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:38,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:38,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:38,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:38,839 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:04:38,839 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:04:38,839 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:04:38,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:46,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-03 20:04:46,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:46,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 355 conjunts are in the unsatisfiable core [2019-09-03 20:04:46,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:49,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:50,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:04:50,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-09-03 20:04:50,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 20:04:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 20:04:50,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:04:50,043 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 90 states. [2019-09-03 20:04:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:55,397 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-09-03 20:04:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 20:04:55,397 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 97 [2019-09-03 20:04:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:55,398 INFO L225 Difference]: With dead ends: 102 [2019-09-03 20:04:55,398 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 20:04:55,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=181, Invalid=8009, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:04:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 20:04:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-09-03 20:04:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 20:04:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-03 20:04:55,407 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-09-03 20:04:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:55,408 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-03 20:04:55,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 20:04:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-03 20:04:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 20:04:55,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:55,408 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:55,409 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash 336089798, now seen corresponding path program 82 times [2019-09-03 20:04:55,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:55,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:55,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:55,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:55,425 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:04:55,425 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:04:55,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:04:55,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:04:56,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:56,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:56,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 359 conjunts are in the unsatisfiable core [2019-09-03 20:04:56,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:00,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:00,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:05:00,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-09-03 20:05:00,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:05:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:05:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:05:00,690 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 91 states. [2019-09-03 20:05:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:06,150 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-09-03 20:05:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 20:05:06,150 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 98 [2019-09-03 20:05:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:06,151 INFO L225 Difference]: With dead ends: 103 [2019-09-03 20:05:06,151 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 20:05:06,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=183, Invalid=8189, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:05:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 20:05:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-03 20:05:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:05:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-09-03 20:05:06,158 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-09-03 20:05:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:06,158 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-09-03 20:05:06,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:05:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-09-03 20:05:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-03 20:05:06,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:06,159 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:06,159 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:06,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:06,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1828786688, now seen corresponding path program 83 times [2019-09-03 20:05:06,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:06,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:06,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:06,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:06,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:06,166 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:05:06,166 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:05:06,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:05:06,178 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:05:06,681 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-03 20:05:06,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:06,692 WARN L254 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 363 conjunts are in the unsatisfiable core [2019-09-03 20:05:06,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:10,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:10,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:05:10,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-09-03 20:05:10,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 20:05:10,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 20:05:10,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:05:10,524 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 92 states. [2019-09-03 20:05:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:16,114 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-09-03 20:05:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 20:05:16,114 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 99 [2019-09-03 20:05:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:16,116 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:05:16,116 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 20:05:16,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=185, Invalid=8371, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:05:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 20:05:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-09-03 20:05:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 20:05:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-03 20:05:16,124 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-09-03 20:05:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:16,125 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-03 20:05:16,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 20:05:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-03 20:05:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 20:05:16,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:16,125 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:16,125 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash 857750022, now seen corresponding path program 84 times [2019-09-03 20:05:16,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:16,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:16,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:16,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:16,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:16,134 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:05:16,134 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:05:16,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:05:16,164 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:05:24,968 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 20:05:24,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:24,974 WARN L254 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 367 conjunts are in the unsatisfiable core [2019-09-03 20:05:24,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:28,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:28,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:05:28,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-09-03 20:05:28,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 20:05:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 20:05:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:05:28,923 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 93 states. [2019-09-03 20:05:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:34,605 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-09-03 20:05:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 20:05:34,605 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 100 [2019-09-03 20:05:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:34,606 INFO L225 Difference]: With dead ends: 105 [2019-09-03 20:05:34,607 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 20:05:34,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=187, Invalid=8555, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 20:05:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 20:05:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-03 20:05:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 20:05:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-09-03 20:05:34,615 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-09-03 20:05:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:34,615 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-09-03 20:05:34,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 20:05:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-09-03 20:05:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-03 20:05:34,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:34,616 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:34,616 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 820384448, now seen corresponding path program 85 times [2019-09-03 20:05:34,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:34,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:34,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:34,627 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:05:34,627 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:05:34,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:05:34,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:05:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:35,070 WARN L254 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 371 conjunts are in the unsatisfiable core [2019-09-03 20:05:35,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:39,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:39,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:05:39,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-09-03 20:05:39,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 20:05:39,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 20:05:39,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 20:05:39,232 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 94 states. [2019-09-03 20:05:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:45,139 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-09-03 20:05:45,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 20:05:45,140 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 101 [2019-09-03 20:05:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:45,141 INFO L225 Difference]: With dead ends: 106 [2019-09-03 20:05:45,142 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 20:05:45,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=189, Invalid=8741, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:05:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 20:05:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-03 20:05:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:05:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-03 20:05:45,152 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-09-03 20:05:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:45,153 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-03 20:05:45,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 20:05:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-03 20:05:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 20:05:45,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:45,153 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:45,154 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash -337948346, now seen corresponding path program 86 times [2019-09-03 20:05:45,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:45,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:45,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:45,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:05:45,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:45,162 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:05:45,162 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:05:45,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:05:45,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:05:45,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:05:45,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:45,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 375 conjunts are in the unsatisfiable core [2019-09-03 20:05:45,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:49,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:49,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:05:49,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-09-03 20:05:49,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 20:05:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 20:05:49,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:05:49,686 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 95 states. [2019-09-03 20:05:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:55,655 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-09-03 20:05:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:05:55,655 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 102 [2019-09-03 20:05:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:55,656 INFO L225 Difference]: With dead ends: 107 [2019-09-03 20:05:55,657 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:05:55,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=191, Invalid=8929, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:05:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:05:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-03 20:05:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 20:05:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-09-03 20:05:55,665 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-09-03 20:05:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:55,665 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-09-03 20:05:55,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 20:05:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-09-03 20:05:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-03 20:05:55,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:55,666 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:55,667 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:55,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:55,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1886526592, now seen corresponding path program 87 times [2019-09-03 20:05:55,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:55,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:55,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:55,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:55,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:55,675 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:05:55,675 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:05:55,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:05:55,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:06:04,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 20:06:04,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:04,249 WARN L254 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 379 conjunts are in the unsatisfiable core [2019-09-03 20:06:04,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:08,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:08,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:06:08,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-09-03 20:06:08,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 20:06:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 20:06:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:06:08,372 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 96 states. [2019-09-03 20:06:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:14,384 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-09-03 20:06:14,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 20:06:14,384 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 103 [2019-09-03 20:06:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:14,385 INFO L225 Difference]: With dead ends: 108 [2019-09-03 20:06:14,385 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 20:06:14,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=193, Invalid=9119, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 20:06:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 20:06:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-03 20:06:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 20:06:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-03 20:06:14,396 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-09-03 20:06:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:14,396 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-03 20:06:14,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 20:06:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-03 20:06:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:06:14,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:14,397 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:14,397 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1647155334, now seen corresponding path program 88 times [2019-09-03 20:06:14,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:14,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:14,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:14,406 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:06:14,407 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:06:14,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:06:14,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:06:15,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:06:15,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:15,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 383 conjunts are in the unsatisfiable core [2019-09-03 20:06:15,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:20,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:20,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:06:20,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-09-03 20:06:20,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:06:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:06:20,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 20:06:20,153 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 97 states. [2019-09-03 20:06:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:26,311 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-09-03 20:06:26,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:06:26,312 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 104 [2019-09-03 20:06:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:26,313 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:06:26,313 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 20:06:26,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=195, Invalid=9311, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:06:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 20:06:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-09-03 20:06:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 20:06:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-09-03 20:06:26,324 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-09-03 20:06:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:26,325 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-09-03 20:06:26,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:06:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-09-03 20:06:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-03 20:06:26,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:26,326 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:26,326 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash -477854656, now seen corresponding path program 89 times [2019-09-03 20:06:26,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:26,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:26,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:26,335 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:06:26,336 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:06:26,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:06:26,352 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:06:26,915 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-09-03 20:06:26,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:26,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 387 conjunts are in the unsatisfiable core [2019-09-03 20:06:26,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:31,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:31,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:06:31,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-09-03 20:06:31,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 20:06:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 20:06:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:06:31,274 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 98 states. [2019-09-03 20:06:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:37,580 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-09-03 20:06:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 20:06:37,581 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 105 [2019-09-03 20:06:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:37,582 INFO L225 Difference]: With dead ends: 110 [2019-09-03 20:06:37,582 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:06:37,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=197, Invalid=9505, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:06:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:06:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-03 20:06:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 20:06:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-03 20:06:37,594 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-09-03 20:06:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:37,594 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-03 20:06:37,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 20:06:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-03 20:06:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:06:37,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:37,595 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:37,595 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1928654906, now seen corresponding path program 90 times [2019-09-03 20:06:37,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:37,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:37,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:37,605 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:06:37,605 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:06:37,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:06:37,626 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:06:49,100 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-09-03 20:06:49,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:49,111 WARN L254 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 391 conjunts are in the unsatisfiable core [2019-09-03 20:06:49,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:53,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:06:53,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-09-03 20:06:53,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 20:06:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 20:06:53,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:06:53,553 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 99 states. [2019-09-03 20:07:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:00,005 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-09-03 20:07:00,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:07:00,005 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 106 [2019-09-03 20:07:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:00,007 INFO L225 Difference]: With dead ends: 111 [2019-09-03 20:07:00,007 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 20:07:00,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=199, Invalid=9701, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:07:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 20:07:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-09-03 20:07:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 20:07:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-09-03 20:07:00,018 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-09-03 20:07:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:00,019 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-09-03 20:07:00,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 20:07:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-09-03 20:07:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-03 20:07:00,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:00,020 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:00,020 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash 341177600, now seen corresponding path program 91 times [2019-09-03 20:07:00,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:00,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:00,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:00,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:00,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:00,029 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:07:00,029 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:07:00,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:07:00,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:07:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:00,481 WARN L254 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 395 conjunts are in the unsatisfiable core [2019-09-03 20:07:00,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:04,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:04,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:07:04,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-09-03 20:07:04,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 20:07:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 20:07:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:07:04,998 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 100 states. [2019-09-03 20:07:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:11,570 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-09-03 20:07:11,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 20:07:11,571 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 107 [2019-09-03 20:07:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:11,572 INFO L225 Difference]: With dead ends: 112 [2019-09-03 20:07:11,572 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 20:07:11,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=201, Invalid=9899, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 20:07:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 20:07:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-09-03 20:07:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 20:07:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-03 20:07:11,580 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-09-03 20:07:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:11,580 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-03 20:07:11,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 20:07:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-03 20:07:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 20:07:11,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:11,581 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:11,582 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508550, now seen corresponding path program 92 times [2019-09-03 20:07:11,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:11,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:11,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:11,591 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:07:11,592 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:07:11,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:07:11,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:07:12,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:07:12,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:12,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 399 conjunts are in the unsatisfiable core [2019-09-03 20:07:12,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:16,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:16,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:07:16,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-09-03 20:07:16,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 20:07:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 20:07:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 20:07:16,899 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 101 states. [2019-09-03 20:07:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:23,591 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-09-03 20:07:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:07:23,592 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 108 [2019-09-03 20:07:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:23,592 INFO L225 Difference]: With dead ends: 113 [2019-09-03 20:07:23,593 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 20:07:23,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=203, Invalid=10099, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:07:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 20:07:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-09-03 20:07:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-03 20:07:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-09-03 20:07:23,601 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-09-03 20:07:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:23,601 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-09-03 20:07:23,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 20:07:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-09-03 20:07:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-03 20:07:23,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:23,602 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:23,602 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:23,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1452160448, now seen corresponding path program 93 times [2019-09-03 20:07:23,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:23,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:23,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:23,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:23,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:23,610 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:07:23,610 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:07:23,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:07:23,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:07:51,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-03 20:07:51,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:51,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 403 conjunts are in the unsatisfiable core [2019-09-03 20:07:51,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:56,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:56,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:07:56,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-09-03 20:07:56,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 20:07:56,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 20:07:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:07:56,693 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 102 states. [2019-09-03 20:08:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:03,521 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-09-03 20:08:03,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 20:08:03,522 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 109 [2019-09-03 20:08:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:03,523 INFO L225 Difference]: With dead ends: 114 [2019-09-03 20:08:03,523 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 20:08:03,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=205, Invalid=10301, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:08:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 20:08:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-09-03 20:08:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 20:08:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-03 20:08:03,532 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-09-03 20:08:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:03,532 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-03 20:08:03,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 20:08:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-03 20:08:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 20:08:03,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:03,533 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:03,533 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:03,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2067238470, now seen corresponding path program 94 times [2019-09-03 20:08:03,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:03,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:03,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:03,541 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:08:03,542 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:08:03,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:08:03,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:08:05,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:08:05,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:05,221 WARN L254 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 407 conjunts are in the unsatisfiable core [2019-09-03 20:08:05,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:09,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:09,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:08:09,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-09-03 20:08:09,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 20:08:09,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 20:08:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:08:09,974 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 103 states. [2019-09-03 20:08:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:16,932 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-09-03 20:08:16,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 20:08:16,932 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 110 [2019-09-03 20:08:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:16,933 INFO L225 Difference]: With dead ends: 115 [2019-09-03 20:08:16,933 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 20:08:16,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=207, Invalid=10505, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:08:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 20:08:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-03 20:08:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 20:08:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-09-03 20:08:16,944 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-09-03 20:08:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:16,944 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-09-03 20:08:16,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 20:08:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-09-03 20:08:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-03 20:08:16,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:16,945 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:16,945 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash -340179328, now seen corresponding path program 95 times [2019-09-03 20:08:16,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:16,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:16,954 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:08:16,955 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:08:16,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:08:16,968 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:08:17,634 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2019-09-03 20:08:17,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:17,647 WARN L254 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 411 conjunts are in the unsatisfiable core [2019-09-03 20:08:17,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:22,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:22,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:08:22,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-09-03 20:08:22,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-03 20:08:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-03 20:08:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:08:22,511 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 104 states. [2019-09-03 20:08:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:29,537 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-09-03 20:08:29,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 20:08:29,538 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 111 [2019-09-03 20:08:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:29,539 INFO L225 Difference]: With dead ends: 116 [2019-09-03 20:08:29,539 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 20:08:29,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=209, Invalid=10711, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:08:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 20:08:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-03 20:08:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 20:08:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-03 20:08:29,547 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-09-03 20:08:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:29,548 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-03 20:08:29,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-03 20:08:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-03 20:08:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:08:29,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:29,549 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:29,549 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:29,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1955687034, now seen corresponding path program 96 times [2019-09-03 20:08:29,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:29,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:29,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:29,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:29,556 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:08:29,556 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:08:29,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:08:29,587 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:08:45,171 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-03 20:08:45,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:45,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 415 conjunts are in the unsatisfiable core [2019-09-03 20:08:45,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:49,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:50,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:08:50,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-09-03 20:08:50,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 20:08:50,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 20:08:50,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:08:50,120 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 105 states. [2019-09-03 20:08:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:57,330 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-09-03 20:08:57,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 20:08:57,330 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 112 [2019-09-03 20:08:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:57,331 INFO L225 Difference]: With dead ends: 117 [2019-09-03 20:08:57,332 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 20:08:57,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=211, Invalid=10919, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:08:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 20:08:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-03 20:08:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 20:08:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-09-03 20:08:57,341 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-09-03 20:08:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:57,341 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-09-03 20:08:57,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 20:08:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-09-03 20:08:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-03 20:08:57,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:57,342 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:57,342 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash -496818368, now seen corresponding path program 97 times [2019-09-03 20:08:57,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:57,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:57,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:57,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:57,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:57,351 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:08:57,351 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:08:57,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:08:57,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:08:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:57,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 419 conjunts are in the unsatisfiable core [2019-09-03 20:08:57,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:02,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:09:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:09:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:09:02,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-09-03 20:09:02,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 20:09:02,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 20:09:02,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:09:02,929 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 106 states. [2019-09-03 20:09:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:10,325 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-09-03 20:09:10,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-03 20:09:10,326 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 113 [2019-09-03 20:09:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:10,326 INFO L225 Difference]: With dead ends: 118 [2019-09-03 20:09:10,326 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 20:09:10,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=213, Invalid=11129, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 20:09:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 20:09:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-09-03 20:09:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 20:09:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-03 20:09:10,339 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-09-03 20:09:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:10,339 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-03 20:09:10,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 20:09:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-03 20:09:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 20:09:10,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:10,340 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:10,340 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1778437318, now seen corresponding path program 98 times [2019-09-03 20:09:10,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:10,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:10,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:09:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:10,350 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:09:10,350 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:09:10,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:09:10,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:09:10,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:09:10,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:09:10,906 WARN L254 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 423 conjunts are in the unsatisfiable core [2019-09-03 20:09:10,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:15,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:09:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:09:16,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:09:16,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-09-03 20:09:16,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 20:09:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 20:09:16,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 20:09:16,015 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 107 states. [2019-09-03 20:09:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:23,463 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-09-03 20:09:23,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 20:09:23,463 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 114 [2019-09-03 20:09:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:23,464 INFO L225 Difference]: With dead ends: 119 [2019-09-03 20:09:23,465 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 20:09:23,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=215, Invalid=11341, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:09:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 20:09:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-09-03 20:09:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 20:09:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-09-03 20:09:23,474 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-09-03 20:09:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:23,474 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-09-03 20:09:23,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 20:09:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-09-03 20:09:23,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-03 20:09:23,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:23,475 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:23,475 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:23,476 INFO L82 PathProgramCache]: Analyzing trace with hash -703080448, now seen corresponding path program 99 times [2019-09-03 20:09:23,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:23,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:23,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:23,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:09:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:23,482 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:09:23,482 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:09:23,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:09:23,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:09:46,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-09-03 20:09:46,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:09:46,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 427 conjunts are in the unsatisfiable core [2019-09-03 20:09:46,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:51,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:09:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:09:51,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:09:51,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-09-03 20:09:51,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 20:09:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 20:09:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:09:51,777 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 108 states. [2019-09-03 20:09:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:59,429 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-09-03 20:09:59,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-03 20:09:59,430 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 115 [2019-09-03 20:09:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:59,430 INFO L225 Difference]: With dead ends: 120 [2019-09-03 20:09:59,431 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 20:09:59,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=217, Invalid=11555, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:09:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 20:09:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-09-03 20:09:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 20:09:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-03 20:09:59,443 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-09-03 20:09:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:59,443 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-03 20:09:59,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 20:09:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-03 20:09:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 20:09:59,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:59,444 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:59,445 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:59,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash -320719866, now seen corresponding path program 100 times [2019-09-03 20:09:59,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:59,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:59,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:09:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:59,454 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:09:59,454 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:09:59,454 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:09:59,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:10:01,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:10:01,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:01,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 431 conjunts are in the unsatisfiable core [2019-09-03 20:10:01,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:06,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:10:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:10:06,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:10:06,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-09-03 20:10:06,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 20:10:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 20:10:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:10:06,733 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 109 states. [2019-09-03 20:10:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:14,525 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-09-03 20:10:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 20:10:14,525 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 116 [2019-09-03 20:10:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:14,526 INFO L225 Difference]: With dead ends: 121 [2019-09-03 20:10:14,526 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:10:14,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=219, Invalid=11771, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:10:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:10:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-03 20:10:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 20:10:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-09-03 20:10:14,536 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-09-03 20:10:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:14,536 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-09-03 20:10:14,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 20:10:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-09-03 20:10:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 20:10:14,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:14,537 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:14,537 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1352443712, now seen corresponding path program 101 times [2019-09-03 20:10:14,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:14,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:14,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:10:14,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:14,544 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:10:14,544 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:10:14,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:10:14,555 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:10:15,324 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2019-09-03 20:10:15,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:15,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 435 conjunts are in the unsatisfiable core [2019-09-03 20:10:15,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:20,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:10:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:10:20,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:10:20,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-09-03 20:10:20,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-03 20:10:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-03 20:10:20,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:10:20,838 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 110 states. [2019-09-03 20:10:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:28,852 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-09-03 20:10:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-03 20:10:28,852 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 117 [2019-09-03 20:10:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:28,853 INFO L225 Difference]: With dead ends: 122 [2019-09-03 20:10:28,853 INFO L226 Difference]: Without dead ends: 119 [2019-09-03 20:10:28,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=221, Invalid=11989, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:10:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-03 20:10:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-09-03 20:10:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:10:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-03 20:10:28,864 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-09-03 20:10:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:28,864 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-03 20:10:28,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-03 20:10:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-03 20:10:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 20:10:28,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:28,865 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:28,865 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:28,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1023855430, now seen corresponding path program 102 times [2019-09-03 20:10:28,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:28,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:28,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:28,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:10:28,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:28,873 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:10:28,873 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:10:28,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:10:28,882 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:10:50,077 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-09-03 20:10:50,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:50,086 WARN L254 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 439 conjunts are in the unsatisfiable core [2019-09-03 20:10:50,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:55,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:10:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:10:55,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:10:55,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-09-03 20:10:55,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 20:10:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 20:10:55,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:10:55,627 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 111 states. [2019-09-03 20:11:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:03,710 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-09-03 20:11:03,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:11:03,711 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 118 [2019-09-03 20:11:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:03,712 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:11:03,712 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 20:11:03,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=223, Invalid=12209, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:11:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 20:11:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-03 20:11:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:11:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-09-03 20:11:03,725 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-09-03 20:11:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:03,725 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-09-03 20:11:03,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 20:11:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-09-03 20:11:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-03 20:11:03,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:03,726 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:03,726 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1674684800, now seen corresponding path program 103 times [2019-09-03 20:11:03,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:03,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:03,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:11:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:03,737 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:11:03,737 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:11:03,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:11:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:11:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:04,455 WARN L254 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 443 conjunts are in the unsatisfiable core [2019-09-03 20:11:04,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:09,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:11:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:11:10,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:11:10,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-09-03 20:11:10,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 20:11:10,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 20:11:10,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:11:10,004 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 112 states. [2019-09-03 20:11:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:18,309 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-09-03 20:11:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-03 20:11:18,309 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 119 [2019-09-03 20:11:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:18,310 INFO L225 Difference]: With dead ends: 124 [2019-09-03 20:11:18,310 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 20:11:18,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=225, Invalid=12431, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:11:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 20:11:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-03 20:11:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 20:11:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-03 20:11:18,321 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-09-03 20:11:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:18,321 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-03 20:11:18,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 20:11:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-03 20:11:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:11:18,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:18,322 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:18,322 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash 375558790, now seen corresponding path program 104 times [2019-09-03 20:11:18,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:18,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:18,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:11:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:18,333 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:11:18,333 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:11:18,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:11:18,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:11:18,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:11:18,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:11:18,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 447 conjunts are in the unsatisfiable core [2019-09-03 20:11:18,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:24,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:11:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:11:24,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:11:24,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-09-03 20:11:24,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 20:11:24,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 20:11:24,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:11:24,621 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 113 states. [2019-09-03 20:11:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:32,994 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-09-03 20:11:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 20:11:32,995 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 120 [2019-09-03 20:11:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:32,996 INFO L225 Difference]: With dead ends: 125 [2019-09-03 20:11:32,996 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 20:11:32,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=227, Invalid=12655, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:11:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 20:11:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-09-03 20:11:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 20:11:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-09-03 20:11:33,006 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-09-03 20:11:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:33,006 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-09-03 20:11:33,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 20:11:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-09-03 20:11:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-03 20:11:33,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:33,007 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:33,007 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:33,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1242641856, now seen corresponding path program 105 times [2019-09-03 20:11:33,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:33,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:33,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:33,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:11:33,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:33,015 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:11:33,015 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:11:33,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:11:33,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:12:05,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-09-03 20:12:05,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:12:05,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 451 conjunts are in the unsatisfiable core [2019-09-03 20:12:05,277 INFO L279 TraceCheckSpWp]: Computing forward predicates...