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/reducercommutativity/sep.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:41:35,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:41:35,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:41:35,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:41:35,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:41:35,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:41:35,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:41:35,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:41:35,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:41:35,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:41:35,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:41:35,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:41:35,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:41:35,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:41:35,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:41:35,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:41:35,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:41:35,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:41:35,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:41:35,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:41:35,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:41:35,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:41:35,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:41:35,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:41:35,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:41:35,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:41:35,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:41:35,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:41:35,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:41:35,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:41:35,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:41:35,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:41:35,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:41:35,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:41:35,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:41:35,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:41:35,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:41:35,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:41:35,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:41:35,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:41:35,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:41:35,437 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-10-02 14:41:35,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:41:35,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:41:35,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:41:35,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:41:35,456 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:41:35,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:41:35,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:41:35,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:41:35,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:41:35,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:41:35,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:41:35,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:41:35,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:41:35,458 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:41:35,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:41:35,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:41:35,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:41:35,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:41:35,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:41:35,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:41:35,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:41:35,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:41:35,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:41:35,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:41:35,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:41:35,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:41:35,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:41:35,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:41:35,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:41:35,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:41:35,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:41:35,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:41:35,514 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:41:35,515 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:41:35,515 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep.i [2019-10-02 14:41:35,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d6b1e79/c57b44bff5c44a4d92128bd1bd638bc3/FLAG3fdd55cf8 [2019-10-02 14:41:36,045 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:41:36,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep.i [2019-10-02 14:41:36,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d6b1e79/c57b44bff5c44a4d92128bd1bd638bc3/FLAG3fdd55cf8 [2019-10-02 14:41:36,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d6b1e79/c57b44bff5c44a4d92128bd1bd638bc3 [2019-10-02 14:41:36,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:41:36,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:41:36,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:41:36,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:41:36,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:41:36,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7354cb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36, skipping insertion in model container [2019-10-02 14:41:36,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,471 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:41:36,489 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:41:36,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:41:36,684 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:41:36,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:41:36,726 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:41:36,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36 WrapperNode [2019-10-02 14:41:36,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:41:36,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:41:36,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:41:36,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:41:36,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (1/1) ... [2019-10-02 14:41:36,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:41:36,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:41:36,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:41:36,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:41:36,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (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-10-02 14:41:36,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:41:36,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:41:36,915 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2019-10-02 14:41:36,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:41:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:41:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:41:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2019-10-02 14:41:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:41:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:41:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:41:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:41:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:41:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:41:36,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:41:37,208 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:41:37,208 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 14:41:37,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:41:37 BoogieIcfgContainer [2019-10-02 14:41:37,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:41:37,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:41:37,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:41:37,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:41:37,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:41:36" (1/3) ... [2019-10-02 14:41:37,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484ae1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:41:37, skipping insertion in model container [2019-10-02 14:41:37,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:36" (2/3) ... [2019-10-02 14:41:37,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484ae1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:41:37, skipping insertion in model container [2019-10-02 14:41:37,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:41:37" (3/3) ... [2019-10-02 14:41:37,224 INFO L109 eAbstractionObserver]: Analyzing ICFG sep.i [2019-10-02 14:41:37,234 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:41:37,241 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:41:37,257 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:41:37,290 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:41:37,290 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:41:37,291 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:41:37,291 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:41:37,291 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:41:37,291 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:41:37,291 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:41:37,292 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:41:37,292 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:41:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-02 14:41:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:41:37,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:37,326 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:37,328 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1691531413, now seen corresponding path program 1 times [2019-10-02 14:41:37,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:37,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:37,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:37,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:37,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 14:41:37,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:37,611 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:37,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:37,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:41:37,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:37,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:41:37,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-10-02 14:41:37,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:41:37,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:41:37,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:41:37,807 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 6 states. [2019-10-02 14:41:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:37,967 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2019-10-02 14:41:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:41:37,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-02 14:41:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:37,980 INFO L225 Difference]: With dead ends: 64 [2019-10-02 14:41:37,980 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 14:41:37,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:41:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 14:41:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-02 14:41:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 14:41:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-02 14:41:38,033 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-02 14:41:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:38,035 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-02 14:41:38,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:41:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-02 14:41:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 14:41:38,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:38,041 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:38,041 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:38,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2111009974, now seen corresponding path program 1 times [2019-10-02 14:41:38,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:38,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:38,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 14:41:38,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:38,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:41:38,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:41:38,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:41:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:41:38,241 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-02 14:41:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:38,292 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-10-02 14:41:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:41:38,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-02 14:41:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:38,295 INFO L225 Difference]: With dead ends: 43 [2019-10-02 14:41:38,296 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 14:41:38,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:41:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 14:41:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-02 14:41:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 14:41:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-02 14:41:38,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 41 [2019-10-02 14:41:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:38,307 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-02 14:41:38,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:41:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-02 14:41:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 14:41:38,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:38,309 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:38,309 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:38,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:38,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1738733132, now seen corresponding path program 1 times [2019-10-02 14:41:38,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:38,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:38,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:41:38,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:38,423 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:38,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:38,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:41:38,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:38,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:38,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-02 14:41:38,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:41:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:41:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:41:38,575 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2019-10-02 14:41:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:38,676 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-10-02 14:41:38,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:41:38,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-02 14:41:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:38,678 INFO L225 Difference]: With dead ends: 53 [2019-10-02 14:41:38,678 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 14:41:38,679 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:41:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 14:41:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-02 14:41:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 14:41:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-02 14:41:38,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 43 [2019-10-02 14:41:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:38,686 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-02 14:41:38,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:41:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-02 14:41:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:41:38,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:38,689 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:38,689 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1671851891, now seen corresponding path program 2 times [2019-10-02 14:41:38,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:38,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:38,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:38,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:38,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:39,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:39,193 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:39,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:39,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:39,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:39,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:41:39,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:39,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:39,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:39,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:41:39,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:39,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-10-02 14:41:39,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:41:39,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:41:39,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:41:39,490 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 14 states. [2019-10-02 14:41:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:39,778 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2019-10-02 14:41:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:41:39,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-10-02 14:41:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:39,798 INFO L225 Difference]: With dead ends: 77 [2019-10-02 14:41:39,799 INFO L226 Difference]: Without dead ends: 73 [2019-10-02 14:41:39,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:41:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-02 14:41:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2019-10-02 14:41:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 14:41:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2019-10-02 14:41:39,819 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 52 [2019-10-02 14:41:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:39,819 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2019-10-02 14:41:39,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:41:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2019-10-02 14:41:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:41:39,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:39,822 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:39,822 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:39,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1943057035, now seen corresponding path program 1 times [2019-10-02 14:41:39,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:39,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:39,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 14:41:40,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:40,590 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:40,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:40,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 14:41:40,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:40,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:41:40,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:41:40,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:40,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:40,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:41:40,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:9 [2019-10-02 14:41:41,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-02 14:41:41,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:41,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:41,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:41:41,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2019-10-02 14:41:41,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-02 14:41:41,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:41,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:41,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:41:41,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2019-10-02 14:41:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 69 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 14:41:41,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:41,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 29 [2019-10-02 14:41:41,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:41:41,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:41:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:41:41,493 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand 29 states. [2019-10-02 14:41:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:45,886 INFO L93 Difference]: Finished difference Result 326 states and 471 transitions. [2019-10-02 14:41:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-02 14:41:45,891 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-10-02 14:41:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:45,896 INFO L225 Difference]: With dead ends: 326 [2019-10-02 14:41:45,896 INFO L226 Difference]: Without dead ends: 265 [2019-10-02 14:41:45,901 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=977, Invalid=5343, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 14:41:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-02 14:41:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 204. [2019-10-02 14:41:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-02 14:41:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 303 transitions. [2019-10-02 14:41:45,977 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 303 transitions. Word has length 52 [2019-10-02 14:41:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:45,979 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 303 transitions. [2019-10-02 14:41:45,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:41:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 303 transitions. [2019-10-02 14:41:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:41:45,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:45,992 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:45,992 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1733891505, now seen corresponding path program 2 times [2019-10-02 14:41:45,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:45,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:45,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 1 proven. 69 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 14:41:46,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:46,933 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:46,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:47,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:47,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:47,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:41:47,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:47,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:41:47,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:47,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 22 [2019-10-02 14:41:47,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:47,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:47,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:41:47,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:15 [2019-10-02 14:41:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 44 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:41:47,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:47,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2019-10-02 14:41:47,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 14:41:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 14:41:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:41:47,460 INFO L87 Difference]: Start difference. First operand 204 states and 303 transitions. Second operand 28 states. [2019-10-02 14:41:50,096 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-02 14:41:50,362 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-02 14:41:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:50,623 INFO L93 Difference]: Finished difference Result 695 states and 1005 transitions. [2019-10-02 14:41:50,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 14:41:50,624 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-10-02 14:41:50,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:50,628 INFO L225 Difference]: With dead ends: 695 [2019-10-02 14:41:50,629 INFO L226 Difference]: Without dead ends: 466 [2019-10-02 14:41:50,633 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=473, Invalid=3559, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 14:41:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-02 14:41:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 348. [2019-10-02 14:41:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-02 14:41:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 496 transitions. [2019-10-02 14:41:50,686 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 496 transitions. Word has length 52 [2019-10-02 14:41:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:50,686 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 496 transitions. [2019-10-02 14:41:50,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 14:41:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 496 transitions. [2019-10-02 14:41:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:41:50,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:50,689 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:50,690 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:50,690 INFO L82 PathProgramCache]: Analyzing trace with hash -173515275, now seen corresponding path program 3 times [2019-10-02 14:41:50,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:50,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 14:41:51,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:51,545 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:51,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:41:51,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 14:41:51,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:51,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 14:41:51,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:51,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:41:51,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-10-02 14:41:51,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:51,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:41:51,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-10-02 14:41:51,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:51,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:51,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:41:51,857 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:35 [2019-10-02 14:41:52,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2019-10-02 14:41:52,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:52,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2019-10-02 14:41:52,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:52,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:52,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:41:52,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:27 [2019-10-02 14:41:52,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-10-02 14:41:52,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:52,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-10-02 14:41:52,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:52,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:52,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:41:52,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:45 [2019-10-02 14:41:52,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 14:41:52,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:52,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 35 [2019-10-02 14:41:52,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 14:41:52,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 14:41:52,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 14:41:52,727 INFO L87 Difference]: Start difference. First operand 348 states and 496 transitions. Second operand 35 states. [2019-10-02 14:41:55,659 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-10-02 14:41:56,159 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-10-02 14:41:56,320 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-02 14:41:56,536 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-10-02 14:41:56,703 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-10-02 14:41:57,061 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-10-02 14:41:57,222 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-10-02 14:41:57,404 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-10-02 14:41:57,535 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-10-02 14:41:57,833 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2019-10-02 14:41:58,038 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-10-02 14:42:00,590 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-10-02 14:42:01,083 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-10-02 14:42:02,291 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-10-02 14:42:02,466 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-10-02 14:42:02,803 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-10-02 14:42:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:02,979 INFO L93 Difference]: Finished difference Result 1123 states and 1540 transitions. [2019-10-02 14:42:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-02 14:42:02,981 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 52 [2019-10-02 14:42:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:02,987 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 14:42:02,987 INFO L226 Difference]: Without dead ends: 967 [2019-10-02 14:42:02,992 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4078 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1366, Invalid=10844, Unknown=0, NotChecked=0, Total=12210 [2019-10-02 14:42:02,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-10-02 14:42:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 698. [2019-10-02 14:42:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-10-02 14:42:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 966 transitions. [2019-10-02 14:42:03,086 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 966 transitions. Word has length 52 [2019-10-02 14:42:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:03,087 INFO L475 AbstractCegarLoop]: Abstraction has 698 states and 966 transitions. [2019-10-02 14:42:03,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 14:42:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 966 transitions. [2019-10-02 14:42:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:42:03,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:03,090 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:03,090 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:03,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1892746489, now seen corresponding path program 4 times [2019-10-02 14:42:03,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:03,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:03,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:03,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 14:42:03,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:03,327 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:03,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:03,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:03,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:03,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:42:03,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:42:03,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:03,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 15 [2019-10-02 14:42:03,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:42:03,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:42:03,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:42:03,520 INFO L87 Difference]: Start difference. First operand 698 states and 966 transitions. Second operand 15 states. [2019-10-02 14:42:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:03,791 INFO L93 Difference]: Finished difference Result 1156 states and 1751 transitions. [2019-10-02 14:42:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:42:03,792 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-10-02 14:42:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:03,801 INFO L225 Difference]: With dead ends: 1156 [2019-10-02 14:42:03,801 INFO L226 Difference]: Without dead ends: 1152 [2019-10-02 14:42:03,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:42:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-10-02 14:42:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 890. [2019-10-02 14:42:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-10-02 14:42:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1298 transitions. [2019-10-02 14:42:03,930 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1298 transitions. Word has length 52 [2019-10-02 14:42:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:03,930 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1298 transitions. [2019-10-02 14:42:03,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:42:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1298 transitions. [2019-10-02 14:42:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:42:03,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:03,935 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:03,936 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2144055369, now seen corresponding path program 5 times [2019-10-02 14:42:03,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:03,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:03,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 22 proven. 49 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:42:05,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:05,004 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:05,052 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:05,101 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 14:42:05,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:05,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-02 14:42:05,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:05,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:05,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:42:05,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:05,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:05,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:05,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-10-02 14:42:05,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:05,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-10-02 14:42:05,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:05,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:05,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:05,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:35 [2019-10-02 14:42:05,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:05,606 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:05,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 27 [2019-10-02 14:42:05,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:05,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:05,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:05,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:19 [2019-10-02 14:42:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 14:42:05,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:05,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 37 [2019-10-02 14:42:05,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 14:42:05,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 14:42:05,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:42:05,990 INFO L87 Difference]: Start difference. First operand 890 states and 1298 transitions. Second operand 37 states. [2019-10-02 14:42:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:10,823 INFO L93 Difference]: Finished difference Result 1137 states and 1606 transitions. [2019-10-02 14:42:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 14:42:10,824 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 52 [2019-10-02 14:42:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:10,832 INFO L225 Difference]: With dead ends: 1137 [2019-10-02 14:42:10,832 INFO L226 Difference]: Without dead ends: 1119 [2019-10-02 14:42:10,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=898, Invalid=6584, Unknown=0, NotChecked=0, Total=7482 [2019-10-02 14:42:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-10-02 14:42:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 874. [2019-10-02 14:42:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-10-02 14:42:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1256 transitions. [2019-10-02 14:42:10,979 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1256 transitions. Word has length 52 [2019-10-02 14:42:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:10,980 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1256 transitions. [2019-10-02 14:42:10,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 14:42:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1256 transitions. [2019-10-02 14:42:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:42:10,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:10,986 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:10,986 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1919998385, now seen corresponding path program 6 times [2019-10-02 14:42:10,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:10,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 1 proven. 69 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 14:42:11,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:11,558 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:11,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-02 14:42:11,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:11,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 14:42:11,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:11,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:11,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:11,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2019-10-02 14:42:11,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:11,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:11,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:11,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:19 [2019-10-02 14:42:11,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:11,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-10-02 14:42:11,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:11,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:11,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:11,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-10-02 14:42:11,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:11,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:12,008 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:12,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 70 [2019-10-02 14:42:12,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:12,044 INFO L567 ElimStorePlain]: treesize reduction 21, result has 71.6 percent of original size [2019-10-02 14:42:12,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:12,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:12,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:14 [2019-10-02 14:42:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 1 proven. 69 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 14:42:12,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:12,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2019-10-02 14:42:12,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 14:42:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 14:42:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:42:12,238 INFO L87 Difference]: Start difference. First operand 874 states and 1256 transitions. Second operand 28 states. [2019-10-02 14:42:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:14,840 INFO L93 Difference]: Finished difference Result 1758 states and 2488 transitions. [2019-10-02 14:42:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 14:42:14,841 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-10-02 14:42:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:14,849 INFO L225 Difference]: With dead ends: 1758 [2019-10-02 14:42:14,849 INFO L226 Difference]: Without dead ends: 1270 [2019-10-02 14:42:14,853 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=440, Invalid=3100, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 14:42:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-10-02 14:42:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1015. [2019-10-02 14:42:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-02 14:42:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1417 transitions. [2019-10-02 14:42:14,974 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1417 transitions. Word has length 52 [2019-10-02 14:42:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:14,974 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1417 transitions. [2019-10-02 14:42:14,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 14:42:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1417 transitions. [2019-10-02 14:42:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:42:14,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:14,978 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:14,978 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1833869261, now seen corresponding path program 1 times [2019-10-02 14:42:14,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:14,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:14,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:42:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:15,305 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:15,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:15,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:42:15,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:15,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:15,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:15,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:42:15,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:15,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-10-02 14:42:15,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:42:15,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:42:15,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:42:15,512 INFO L87 Difference]: Start difference. First operand 1015 states and 1417 transitions. Second operand 14 states. [2019-10-02 14:42:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:15,769 INFO L93 Difference]: Finished difference Result 1566 states and 2355 transitions. [2019-10-02 14:42:15,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:42:15,770 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-10-02 14:42:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:15,781 INFO L225 Difference]: With dead ends: 1566 [2019-10-02 14:42:15,781 INFO L226 Difference]: Without dead ends: 1562 [2019-10-02 14:42:15,783 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:42:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-10-02 14:42:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1202. [2019-10-02 14:42:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2019-10-02 14:42:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1734 transitions. [2019-10-02 14:42:15,969 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1734 transitions. Word has length 52 [2019-10-02 14:42:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:15,969 INFO L475 AbstractCegarLoop]: Abstraction has 1202 states and 1734 transitions. [2019-10-02 14:42:15,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:42:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1734 transitions. [2019-10-02 14:42:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:42:15,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:15,975 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:15,975 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash -359515934, now seen corresponding path program 3 times [2019-10-02 14:42:15,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:15,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 32 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 14:42:16,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:16,037 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:16,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:16,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 14:42:16,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:16,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:42:16,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:16,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:16,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-10-02 14:42:16,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:42:16,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:42:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:42:16,195 INFO L87 Difference]: Start difference. First operand 1202 states and 1734 transitions. Second operand 14 states. [2019-10-02 14:42:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:16,546 INFO L93 Difference]: Finished difference Result 1718 states and 2437 transitions. [2019-10-02 14:42:16,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:42:16,546 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-02 14:42:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:16,550 INFO L225 Difference]: With dead ends: 1718 [2019-10-02 14:42:16,550 INFO L226 Difference]: Without dead ends: 735 [2019-10-02 14:42:16,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:42:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-02 14:42:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 626. [2019-10-02 14:42:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 14:42:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-02 14:42:16,619 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 55 [2019-10-02 14:42:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:16,619 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-02 14:42:16,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:42:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-02 14:42:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:42:16,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:16,622 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:16,622 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 677085675, now seen corresponding path program 7 times [2019-10-02 14:42:16,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:16,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:16,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 14:42:16,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:16,692 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:16,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:16,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:42:16,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:42:16,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:16,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-10-02 14:42:16,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:42:16,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:42:16,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:42:16,872 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 12 states. [2019-10-02 14:42:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:17,210 INFO L93 Difference]: Finished difference Result 683 states and 946 transitions. [2019-10-02 14:42:17,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:42:17,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-10-02 14:42:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:17,215 INFO L225 Difference]: With dead ends: 683 [2019-10-02 14:42:17,215 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 14:42:17,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:42:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 14:42:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 542. [2019-10-02 14:42:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-02 14:42:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 780 transitions. [2019-10-02 14:42:17,268 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 780 transitions. Word has length 56 [2019-10-02 14:42:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:17,269 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 780 transitions. [2019-10-02 14:42:17,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:42:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 780 transitions. [2019-10-02 14:42:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:42:17,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:17,272 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:17,272 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1775462610, now seen corresponding path program 4 times [2019-10-02 14:42:17,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:17,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:17,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:17,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 14:42:17,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:17,535 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:17,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:17,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:17,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:17,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 14:42:17,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:17,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:17,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:17,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 14:42:17,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:17,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-10-02 14:42:17,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:42:17,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:42:17,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:42:17,762 INFO L87 Difference]: Start difference. First operand 542 states and 780 transitions. Second operand 15 states. [2019-10-02 14:42:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:18,011 INFO L93 Difference]: Finished difference Result 773 states and 1216 transitions. [2019-10-02 14:42:18,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:42:18,012 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-10-02 14:42:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:18,016 INFO L225 Difference]: With dead ends: 773 [2019-10-02 14:42:18,016 INFO L226 Difference]: Without dead ends: 769 [2019-10-02 14:42:18,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:42:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-10-02 14:42:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 637. [2019-10-02 14:42:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-02 14:42:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 952 transitions. [2019-10-02 14:42:18,107 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 952 transitions. Word has length 63 [2019-10-02 14:42:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:18,107 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 952 transitions. [2019-10-02 14:42:18,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:42:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 952 transitions. [2019-10-02 14:42:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:42:18,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:18,111 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:18,111 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1095404240, now seen corresponding path program 8 times [2019-10-02 14:42:18,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:18,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:18,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:18,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:18,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 13 proven. 134 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 14:42:19,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:19,241 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:19,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:19,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:19,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:19,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-02 14:42:19,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:19,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:19,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:42:19,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:19,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:19,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:19,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-10-02 14:42:19,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-02 14:42:19,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:19,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:19,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:19,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 [2019-10-02 14:42:19,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 14:42:19,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:19,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:19,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 14:42:19,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-10-02 14:42:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 14 proven. 129 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 14:42:20,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:20,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 47 [2019-10-02 14:42:20,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 14:42:20,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 14:42:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1915, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 14:42:20,211 INFO L87 Difference]: Start difference. First operand 637 states and 952 transitions. Second operand 47 states. [2019-10-02 14:42:22,201 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-10-02 14:42:24,765 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-10-02 14:42:24,981 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-10-02 14:42:25,477 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-10-02 14:42:25,776 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-10-02 14:42:28,170 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-02 14:42:28,408 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 59 [2019-10-02 14:42:28,993 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-10-02 14:42:29,222 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2019-10-02 14:42:29,525 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-10-02 14:42:29,723 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2019-10-02 14:42:30,214 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-10-02 14:42:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:30,606 INFO L93 Difference]: Finished difference Result 2772 states and 4087 transitions. [2019-10-02 14:42:30,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-10-02 14:42:30,607 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 63 [2019-10-02 14:42:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:30,618 INFO L225 Difference]: With dead ends: 2772 [2019-10-02 14:42:30,618 INFO L226 Difference]: Without dead ends: 2345 [2019-10-02 14:42:30,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6769 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2691, Invalid=17049, Unknown=0, NotChecked=0, Total=19740 [2019-10-02 14:42:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2019-10-02 14:42:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1198. [2019-10-02 14:42:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-10-02 14:42:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1784 transitions. [2019-10-02 14:42:30,830 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1784 transitions. Word has length 63 [2019-10-02 14:42:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:30,830 INFO L475 AbstractCegarLoop]: Abstraction has 1198 states and 1784 transitions. [2019-10-02 14:42:30,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 14:42:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1784 transitions. [2019-10-02 14:42:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:42:30,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:30,836 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:30,836 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:30,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1517297172, now seen corresponding path program 9 times [2019-10-02 14:42:30,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:30,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:30,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 14:42:32,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:32,542 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:32,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:32,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 14:42:32,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:32,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-02 14:42:32,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:32,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:32,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:42:32,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:32,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:32,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:32,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2019-10-02 14:42:32,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:32,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:32,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:32,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 57 [2019-10-02 14:42:32,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:33,029 INFO L567 ElimStorePlain]: treesize reduction 34, result has 60.0 percent of original size [2019-10-02 14:42:33,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 14:42:33,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2019-10-02 14:42:33,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:33,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 124 [2019-10-02 14:42:33,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:33,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:33,265 INFO L567 ElimStorePlain]: treesize reduction 165, result has 35.5 percent of original size [2019-10-02 14:42:33,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:33,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 14:42:33,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:91 [2019-10-02 14:42:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:33,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:33,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:33,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:33,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:42:33,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:42:33,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:42:33,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2019-10-02 14:42:33,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:33,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,579 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:42:33,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:42:33,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2019-10-02 14:42:33,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:33,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:33,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:42:33,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:48 [2019-10-02 14:42:33,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:34,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:34,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 14:42:34,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:34,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:34,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 14:42:34,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:42:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 87 proven. 49 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 14:42:34,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:34,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2019-10-02 14:42:34,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 14:42:34,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 14:42:34,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2265, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:42:34,547 INFO L87 Difference]: Start difference. First operand 1198 states and 1784 transitions. Second operand 51 states. [2019-10-02 14:42:36,724 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-02 14:42:36,989 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-02 14:42:37,164 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-10-02 14:42:37,522 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-10-02 14:42:37,727 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-10-02 14:42:38,285 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-02 14:42:38,793 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-02 14:42:39,457 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-10-02 14:42:39,600 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-10-02 14:42:39,734 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-10-02 14:42:40,218 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-10-02 14:42:40,418 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-10-02 14:42:40,798 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-10-02 14:42:41,005 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-10-02 14:42:41,170 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-10-02 14:42:41,365 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-10-02 14:42:41,591 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-10-02 14:42:41,748 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2019-10-02 14:42:42,008 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2019-10-02 14:42:42,297 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 45 [2019-10-02 14:42:42,653 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-10-02 14:42:42,839 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-02 14:42:43,499 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-10-02 14:42:43,822 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-10-02 14:42:44,184 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-10-02 14:42:44,466 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-10-02 14:42:44,682 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-10-02 14:42:44,870 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-10-02 14:42:45,030 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-10-02 14:42:45,206 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-10-02 14:42:45,364 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-10-02 14:42:45,702 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-10-02 14:42:45,903 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-10-02 14:42:46,067 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-10-02 14:42:46,394 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-10-02 14:42:46,573 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-10-02 14:42:46,765 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-10-02 14:42:46,990 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-10-02 14:42:47,186 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-10-02 14:42:47,478 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-10-02 14:42:47,664 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-02 14:42:47,809 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-10-02 14:42:48,030 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-10-02 14:42:48,269 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-10-02 14:42:48,414 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-02 14:42:49,021 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-10-02 14:42:49,168 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-10-02 14:42:49,446 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-10-02 14:42:49,644 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-10-02 14:42:50,017 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-10-02 14:42:50,237 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-10-02 14:42:50,606 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-10-02 14:42:51,939 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-10-02 14:42:52,120 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-10-02 14:42:54,497 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-10-02 14:42:54,824 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-10-02 14:42:54,948 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-10-02 14:42:55,352 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-10-02 14:42:55,498 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-10-02 14:42:55,965 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-10-02 14:42:56,235 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-10-02 14:42:56,535 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-10-02 14:42:56,836 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-02 14:42:57,405 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-10-02 14:42:57,669 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-10-02 14:42:57,867 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 51 [2019-10-02 14:42:58,569 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 48 [2019-10-02 14:42:58,770 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2019-10-02 14:42:59,361 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 35 [2019-10-02 14:43:00,123 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 43 [2019-10-02 14:43:00,368 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2019-10-02 14:43:00,558 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 51 [2019-10-02 14:43:00,880 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 43 [2019-10-02 14:43:01,109 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2019-10-02 14:43:01,731 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 51 [2019-10-02 14:43:01,993 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 54 [2019-10-02 14:43:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:03,112 INFO L93 Difference]: Finished difference Result 4750 states and 7233 transitions. [2019-10-02 14:43:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2019-10-02 14:43:03,112 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 63 [2019-10-02 14:43:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:03,134 INFO L225 Difference]: With dead ends: 4750 [2019-10-02 14:43:03,134 INFO L226 Difference]: Without dead ends: 3620 [2019-10-02 14:43:03,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23345 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=6243, Invalid=52563, Unknown=0, NotChecked=0, Total=58806 [2019-10-02 14:43:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2019-10-02 14:43:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 2733. [2019-10-02 14:43:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2733 states. [2019-10-02 14:43:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 4069 transitions. [2019-10-02 14:43:03,602 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 4069 transitions. Word has length 63 [2019-10-02 14:43:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:03,603 INFO L475 AbstractCegarLoop]: Abstraction has 2733 states and 4069 transitions. [2019-10-02 14:43:03,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 14:43:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 4069 transitions. [2019-10-02 14:43:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:43:03,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:03,615 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:03,615 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:03,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:03,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1239641008, now seen corresponding path program 10 times [2019-10-02 14:43:03,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:03,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:03,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 38 proven. 101 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:43:04,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:04,742 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:04,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:43:04,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:43:04,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:04,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-02 14:43:04,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:05,289 INFO L341 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2019-10-02 14:43:05,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 68 [2019-10-02 14:43:05,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:05,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:05,331 INFO L567 ElimStorePlain]: treesize reduction 29, result has 63.7 percent of original size [2019-10-02 14:43:05,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:05,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:51 [2019-10-02 14:43:05,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:05,520 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 14:43:05,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:05,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:05,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:05,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:05,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:05,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:05,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 70 treesize of output 126 [2019-10-02 14:43:05,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:05,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:05,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:05,647 INFO L567 ElimStorePlain]: treesize reduction 146, result has 36.0 percent of original size [2019-10-02 14:43:05,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:05,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:135, output treesize:82 [2019-10-02 14:43:05,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:05,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:05,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:05,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:43:05,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:05,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:05,932 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:05,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2019-10-02 14:43:05,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:05,955 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-10-02 14:43:05,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:05,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:13 [2019-10-02 14:43:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 18 proven. 133 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 14:43:06,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:06,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 46 [2019-10-02 14:43:06,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 14:43:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 14:43:06,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1856, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 14:43:06,289 INFO L87 Difference]: Start difference. First operand 2733 states and 4069 transitions. Second operand 46 states. [2019-10-02 14:43:11,850 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-10-02 14:43:13,756 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 32 [2019-10-02 14:43:14,572 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-10-02 14:43:15,474 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 30 [2019-10-02 14:43:15,937 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 25 [2019-10-02 14:43:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:16,915 INFO L93 Difference]: Finished difference Result 4529 states and 6758 transitions. [2019-10-02 14:43:16,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-10-02 14:43:16,916 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 63 [2019-10-02 14:43:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:16,937 INFO L225 Difference]: With dead ends: 4529 [2019-10-02 14:43:16,937 INFO L226 Difference]: Without dead ends: 4089 [2019-10-02 14:43:16,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8403 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2350, Invalid=20300, Unknown=0, NotChecked=0, Total=22650 [2019-10-02 14:43:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2019-10-02 14:43:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 2677. [2019-10-02 14:43:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2677 states. [2019-10-02 14:43:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3935 transitions. [2019-10-02 14:43:17,532 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3935 transitions. Word has length 63 [2019-10-02 14:43:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:17,532 INFO L475 AbstractCegarLoop]: Abstraction has 2677 states and 3935 transitions. [2019-10-02 14:43:17,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 14:43:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3935 transitions. [2019-10-02 14:43:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:43:17,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:17,542 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:17,543 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1073862736, now seen corresponding path program 11 times [2019-10-02 14:43:17,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:17,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:17,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 4 proven. 131 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 14:43:18,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:18,127 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:18,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:43:18,237 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-02 14:43:18,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:18,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 14:43:18,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:18,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:18,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:18,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:18,431 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:18,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2019-10-02 14:43:18,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:18,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:18,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:18,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2019-10-02 14:43:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 53 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 14:43:18,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:18,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-10-02 14:43:18,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 14:43:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 14:43:18,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:43:18,663 INFO L87 Difference]: Start difference. First operand 2677 states and 3935 transitions. Second operand 28 states. [2019-10-02 14:43:20,972 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-10-02 14:43:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:21,682 INFO L93 Difference]: Finished difference Result 6044 states and 8887 transitions. [2019-10-02 14:43:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 14:43:21,683 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2019-10-02 14:43:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:21,705 INFO L225 Difference]: With dead ends: 6044 [2019-10-02 14:43:21,705 INFO L226 Difference]: Without dead ends: 4269 [2019-10-02 14:43:21,713 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=438, Invalid=2532, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 14:43:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2019-10-02 14:43:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 3034. [2019-10-02 14:43:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-10-02 14:43:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4465 transitions. [2019-10-02 14:43:22,213 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4465 transitions. Word has length 63 [2019-10-02 14:43:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:22,213 INFO L475 AbstractCegarLoop]: Abstraction has 3034 states and 4465 transitions. [2019-10-02 14:43:22,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 14:43:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4465 transitions. [2019-10-02 14:43:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:43:22,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:22,224 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:22,224 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:22,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1115931088, now seen corresponding path program 12 times [2019-10-02 14:43:22,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:22,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:22,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 14:43:22,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:22,973 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:23,039 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:43:23,079 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-02 14:43:23,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:23,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 14:43:23,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:23,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:23,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:43:23,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:23,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:23,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:23,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-02 14:43:23,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-10-02 14:43:23,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:23,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:23,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:23,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-10-02 14:43:23,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 14:43:23,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:23,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:23,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:23,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-02 14:43:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 76 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 14:43:23,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:23,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2019-10-02 14:43:23,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 14:43:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 14:43:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:43:23,736 INFO L87 Difference]: Start difference. First operand 3034 states and 4465 transitions. Second operand 31 states. [2019-10-02 14:43:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:29,644 INFO L93 Difference]: Finished difference Result 4525 states and 6447 transitions. [2019-10-02 14:43:29,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-02 14:43:29,645 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 63 [2019-10-02 14:43:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:29,659 INFO L225 Difference]: With dead ends: 4525 [2019-10-02 14:43:29,659 INFO L226 Difference]: Without dead ends: 3289 [2019-10-02 14:43:29,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2687 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=994, Invalid=7748, Unknown=0, NotChecked=0, Total=8742 [2019-10-02 14:43:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2019-10-02 14:43:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2553. [2019-10-02 14:43:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-10-02 14:43:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3582 transitions. [2019-10-02 14:43:30,047 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3582 transitions. Word has length 63 [2019-10-02 14:43:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:30,048 INFO L475 AbstractCegarLoop]: Abstraction has 2553 states and 3582 transitions. [2019-10-02 14:43:30,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 14:43:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3582 transitions. [2019-10-02 14:43:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:43:30,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:30,056 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:30,057 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:30,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2128550992, now seen corresponding path program 13 times [2019-10-02 14:43:30,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:30,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:30,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:30,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:30,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 14:43:30,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:30,753 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:30,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:43:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:30,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 14:43:30,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:31,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:31,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:31,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:31,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:31,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 32 [2019-10-02 14:43:31,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:31,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:31,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:31,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2019-10-02 14:43:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 53 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 14:43:31,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:31,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2019-10-02 14:43:31,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:43:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:43:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:43:31,259 INFO L87 Difference]: Start difference. First operand 2553 states and 3582 transitions. Second operand 29 states. [2019-10-02 14:43:32,246 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-02 14:43:32,636 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-02 14:43:33,016 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-10-02 14:43:33,360 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-02 14:43:34,548 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 36 [2019-10-02 14:43:34,783 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 14:43:35,089 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-10-02 14:43:35,343 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-02 14:43:35,500 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-02 14:43:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:36,236 INFO L93 Difference]: Finished difference Result 4900 states and 6772 transitions. [2019-10-02 14:43:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 14:43:36,237 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2019-10-02 14:43:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:36,246 INFO L225 Difference]: With dead ends: 4900 [2019-10-02 14:43:36,247 INFO L226 Difference]: Without dead ends: 3394 [2019-10-02 14:43:36,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=626, Invalid=3796, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 14:43:36,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2019-10-02 14:43:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2666. [2019-10-02 14:43:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2666 states. [2019-10-02 14:43:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 3712 transitions. [2019-10-02 14:43:36,801 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 3712 transitions. Word has length 63 [2019-10-02 14:43:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:36,802 INFO L475 AbstractCegarLoop]: Abstraction has 2666 states and 3712 transitions. [2019-10-02 14:43:36,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:43:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 3712 transitions. [2019-10-02 14:43:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:43:36,809 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:36,809 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:36,810 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:36,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:36,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1426951118, now seen corresponding path program 14 times [2019-10-02 14:43:36,810 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:36,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:36,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:36,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:43:36,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 25 proven. 123 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 14:43:38,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:38,469 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:38,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:43:38,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:43:38,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:38,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 14:43:38,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:38,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:38,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:43:38,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:38,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:38,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:38,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2019-10-02 14:43:38,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:38,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:38,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:38,932 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:38,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-10-02 14:43:38,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:38,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:38,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:38,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-10-02 14:43:39,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:39,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:39,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:39,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:39,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2019-10-02 14:43:39,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:39,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:39,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:39,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:34 [2019-10-02 14:43:39,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:39,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:39,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:39,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 72 [2019-10-02 14:43:39,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:39,155 INFO L567 ElimStorePlain]: treesize reduction 21, result has 73.1 percent of original size [2019-10-02 14:43:39,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:39,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:39,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:16 [2019-10-02 14:43:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 41 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 14:43:39,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:39,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 51 [2019-10-02 14:43:39,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 14:43:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 14:43:39,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2249, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:43:39,476 INFO L87 Difference]: Start difference. First operand 2666 states and 3712 transitions. Second operand 51 states. [2019-10-02 14:43:41,584 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-02 14:43:41,979 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-02 14:43:42,122 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-02 14:43:45,436 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-10-02 14:43:45,585 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-02 14:43:46,034 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-10-02 14:43:48,179 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-02 14:43:52,035 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-10-02 14:43:52,298 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-10-02 14:43:52,445 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-10-02 14:43:53,924 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-02 14:43:54,202 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-02 14:43:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:55,711 INFO L93 Difference]: Finished difference Result 5904 states and 8183 transitions. [2019-10-02 14:43:55,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-10-02 14:43:55,711 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 63 [2019-10-02 14:43:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:55,729 INFO L225 Difference]: With dead ends: 5904 [2019-10-02 14:43:55,729 INFO L226 Difference]: Without dead ends: 4841 [2019-10-02 14:43:55,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16455 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3878, Invalid=38764, Unknown=0, NotChecked=0, Total=42642 [2019-10-02 14:43:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2019-10-02 14:43:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 3455. [2019-10-02 14:43:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3455 states. [2019-10-02 14:43:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 3455 states and 4667 transitions. [2019-10-02 14:43:56,288 INFO L78 Accepts]: Start accepts. Automaton has 3455 states and 4667 transitions. Word has length 63 [2019-10-02 14:43:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:56,289 INFO L475 AbstractCegarLoop]: Abstraction has 3455 states and 4667 transitions. [2019-10-02 14:43:56,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 14:43:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3455 states and 4667 transitions. [2019-10-02 14:43:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:43:56,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:56,298 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:56,298 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1168785680, now seen corresponding path program 15 times [2019-10-02 14:43:56,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:56,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:56,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:56,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:56,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 14:43:56,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:56,533 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:56,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:43:56,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 14:43:56,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:56,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 14:43:56,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:56,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:56,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:56,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:43:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:43:56,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:56,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 15 [2019-10-02 14:43:56,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:43:56,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:43:56,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:43:56,865 INFO L87 Difference]: Start difference. First operand 3455 states and 4667 transitions. Second operand 15 states. [2019-10-02 14:43:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:57,486 INFO L93 Difference]: Finished difference Result 4296 states and 6056 transitions. [2019-10-02 14:43:57,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:43:57,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-10-02 14:43:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:57,508 INFO L225 Difference]: With dead ends: 4296 [2019-10-02 14:43:57,508 INFO L226 Difference]: Without dead ends: 4292 [2019-10-02 14:43:57,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:43:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2019-10-02 14:43:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 3525. [2019-10-02 14:43:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3525 states. [2019-10-02 14:43:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 4820 transitions. [2019-10-02 14:43:58,157 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 4820 transitions. Word has length 63 [2019-10-02 14:43:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:58,158 INFO L475 AbstractCegarLoop]: Abstraction has 3525 states and 4820 transitions. [2019-10-02 14:43:58,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:43:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 4820 transitions. [2019-10-02 14:43:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:43:58,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:58,167 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:58,167 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2038424428, now seen corresponding path program 16 times [2019-10-02 14:43:58,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:58,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 40 proven. 95 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 14:43:59,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:59,071 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:59,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:43:59,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:43:59,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:59,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 14:43:59,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:59,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:43:59,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-10-02 14:43:59,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:43:59,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:43:59,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:43:59,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2019-10-02 14:43:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 14:43:59,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:59,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 32 [2019-10-02 14:43:59,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 14:43:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 14:43:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:43:59,554 INFO L87 Difference]: Start difference. First operand 3525 states and 4820 transitions. Second operand 32 states. [2019-10-02 14:44:00,251 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-10-02 14:44:00,598 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-10-02 14:44:00,763 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-02 14:44:00,971 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-02 14:44:01,119 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-10-02 14:44:01,476 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-10-02 14:44:01,622 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-02 14:44:03,427 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-10-02 14:44:03,640 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-10-02 14:44:04,257 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-10-02 14:44:04,468 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-10-02 14:44:04,667 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-10-02 14:44:04,839 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-10-02 14:44:05,168 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-10-02 14:44:05,383 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-02 14:44:05,556 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-10-02 14:44:05,721 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-02 14:44:06,444 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-10-02 14:44:06,618 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-10-02 14:44:06,830 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-10-02 14:44:06,992 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-02 14:44:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:08,235 INFO L93 Difference]: Finished difference Result 4414 states and 5936 transitions. [2019-10-02 14:44:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-02 14:44:08,236 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2019-10-02 14:44:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:08,249 INFO L225 Difference]: With dead ends: 4414 [2019-10-02 14:44:08,249 INFO L226 Difference]: Without dead ends: 3354 [2019-10-02 14:44:08,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3420 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1292, Invalid=9010, Unknown=0, NotChecked=0, Total=10302 [2019-10-02 14:44:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2019-10-02 14:44:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 2992. [2019-10-02 14:44:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2019-10-02 14:44:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 4094 transitions. [2019-10-02 14:44:08,688 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 4094 transitions. Word has length 63 [2019-10-02 14:44:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:08,688 INFO L475 AbstractCegarLoop]: Abstraction has 2992 states and 4094 transitions. [2019-10-02 14:44:08,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 14:44:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 4094 transitions. [2019-10-02 14:44:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:44:08,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:08,693 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:08,694 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:08,694 INFO L82 PathProgramCache]: Analyzing trace with hash -916952976, now seen corresponding path program 17 times [2019-10-02 14:44:08,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:08,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:08,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:08,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:08,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 5 proven. 108 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 14:44:08,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:08,997 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:09,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:44:09,133 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-02 14:44:09,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:09,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 14:44:09,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:09,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:09,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:09,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 14:44:09,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:09,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-10-02 14:44:09,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:44:09,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:44:09,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:44:09,227 INFO L87 Difference]: Start difference. First operand 2992 states and 4094 transitions. Second operand 17 states. [2019-10-02 14:44:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:09,956 INFO L93 Difference]: Finished difference Result 4494 states and 6699 transitions. [2019-10-02 14:44:09,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:44:09,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-10-02 14:44:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:09,968 INFO L225 Difference]: With dead ends: 4494 [2019-10-02 14:44:09,969 INFO L226 Difference]: Without dead ends: 4490 [2019-10-02 14:44:09,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:44:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-10-02 14:44:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3611. [2019-10-02 14:44:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3611 states. [2019-10-02 14:44:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 5103 transitions. [2019-10-02 14:44:10,557 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 5103 transitions. Word has length 63 [2019-10-02 14:44:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:10,557 INFO L475 AbstractCegarLoop]: Abstraction has 3611 states and 5103 transitions. [2019-10-02 14:44:10,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:44:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 5103 transitions. [2019-10-02 14:44:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:44:10,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:10,564 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:10,564 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash -310276046, now seen corresponding path program 18 times [2019-10-02 14:44:10,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:10,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:10,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:10,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:44:10,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:10,756 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:10,847 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:44:10,910 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-02 14:44:10,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:10,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 14:44:10,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:10,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:10,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:44:11,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:11,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-10-02 14:44:11,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:44:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:44:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:44:11,058 INFO L87 Difference]: Start difference. First operand 3611 states and 5103 transitions. Second operand 14 states. [2019-10-02 14:44:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:11,721 INFO L93 Difference]: Finished difference Result 4217 states and 6196 transitions. [2019-10-02 14:44:11,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:44:11,721 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-10-02 14:44:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:11,730 INFO L225 Difference]: With dead ends: 4217 [2019-10-02 14:44:11,730 INFO L226 Difference]: Without dead ends: 4213 [2019-10-02 14:44:11,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:44:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2019-10-02 14:44:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 3825. [2019-10-02 14:44:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3825 states. [2019-10-02 14:44:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5515 transitions. [2019-10-02 14:44:12,292 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5515 transitions. Word has length 63 [2019-10-02 14:44:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:12,293 INFO L475 AbstractCegarLoop]: Abstraction has 3825 states and 5515 transitions. [2019-10-02 14:44:12,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:44:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5515 transitions. [2019-10-02 14:44:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:44:12,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:12,302 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:12,302 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash 46235314, now seen corresponding path program 19 times [2019-10-02 14:44:12,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:12,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:12,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:12,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 14:44:12,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:12,480 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:12,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:44:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:12,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 14:44:12,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 14:44:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-10-02 14:44:12,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:44:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:44:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:44:12,728 INFO L87 Difference]: Start difference. First operand 3825 states and 5515 transitions. Second operand 15 states. [2019-10-02 14:44:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:13,587 INFO L93 Difference]: Finished difference Result 5441 states and 8661 transitions. [2019-10-02 14:44:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:44:13,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-10-02 14:44:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:13,606 INFO L225 Difference]: With dead ends: 5441 [2019-10-02 14:44:13,606 INFO L226 Difference]: Without dead ends: 5437 [2019-10-02 14:44:13,611 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:44:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2019-10-02 14:44:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 4514. [2019-10-02 14:44:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4514 states. [2019-10-02 14:44:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 6646 transitions. [2019-10-02 14:44:14,654 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 6646 transitions. Word has length 63 [2019-10-02 14:44:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:14,654 INFO L475 AbstractCegarLoop]: Abstraction has 4514 states and 6646 transitions. [2019-10-02 14:44:14,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:44:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 6646 transitions. [2019-10-02 14:44:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:44:14,661 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:14,661 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:14,661 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash 904744948, now seen corresponding path program 2 times [2019-10-02 14:44:14,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:14,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:14,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:14,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:44:14,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 14:44:14,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:14,897 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:14,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:44:15,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:44:15,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:15,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 14:44:15,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:15,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:15,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:15,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 14:44:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-10-02 14:44:15,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:44:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:44:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:44:15,135 INFO L87 Difference]: Start difference. First operand 4514 states and 6646 transitions. Second operand 15 states. [2019-10-02 14:44:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:16,015 INFO L93 Difference]: Finished difference Result 5738 states and 8977 transitions. [2019-10-02 14:44:16,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:44:16,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-10-02 14:44:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:16,036 INFO L225 Difference]: With dead ends: 5738 [2019-10-02 14:44:16,036 INFO L226 Difference]: Without dead ends: 5734 [2019-10-02 14:44:16,042 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:44:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2019-10-02 14:44:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 4806. [2019-10-02 14:44:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-10-02 14:44:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 7113 transitions. [2019-10-02 14:44:17,069 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 7113 transitions. Word has length 63 [2019-10-02 14:44:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:17,069 INFO L475 AbstractCegarLoop]: Abstraction has 4806 states and 7113 transitions. [2019-10-02 14:44:17,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:44:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 7113 transitions. [2019-10-02 14:44:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 14:44:17,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:17,076 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:17,077 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash -386170128, now seen corresponding path program 20 times [2019-10-02 14:44:17,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:17,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:17,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:17,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 6 proven. 89 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:44:17,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:17,157 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:44:17,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:44:17,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:17,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:44:17,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 86 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 14:44:17,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:17,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-10-02 14:44:17,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:44:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:44:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:44:17,328 INFO L87 Difference]: Start difference. First operand 4806 states and 7113 transitions. Second operand 14 states. [2019-10-02 14:44:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:18,000 INFO L93 Difference]: Finished difference Result 5171 states and 7565 transitions. [2019-10-02 14:44:18,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:44:18,000 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-10-02 14:44:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:18,009 INFO L225 Difference]: With dead ends: 5171 [2019-10-02 14:44:18,009 INFO L226 Difference]: Without dead ends: 4504 [2019-10-02 14:44:18,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:44:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2019-10-02 14:44:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 4084. [2019-10-02 14:44:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4084 states. [2019-10-02 14:44:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4084 states to 4084 states and 6088 transitions. [2019-10-02 14:44:18,619 INFO L78 Accepts]: Start accepts. Automaton has 4084 states and 6088 transitions. Word has length 65 [2019-10-02 14:44:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:18,620 INFO L475 AbstractCegarLoop]: Abstraction has 4084 states and 6088 transitions. [2019-10-02 14:44:18,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:44:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4084 states and 6088 transitions. [2019-10-02 14:44:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:44:18,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:18,626 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:18,626 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:18,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1952166727, now seen corresponding path program 5 times [2019-10-02 14:44:18,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:18,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:18,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:18,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:18,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 59 proven. 103 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 14:44:18,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:18,706 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:18,799 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:44:18,864 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-02 14:44:18,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:18,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:44:18,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 84 proven. 80 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 14:44:18,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:18,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-10-02 14:44:18,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 14:44:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 14:44:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:44:18,945 INFO L87 Difference]: Start difference. First operand 4084 states and 6088 transitions. Second operand 16 states. [2019-10-02 14:44:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:20,005 INFO L93 Difference]: Finished difference Result 4588 states and 6674 transitions. [2019-10-02 14:44:20,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:44:20,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-10-02 14:44:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:20,013 INFO L225 Difference]: With dead ends: 4588 [2019-10-02 14:44:20,013 INFO L226 Difference]: Without dead ends: 3650 [2019-10-02 14:44:20,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:44:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2019-10-02 14:44:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3362. [2019-10-02 14:44:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3362 states. [2019-10-02 14:44:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 5090 transitions. [2019-10-02 14:44:20,519 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 5090 transitions. Word has length 66 [2019-10-02 14:44:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:20,519 INFO L475 AbstractCegarLoop]: Abstraction has 3362 states and 5090 transitions. [2019-10-02 14:44:20,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 14:44:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 5090 transitions. [2019-10-02 14:44:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 14:44:20,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:20,525 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:20,525 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1143437777, now seen corresponding path program 6 times [2019-10-02 14:44:20,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:20,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 125 proven. 21 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 14:44:20,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:20,632 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:20,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:44:20,788 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 14:44:20,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:20,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:44:20,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 144 proven. 4 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 14:44:20,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:20,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-10-02 14:44:20,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 14:44:20,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 14:44:20,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:44:20,879 INFO L87 Difference]: Start difference. First operand 3362 states and 5090 transitions. Second operand 16 states. [2019-10-02 14:44:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:21,337 INFO L93 Difference]: Finished difference Result 3391 states and 5118 transitions. [2019-10-02 14:44:21,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:44:21,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-10-02 14:44:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:21,343 INFO L225 Difference]: With dead ends: 3391 [2019-10-02 14:44:21,344 INFO L226 Difference]: Without dead ends: 2802 [2019-10-02 14:44:21,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:44:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2019-10-02 14:44:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2627. [2019-10-02 14:44:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-10-02 14:44:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4114 transitions. [2019-10-02 14:44:21,732 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4114 transitions. Word has length 72 [2019-10-02 14:44:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:21,733 INFO L475 AbstractCegarLoop]: Abstraction has 2627 states and 4114 transitions. [2019-10-02 14:44:21,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 14:44:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4114 transitions. [2019-10-02 14:44:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 14:44:21,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:21,739 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:21,739 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1376864143, now seen corresponding path program 7 times [2019-10-02 14:44:21,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:21,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:21,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 14:44:23,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:23,106 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:23,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:44:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:23,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 14:44:23,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:23,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:23,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 14:44:23,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:23,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 14] total 43 [2019-10-02 14:44:23,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 14:44:23,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 14:44:23,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1690, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:44:23,675 INFO L87 Difference]: Start difference. First operand 2627 states and 4114 transitions. Second operand 43 states. [2019-10-02 14:44:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:27,016 INFO L93 Difference]: Finished difference Result 3713 states and 6491 transitions. [2019-10-02 14:44:27,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 14:44:27,017 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 74 [2019-10-02 14:44:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:27,028 INFO L225 Difference]: With dead ends: 3713 [2019-10-02 14:44:27,028 INFO L226 Difference]: Without dead ends: 3707 [2019-10-02 14:44:27,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=301, Invalid=4255, Unknown=0, NotChecked=0, Total=4556 [2019-10-02 14:44:27,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-10-02 14:44:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 2878. [2019-10-02 14:44:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2878 states. [2019-10-02 14:44:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 4596 transitions. [2019-10-02 14:44:27,569 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 4596 transitions. Word has length 74 [2019-10-02 14:44:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:27,569 INFO L475 AbstractCegarLoop]: Abstraction has 2878 states and 4596 transitions. [2019-10-02 14:44:27,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 14:44:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 4596 transitions. [2019-10-02 14:44:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 14:44:27,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:27,578 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:27,578 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2056922513, now seen corresponding path program 21 times [2019-10-02 14:44:27,579 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:27,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:27,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:44:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 48 proven. 207 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 14:44:29,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:29,208 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:29,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:44:29,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-02 14:44:29,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:29,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-02 14:44:29,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:29,376 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-02 14:44:29,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:44:29,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:44:29,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:44:29,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:44:29,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-10-02 14:44:29,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:44:29,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-10-02 14:44:29,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:29,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 14:44:29,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:44:29,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:44:29,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:44:29,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:16 [2019-10-02 14:44:30,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-02 14:44:30,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:44:30,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:44:30,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:44:30,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-10-02 14:44:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 127 proven. 96 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 14:44:30,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:30,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25] total 56 [2019-10-02 14:44:30,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 14:44:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 14:44:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2836, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 14:44:30,662 INFO L87 Difference]: Start difference. First operand 2878 states and 4596 transitions. Second operand 56 states. [2019-10-02 14:44:35,413 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-10-02 14:44:35,675 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-10-02 14:44:40,288 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-10-02 14:44:40,589 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-02 14:44:40,853 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-02 14:44:41,156 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-10-02 14:44:43,660 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-10-02 14:44:43,838 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-02 14:44:44,023 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-02 14:44:44,208 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-10-02 14:44:44,383 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-02 14:44:44,737 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-10-02 14:44:44,941 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-10-02 14:44:49,683 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-02 14:44:50,244 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-02 14:44:52,548 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-02 14:44:53,244 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-02 14:44:53,397 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-02 14:44:53,577 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-02 14:45:04,180 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2019-10-02 14:45:08,520 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-10-02 14:45:12,941 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-02 14:45:17,294 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-10-02 14:45:21,729 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-10-02 14:45:27,913 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-02 14:45:32,563 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-10-02 14:45:47,621 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-10-02 14:45:51,747 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-10-02 14:45:58,154 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-10-02 14:46:24,179 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-10-02 14:46:28,281 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-10-02 14:46:34,580 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-10-02 14:46:40,487 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 14:46:45,412 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-10-02 14:46:49,606 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-10-02 14:46:51,731 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2019-10-02 14:46:55,844 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-02 14:47:00,751 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-02 14:47:05,026 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-10-02 14:47:09,210 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-10-02 14:47:13,394 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-10-02 14:47:17,537 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-10-02 14:47:21,681 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-02 14:47:25,798 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-10-02 14:47:29,910 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-10-02 14:47:34,220 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-10-02 14:47:38,389 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-10-02 14:47:42,516 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-10-02 14:47:46,649 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-02 14:47:50,796 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-02 14:48:07,881 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-02 14:48:11,994 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-10-02 14:48:16,457 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-10-02 14:48:16,657 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-10-02 14:48:20,808 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-02 14:48:25,188 WARN L191 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-10-02 14:48:29,507 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-10-02 14:48:33,770 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-02 14:48:37,909 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-02 14:48:43,617 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 14:48:47,748 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-10-02 14:48:53,897 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-10-02 14:48:58,029 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-10-02 14:49:02,580 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-02 14:49:06,972 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-10-02 14:49:11,184 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-10-02 14:49:15,442 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-10-02 14:49:19,629 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-10-02 14:49:27,833 WARN L191 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-10-02 14:49:31,874 WARN L191 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-10-02 14:49:36,081 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-10-02 14:49:41,063 WARN L191 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-10-02 14:49:45,185 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-02 14:49:47,262 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-10-02 14:49:51,373 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-02 14:49:53,440 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2019-10-02 14:49:57,744 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-02 14:49:59,824 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2019-10-02 14:50:03,932 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-10-02 14:50:08,213 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2019-10-02 14:50:12,426 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-10-02 14:50:16,590 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-10-02 14:50:20,747 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-10-02 14:50:24,888 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-10-02 14:50:31,674 WARN L191 SmtUtils]: Spent 6.72 s on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-10-02 14:50:35,877 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-10-02 14:50:40,535 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-10-02 14:50:44,659 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-10-02 14:50:48,831 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-10-02 14:50:52,970 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-10-02 14:50:59,127 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-02 14:51:03,267 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-10-02 14:51:05,357 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 54 [2019-10-02 14:51:09,495 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-10-02 14:51:13,631 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-10-02 14:51:15,715 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 14:51:19,851 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-02 14:51:27,975 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 14:51:34,270 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-10-02 14:51:38,441 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-10-02 14:51:42,682 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-10-02 14:51:46,836 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-10-02 14:51:51,043 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-10-02 14:51:55,209 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-02 14:51:59,435 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-10-02 14:52:02,404 WARN L191 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-10-02 14:52:06,687 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-10-02 14:52:11,034 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-02 14:52:15,359 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-10-02 14:52:18,754 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-10-02 14:52:22,937 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-10-02 14:52:27,082 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-10-02 14:52:31,235 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-10-02 14:52:35,368 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-10-02 14:52:39,528 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-10-02 14:52:43,656 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-10-02 14:52:47,799 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-10-02 14:52:52,092 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-10-02 14:52:56,280 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-10-02 14:53:00,544 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-10-02 14:53:04,766 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-10-02 14:53:11,019 WARN L191 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-10-02 14:53:13,817 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-10-02 14:53:18,065 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-10-02 14:53:32,343 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-02 14:53:36,769 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-10-02 14:53:40,908 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-10-02 14:53:47,438 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-10-02 14:54:00,284 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-10-02 14:54:07,171 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-02 14:54:11,353 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-02 14:54:11,775 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-10-02 14:54:16,054 WARN L191 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-02 14:54:24,273 WARN L191 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-02 14:54:32,435 WARN L191 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-02 14:54:37,100 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-02 14:54:41,415 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-10-02 14:54:45,664 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-10-02 14:54:49,925 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-10-02 14:54:54,087 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-10-02 14:54:58,268 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-10-02 14:55:02,462 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-10-02 14:55:06,750 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-10-02 14:55:13,527 WARN L191 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-10-02 14:55:18,152 WARN L191 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-02 14:55:24,392 WARN L191 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-02 14:55:30,526 WARN L191 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 14:55:37,243 WARN L191 SmtUtils]: Spent 6.55 s on a formula simplification. DAG size of input: 67 DAG size of output: 53