java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_03.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:41:07,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:41:07,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:41:07,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:41:07,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:41:07,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:41:07,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:41:07,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:41:07,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:41:07,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:41:07,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:41:07,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:41:07,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:41:07,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:41:07,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:41:07,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:41:07,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:41:07,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:41:07,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:41:07,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:41:07,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:41:07,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:41:07,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:41:07,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:41:07,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:41:07,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:41:07,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:41:07,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:41:07,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:41:07,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:41:07,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:41:07,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:41:07,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:41:07,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:41:07,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:41:07,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:41:07,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:41:07,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:41:07,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:41:07,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:41:07,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:41:07,801 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-01 23:41:07,825 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:41:07,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:41:07,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:41:07,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:41:07,827 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:41:07,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:41:07,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:41:07,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:41:07,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:41:07,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:41:07,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:41:07,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:41:07,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:41:07,830 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:41:07,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:41:07,830 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:41:07,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:41:07,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:41:07,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:41:07,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:41:07,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:41:07,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:41:07,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:41:07,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:41:07,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:41:07,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:41:07,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:41:07,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:41:07,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:41:07,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:41:07,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:41:07,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:41:07,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:41:07,903 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:41:07,904 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_03.i [2019-10-01 23:41:07,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87988b70/389ab95967584abd99123e58d661e599/FLAG93998f981 [2019-10-01 23:41:08,453 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:41:08,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_03.i [2019-10-01 23:41:08,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87988b70/389ab95967584abd99123e58d661e599/FLAG93998f981 [2019-10-01 23:41:08,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87988b70/389ab95967584abd99123e58d661e599 [2019-10-01 23:41:08,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:41:08,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:41:08,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:41:08,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:41:08,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:41:08,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:41:08" (1/1) ... [2019-10-01 23:41:08,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fba2a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:08, skipping insertion in model container [2019-10-01 23:41:08,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:41:08" (1/1) ... [2019-10-01 23:41:08,862 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:41:08,879 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:41:09,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:41:09,063 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:41:09,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:41:09,112 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:41:09,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09 WrapperNode [2019-10-01 23:41:09,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:41:09,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:41:09,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:41:09,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:41:09,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (1/1) ... [2019-10-01 23:41:09,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (1/1) ... [2019-10-01 23:41:09,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (1/1) ... [2019-10-01 23:41:09,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (1/1) ... [2019-10-01 23:41:09,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (1/1) ... [2019-10-01 23:41:09,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (1/1) ... [2019-10-01 23:41:09,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (1/1) ... [2019-10-01 23:41:09,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:41:09,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:41:09,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:41:09,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:41:09,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (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-01 23:41:09,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:41:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:41:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:41:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:41:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:41:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:41:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:41:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:41:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:41:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:41:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:41:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:41:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:41:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:41:09,549 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:41:09,549 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:41:09,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:41:09 BoogieIcfgContainer [2019-10-01 23:41:09,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:41:09,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:41:09,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:41:09,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:41:09,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:41:08" (1/3) ... [2019-10-01 23:41:09,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c4349f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:41:09, skipping insertion in model container [2019-10-01 23:41:09,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:41:09" (2/3) ... [2019-10-01 23:41:09,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c4349f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:41:09, skipping insertion in model container [2019-10-01 23:41:09,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:41:09" (3/3) ... [2019-10-01 23:41:09,578 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_03.i [2019-10-01 23:41:09,595 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:41:09,602 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:41:09,623 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:41:09,651 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:41:09,651 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:41:09,651 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:41:09,651 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:41:09,651 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:41:09,652 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:41:09,652 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:41:09,652 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:41:09,652 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:41:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-01 23:41:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:41:09,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:09,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:09,674 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2019-10-01 23:41:09,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:09,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:09,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:09,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:41:09,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:41:09,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:41:09,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:41:09,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:41:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:41:09,827 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-10-01 23:41:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:09,846 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-10-01 23:41:09,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:41:09,847 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 23:41:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:09,855 INFO L225 Difference]: With dead ends: 41 [2019-10-01 23:41:09,856 INFO L226 Difference]: Without dead ends: 19 [2019-10-01 23:41:09,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:41:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-01 23:41:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-01 23:41:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-01 23:41:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-01 23:41:09,899 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2019-10-01 23:41:09,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:09,900 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-01 23:41:09,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:41:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-01 23:41:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:41:09,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:09,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:09,902 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2019-10-01 23:41:09,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:09,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:09,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:09,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:09,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:41:09,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:41:09,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:41:09,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:41:09,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:41:09,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:41:09,970 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-10-01 23:41:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:10,012 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-10-01 23:41:10,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:41:10,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:41:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:10,016 INFO L225 Difference]: With dead ends: 32 [2019-10-01 23:41:10,016 INFO L226 Difference]: Without dead ends: 20 [2019-10-01 23:41:10,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:41:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-01 23:41:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-01 23:41:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-01 23:41:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-01 23:41:10,023 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2019-10-01 23:41:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:10,023 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-01 23:41:10,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:41:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-01 23:41:10,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 23:41:10,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:10,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:10,025 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:10,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:10,025 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2019-10-01 23:41:10,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:10,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:10,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:41:10,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:41:10,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:41:10,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:41:10,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:41:10,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:41:10,114 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-10-01 23:41:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:10,175 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-01 23:41:10,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:41:10,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 23:41:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:10,179 INFO L225 Difference]: With dead ends: 34 [2019-10-01 23:41:10,179 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 23:41:10,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:41:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 23:41:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-01 23:41:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-01 23:41:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-01 23:41:10,190 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-10-01 23:41:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:10,191 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-01 23:41:10,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:41:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-01 23:41:10,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 23:41:10,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:10,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:10,193 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:10,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:10,193 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2019-10-01 23:41:10,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:10,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:10,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:41:10,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:10,280 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-01 23:41:10,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:10,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:41:10,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:41:10,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:10,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-01 23:41:10,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:41:10,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:41:10,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:41:10,398 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-10-01 23:41:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:10,514 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-10-01 23:41:10,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:41:10,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-01 23:41:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:10,516 INFO L225 Difference]: With dead ends: 43 [2019-10-01 23:41:10,518 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 23:41:10,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:41:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 23:41:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-01 23:41:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 23:41:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-01 23:41:10,529 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-01 23:41:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:10,529 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-01 23:41:10,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:41:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-01 23:41:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:41:10,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:10,532 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:10,533 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1897825622, now seen corresponding path program 2 times [2019-10-01 23:41:10,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:10,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:10,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:10,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 23:41:10,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:10,641 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-01 23:41:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:41:10,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:41:10,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:10,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:41:10,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 23:41:10,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:10,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-10-01 23:41:10,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:41:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:41:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:41:10,754 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 9 states. [2019-10-01 23:41:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:10,863 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-10-01 23:41:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:41:10,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-01 23:41:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:10,865 INFO L225 Difference]: With dead ends: 51 [2019-10-01 23:41:10,865 INFO L226 Difference]: Without dead ends: 37 [2019-10-01 23:41:10,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:41:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-01 23:41:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-10-01 23:41:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:41:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-01 23:41:10,876 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2019-10-01 23:41:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:10,891 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-01 23:41:10,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:41:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-01 23:41:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 23:41:10,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:10,893 INFO L411 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:10,894 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:10,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1456795255, now seen corresponding path program 3 times [2019-10-01 23:41:10,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:10,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:10,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:10,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:41:11,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:11,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:11,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:41:11,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:41:11,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:11,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:41:11,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:41:11,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:11,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:41:11,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:41:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:41:11,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:41:11,082 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-10-01 23:41:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:11,166 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-10-01 23:41:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:41:11,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-01 23:41:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:11,168 INFO L225 Difference]: With dead ends: 51 [2019-10-01 23:41:11,168 INFO L226 Difference]: Without dead ends: 41 [2019-10-01 23:41:11,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:41:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-01 23:41:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-10-01 23:41:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:41:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-01 23:41:11,179 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-10-01 23:41:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:11,180 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-01 23:41:11,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:41:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-01 23:41:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:41:11,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:11,184 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:11,184 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:11,185 INFO L82 PathProgramCache]: Analyzing trace with hash -33873434, now seen corresponding path program 4 times [2019-10-01 23:41:11,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:11,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:11,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 23:41:11,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:11,308 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:41:11,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:41:11,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:11,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:41:11,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:41:11,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:11,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2019-10-01 23:41:11,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:41:11,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:41:11,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:41:11,424 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 13 states. [2019-10-01 23:41:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:11,579 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2019-10-01 23:41:11,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:41:11,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-10-01 23:41:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:11,581 INFO L225 Difference]: With dead ends: 65 [2019-10-01 23:41:11,581 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 23:41:11,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:41:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 23:41:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2019-10-01 23:41:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 23:41:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-01 23:41:11,597 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 25 [2019-10-01 23:41:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:11,598 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-01 23:41:11,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:41:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-01 23:41:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-01 23:41:11,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:11,599 INFO L411 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:11,600 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1963168809, now seen corresponding path program 5 times [2019-10-01 23:41:11,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:11,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:11,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:11,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:11,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:41:11,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:11,752 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-01 23:41:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:12,035 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 23:41:12,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:12,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:41:12,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:41:12,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:12,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:41:12,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:41:12,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:41:12,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:41:12,065 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2019-10-01 23:41:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:12,165 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-10-01 23:41:12,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:41:12,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-10-01 23:41:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:12,168 INFO L225 Difference]: With dead ends: 63 [2019-10-01 23:41:12,168 INFO L226 Difference]: Without dead ends: 53 [2019-10-01 23:41:12,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:41:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-01 23:41:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-10-01 23:41:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 23:41:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-01 23:41:12,176 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-10-01 23:41:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:12,177 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-01 23:41:12,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:41:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-01 23:41:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 23:41:12,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:12,178 INFO L411 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:12,179 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:12,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1389169850, now seen corresponding path program 6 times [2019-10-01 23:41:12,179 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:12,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:12,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:12,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:12,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:41:12,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:12,294 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) [2019-10-01 23:41:12,321 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:12,472 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-01 23:41:12,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:12,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:41:12,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:41:12,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:12,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:41:12,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:41:12,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:41:12,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:41:12,509 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 10 states. [2019-10-01 23:41:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:12,620 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-10-01 23:41:12,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:41:12,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-10-01 23:41:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:12,622 INFO L225 Difference]: With dead ends: 67 [2019-10-01 23:41:12,623 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 23:41:12,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:41:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 23:41:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-10-01 23:41:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 23:41:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-01 23:41:12,634 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2019-10-01 23:41:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:12,635 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-01 23:41:12,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:41:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-01 23:41:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 23:41:12,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:12,637 INFO L411 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:12,637 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2062514121, now seen corresponding path program 7 times [2019-10-01 23:41:12,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:12,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:12,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:12,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:41:12,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:12,770 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-01 23:41:12,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:12,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:41:12,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 23:41:12,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:12,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 18 [2019-10-01 23:41:12,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:41:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:41:12,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:41:12,913 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 18 states. [2019-10-01 23:41:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:13,064 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2019-10-01 23:41:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:41:13,065 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-10-01 23:41:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:13,066 INFO L225 Difference]: With dead ends: 85 [2019-10-01 23:41:13,066 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 23:41:13,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:41:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 23:41:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2019-10-01 23:41:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 23:41:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-01 23:41:13,082 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2019-10-01 23:41:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:13,083 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-01 23:41:13,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:41:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-01 23:41:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 23:41:13,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:13,084 INFO L411 BasicCegarLoop]: trace histogram [15, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:13,085 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 937962954, now seen corresponding path program 8 times [2019-10-01 23:41:13,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:13,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:13,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 23:41:13,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:13,207 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-01 23:41:13,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:41:13,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:41:13,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:13,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:41:13,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 23:41:13,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:13,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 23 [2019-10-01 23:41:13,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:41:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:41:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:41:13,403 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 23 states. [2019-10-01 23:41:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:13,598 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2019-10-01 23:41:13,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:41:13,599 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2019-10-01 23:41:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:13,600 INFO L225 Difference]: With dead ends: 95 [2019-10-01 23:41:13,600 INFO L226 Difference]: Without dead ends: 75 [2019-10-01 23:41:13,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:41:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-01 23:41:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 48. [2019-10-01 23:41:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-01 23:41:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-10-01 23:41:13,609 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 38 [2019-10-01 23:41:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:13,609 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-10-01 23:41:13,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:41:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-10-01 23:41:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 23:41:13,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:13,610 INFO L411 BasicCegarLoop]: trace histogram [20, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:13,611 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2101408535, now seen corresponding path program 9 times [2019-10-01 23:41:13,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:13,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:13,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:41:13,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:13,739 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-01 23:41:13,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:41:14,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:41:14,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:14,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:41:14,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:41:14,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:14,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:41:14,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:41:14,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:41:14,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:41:14,357 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2019-10-01 23:41:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:14,497 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-10-01 23:41:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:41:14,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-10-01 23:41:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:14,499 INFO L225 Difference]: With dead ends: 89 [2019-10-01 23:41:14,499 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 23:41:14,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:41:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 23:41:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2019-10-01 23:41:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 23:41:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-10-01 23:41:14,508 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-10-01 23:41:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:14,509 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-10-01 23:41:14,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:41:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-10-01 23:41:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 23:41:14,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:14,510 INFO L411 BasicCegarLoop]: trace histogram [20, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:14,510 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1457951366, now seen corresponding path program 10 times [2019-10-01 23:41:14,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:14,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:14,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:14,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:41:14,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:14,629 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-01 23:41:14,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:41:14,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:41:14,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:14,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:41:14,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 23:41:14,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:14,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 28 [2019-10-01 23:41:14,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:41:14,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:41:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:41:14,870 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 28 states. [2019-10-01 23:41:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:15,125 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2019-10-01 23:41:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:41:15,129 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-10-01 23:41:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:15,130 INFO L225 Difference]: With dead ends: 110 [2019-10-01 23:41:15,130 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 23:41:15,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=377, Invalid=379, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:41:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 23:41:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 55. [2019-10-01 23:41:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 23:41:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-10-01 23:41:15,141 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 45 [2019-10-01 23:41:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:15,141 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-10-01 23:41:15,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:41:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-10-01 23:41:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 23:41:15,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:15,142 INFO L411 BasicCegarLoop]: trace histogram [25, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:15,143 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:15,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2048897253, now seen corresponding path program 11 times [2019-10-01 23:41:15,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:15,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:15,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:15,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:41:15,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:15,368 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) [2019-10-01 23:41:15,392 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:33,090 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-10-01 23:41:33,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:33,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:41:33,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:41:33,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:33,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:41:33,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:41:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:41:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:41:33,136 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 15 states. [2019-10-01 23:41:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:33,296 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2019-10-01 23:41:33,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:41:33,296 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-10-01 23:41:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:33,298 INFO L225 Difference]: With dead ends: 102 [2019-10-01 23:41:33,298 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 23:41:33,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:41:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 23:41:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-10-01 23:41:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 23:41:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-10-01 23:41:33,308 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-10-01 23:41:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:33,308 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-10-01 23:41:33,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:41:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-10-01 23:41:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-01 23:41:33,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:33,310 INFO L411 BasicCegarLoop]: trace histogram [25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:33,310 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:33,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1268411914, now seen corresponding path program 12 times [2019-10-01 23:41:33,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:33,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:33,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:33,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:41:33,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:33,465 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) [2019-10-01 23:41:33,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:41:58,231 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:41:58,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:58,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:41:58,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:41:58,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:58,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:41:58,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:41:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:41:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:41:58,281 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 16 states. [2019-10-01 23:41:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:58,441 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-10-01 23:41:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:41:58,443 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-10-01 23:41:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:58,444 INFO L225 Difference]: With dead ends: 106 [2019-10-01 23:41:58,445 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 23:41:58,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:41:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 23:41:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2019-10-01 23:41:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-01 23:41:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-10-01 23:41:58,466 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 52 [2019-10-01 23:41:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:58,467 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-10-01 23:41:58,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:41:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-10-01 23:41:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 23:41:58,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:58,468 INFO L411 BasicCegarLoop]: trace histogram [25, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:58,468 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:58,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1451797115, now seen corresponding path program 13 times [2019-10-01 23:41:58,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:58,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:58,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:41:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:41:58,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:58,691 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-01 23:41:58,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:58,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:41:58,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-01 23:41:58,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:58,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 28] total 34 [2019-10-01 23:41:58,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:41:58,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:41:58,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=562, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:41:58,972 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 34 states. [2019-10-01 23:41:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:41:59,198 INFO L93 Difference]: Finished difference Result 131 states and 155 transitions. [2019-10-01 23:41:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:41:59,199 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2019-10-01 23:41:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:41:59,201 INFO L225 Difference]: With dead ends: 131 [2019-10-01 23:41:59,201 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 23:41:59,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=560, Invalid=562, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:41:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 23:41:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2019-10-01 23:41:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-01 23:41:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-01 23:41:59,209 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 53 [2019-10-01 23:41:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:41:59,210 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-01 23:41:59,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:41:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-01 23:41:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-01 23:41:59,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:41:59,211 INFO L411 BasicCegarLoop]: trace histogram [31, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:41:59,211 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:41:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:41:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1619066858, now seen corresponding path program 14 times [2019-10-01 23:41:59,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:41:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:41:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:59,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:41:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:41:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:41:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-01 23:41:59,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:41:59,404 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-01 23:41:59,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:41:59,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:41:59,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:41:59,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:41:59,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:41:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 23:41:59,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:41:59,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 34] total 39 [2019-10-01 23:41:59,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:41:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:41:59,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:41:59,724 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 39 states. [2019-10-01 23:42:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:00,007 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2019-10-01 23:42:00,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 23:42:00,008 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 60 [2019-10-01 23:42:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:00,010 INFO L225 Difference]: With dead ends: 141 [2019-10-01 23:42:00,010 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 23:42:00,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:42:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 23:42:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 70. [2019-10-01 23:42:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 23:42:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-10-01 23:42:00,019 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 60 [2019-10-01 23:42:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:00,019 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-10-01 23:42:00,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:42:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-10-01 23:42:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-01 23:42:00,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:00,020 INFO L411 BasicCegarLoop]: trace histogram [36, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:00,021 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2088711223, now seen corresponding path program 15 times [2019-10-01 23:42:00,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:00,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:00,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:42:00,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:00,223 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-01 23:42:00,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:42:12,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:42:12,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:12,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:42:12,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:42:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:42:12,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:42:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:42:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:42:12,326 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2019-10-01 23:42:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:12,536 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2019-10-01 23:42:12,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:42:12,539 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-10-01 23:42:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:12,540 INFO L225 Difference]: With dead ends: 129 [2019-10-01 23:42:12,541 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 23:42:12,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:42:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 23:42:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 71. [2019-10-01 23:42:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 23:42:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-10-01 23:42:12,549 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2019-10-01 23:42:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:12,550 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-10-01 23:42:12,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:42:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-10-01 23:42:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 23:42:12,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:12,551 INFO L411 BasicCegarLoop]: trace histogram [36, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:12,551 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:12,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1851568038, now seen corresponding path program 16 times [2019-10-01 23:42:12,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:12,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:12,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:12,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:12,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:42:12,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:12,780 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-01 23:42:12,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:42:12,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:42:12,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:42:12,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:42:12,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:42:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 23:42:13,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:42:13,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 39] total 45 [2019-10-01 23:42:13,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 23:42:13,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 23:42:13,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=991, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:42:13,243 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 45 states. [2019-10-01 23:42:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:42:13,634 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2019-10-01 23:42:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 23:42:13,635 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 67 [2019-10-01 23:42:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:42:13,636 INFO L225 Difference]: With dead ends: 157 [2019-10-01 23:42:13,637 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 23:42:13,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=989, Invalid=991, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:42:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 23:42:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 78. [2019-10-01 23:42:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 23:42:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-01 23:42:13,646 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 67 [2019-10-01 23:42:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:42:13,646 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-01 23:42:13,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 23:42:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-01 23:42:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 23:42:13,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:42:13,647 INFO L411 BasicCegarLoop]: trace histogram [42, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:42:13,648 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:42:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:42:13,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1955034647, now seen corresponding path program 17 times [2019-10-01 23:42:13,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:42:13,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:42:13,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:13,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:42:13,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:42:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:42:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-01 23:42:13,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:42:13,876 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-01 23:42:13,921 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:43:24,392 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-10-01 23:43:24,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:43:24,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:43:24,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:43:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-01 23:43:24,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:43:24,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:43:24,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:43:24,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:43:24,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:43:24,463 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 21 states. [2019-10-01 23:43:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:43:24,694 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2019-10-01 23:43:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:43:24,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-10-01 23:43:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:43:24,696 INFO L225 Difference]: With dead ends: 143 [2019-10-01 23:43:24,696 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 23:43:24,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:43:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 23:43:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 79. [2019-10-01 23:43:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:43:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-10-01 23:43:24,704 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2019-10-01 23:43:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:43:24,705 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-10-01 23:43:24,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:43:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-10-01 23:43:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 23:43:24,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:43:24,706 INFO L411 BasicCegarLoop]: trace histogram [42, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:43:24,706 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:43:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:43:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1700574598, now seen corresponding path program 18 times [2019-10-01 23:43:24,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:43:24,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:43:24,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:24,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:43:24,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:43:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:43:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-01 23:43:24,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:43:24,975 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-01 23:43:25,001 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:44:56,648 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:44:56,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:56,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:44:56,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-01 23:44:56,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:56,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:44:56,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:44:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:44:56,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:44:56,727 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 22 states. [2019-10-01 23:44:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:56,979 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2019-10-01 23:44:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:44:56,981 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2019-10-01 23:44:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:56,983 INFO L225 Difference]: With dead ends: 147 [2019-10-01 23:44:56,983 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 23:44:56,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:44:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 23:44:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 80. [2019-10-01 23:44:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-01 23:44:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-10-01 23:44:56,990 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 75 [2019-10-01 23:44:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:56,991 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-10-01 23:44:56,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:44:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-10-01 23:44:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 23:44:56,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:56,992 INFO L411 BasicCegarLoop]: trace histogram [42, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:56,992 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:56,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:56,992 INFO L82 PathProgramCache]: Analyzing trace with hash -939655799, now seen corresponding path program 19 times [2019-10-01 23:44:56,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:56,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:56,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:56,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:56,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-01 23:44:57,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:57,297 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-01 23:44:57,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:57,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:44:57,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-01 23:44:57,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:57,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 45] total 52 [2019-10-01 23:44:57,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 23:44:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 23:44:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=1327, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 23:44:57,840 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 52 states. [2019-10-01 23:44:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:58,335 INFO L93 Difference]: Finished difference Result 179 states and 210 transitions. [2019-10-01 23:44:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 23:44:58,340 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 76 [2019-10-01 23:44:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:58,341 INFO L225 Difference]: With dead ends: 179 [2019-10-01 23:44:58,341 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 23:44:58,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1325, Invalid=1327, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 23:44:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 23:44:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 88. [2019-10-01 23:44:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 23:44:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-10-01 23:44:58,356 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 76 [2019-10-01 23:44:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:58,356 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-10-01 23:44:58,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 23:44:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-10-01 23:44:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 23:44:58,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:58,358 INFO L411 BasicCegarLoop]: trace histogram [49, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:58,358 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2109741686, now seen corresponding path program 20 times [2019-10-01 23:44:58,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:58,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:58,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:44:58,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:44:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-10-01 23:44:58,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:44:58,716 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-01 23:44:58,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:44:58,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:44:58,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:44:58,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 23:44:58,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:44:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 23:44:59,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:44:59,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 52] total 57 [2019-10-01 23:44:59,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 23:44:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 23:44:59,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:44:59,259 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 57 states. [2019-10-01 23:44:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:44:59,772 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2019-10-01 23:44:59,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 23:44:59,773 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 84 [2019-10-01 23:44:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:44:59,774 INFO L225 Difference]: With dead ends: 189 [2019-10-01 23:44:59,774 INFO L226 Difference]: Without dead ends: 157 [2019-10-01 23:44:59,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 23:44:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-01 23:44:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 94. [2019-10-01 23:44:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-01 23:44:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-01 23:44:59,782 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 84 [2019-10-01 23:44:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:44:59,783 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-01 23:44:59,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 23:44:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-01 23:44:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-01 23:44:59,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:44:59,784 INFO L411 BasicCegarLoop]: trace histogram [54, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:44:59,784 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:44:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:44:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1724214825, now seen corresponding path program 21 times [2019-10-01 23:44:59,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:44:59,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:44:59,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:59,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:44:59,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:44:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-10-01 23:45:00,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:00,109 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-01 23:45:00,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:45:45,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:45:45,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:45,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:45:45,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-10-01 23:45:45,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:45,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:45:45,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:45:45,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:45:45,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:45:45,584 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2019-10-01 23:45:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:45,919 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2019-10-01 23:45:45,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:45:45,919 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2019-10-01 23:45:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:45,921 INFO L225 Difference]: With dead ends: 171 [2019-10-01 23:45:45,921 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 23:45:45,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:45:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 23:45:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 95. [2019-10-01 23:45:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 23:45:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-10-01 23:45:45,931 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 90 [2019-10-01 23:45:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:45,931 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2019-10-01 23:45:45,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:45:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2019-10-01 23:45:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 23:45:45,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:45,933 INFO L411 BasicCegarLoop]: trace histogram [54, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:45,933 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:45,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash -206808762, now seen corresponding path program 22 times [2019-10-01 23:45:45,934 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:45,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:45,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:45,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-10-01 23:45:46,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:46,348 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-01 23:45:46,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:45:46,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:45:46,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:45:46,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 23:45:46,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:45:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1738 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 23:45:47,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:45:47,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 57] total 63 [2019-10-01 23:45:47,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-01 23:45:47,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-01 23:45:47,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=1954, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:45:47,167 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 63 states. [2019-10-01 23:45:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:45:47,677 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2019-10-01 23:45:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-01 23:45:47,678 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 91 [2019-10-01 23:45:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:45:47,679 INFO L225 Difference]: With dead ends: 205 [2019-10-01 23:45:47,679 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 23:45:47,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1952, Invalid=1954, Unknown=0, NotChecked=0, Total=3906 [2019-10-01 23:45:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 23:45:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 102. [2019-10-01 23:45:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 23:45:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-10-01 23:45:47,688 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 91 [2019-10-01 23:45:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:45:47,689 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-10-01 23:45:47,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-01 23:45:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-10-01 23:45:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 23:45:47,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:45:47,690 INFO L411 BasicCegarLoop]: trace histogram [60, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:45:47,690 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:45:47,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:45:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash 991859785, now seen corresponding path program 23 times [2019-10-01 23:45:47,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:45:47,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:45:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:47,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:45:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:45:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:45:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-10-01 23:45:48,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:45:48,125 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-01 23:45:48,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:47:30,102 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-10-01 23:47:30,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:47:30,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-01 23:47:30,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:47:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 23:47:30,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:47:30,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 63] total 68 [2019-10-01 23:47:30,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 23:47:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 23:47:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2277, Invalid=2279, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:47:30,625 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 68 states. [2019-10-01 23:47:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:47:31,214 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2019-10-01 23:47:31,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-01 23:47:31,215 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 98 [2019-10-01 23:47:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:47:31,217 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:47:31,217 INFO L226 Difference]: Without dead ends: 180 [2019-10-01 23:47:31,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2761 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2277, Invalid=2279, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 23:47:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-01 23:47:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2019-10-01 23:47:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-01 23:47:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-10-01 23:47:31,226 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 98 [2019-10-01 23:47:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:47:31,226 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-10-01 23:47:31,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 23:47:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-10-01 23:47:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-01 23:47:31,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:47:31,228 INFO L411 BasicCegarLoop]: trace histogram [65, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:47:31,228 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:47:31,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:47:31,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2013296566, now seen corresponding path program 24 times [2019-10-01 23:47:31,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:47:31,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:47:31,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:31,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:47:31,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:47:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:47:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-10-01 23:47:31,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:47:31,622 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-01 23:47:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:50:06,630 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:50:06,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:50:06,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:50:06,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-10-01 23:50:06,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:06,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:50:06,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:50:06,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:50:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:50:06,729 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 28 states. [2019-10-01 23:50:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:07,161 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2019-10-01 23:50:07,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:50:07,161 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2019-10-01 23:50:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:07,163 INFO L225 Difference]: With dead ends: 194 [2019-10-01 23:50:07,164 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 23:50:07,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:50:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 23:50:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 109. [2019-10-01 23:50:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-01 23:50:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-10-01 23:50:07,172 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 104 [2019-10-01 23:50:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:07,173 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-10-01 23:50:07,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:50:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-10-01 23:50:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-01 23:50:07,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:07,174 INFO L411 BasicCegarLoop]: trace histogram [65, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:07,174 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:07,175 INFO L82 PathProgramCache]: Analyzing trace with hash -105544891, now seen corresponding path program 25 times [2019-10-01 23:50:07,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:07,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:07,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:07,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:50:07,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-10-01 23:50:07,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:07,710 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-01 23:50:07,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:50:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:07,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-01 23:50:07,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:50:08,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:08,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 68] total 73 [2019-10-01 23:50:08,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 23:50:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 23:50:08,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2627, Invalid=2629, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 23:50:08,716 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 73 states. [2019-10-01 23:50:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:09,372 INFO L93 Difference]: Finished difference Result 230 states and 265 transitions. [2019-10-01 23:50:09,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 23:50:09,373 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 105 [2019-10-01 23:50:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:09,378 INFO L225 Difference]: With dead ends: 230 [2019-10-01 23:50:09,378 INFO L226 Difference]: Without dead ends: 193 [2019-10-01 23:50:09,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3207 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2627, Invalid=2629, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 23:50:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-01 23:50:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 115. [2019-10-01 23:50:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 23:50:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-10-01 23:50:09,388 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 105 [2019-10-01 23:50:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:09,388 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-10-01 23:50:09,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 23:50:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-10-01 23:50:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-01 23:50:09,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:09,390 INFO L411 BasicCegarLoop]: trace histogram [70, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:09,390 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash 292324870, now seen corresponding path program 26 times [2019-10-01 23:50:09,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:09,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:09,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:50:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2836 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-10-01 23:50:09,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:09,875 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-01 23:50:09,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:50:10,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:50:10,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:50:10,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-01 23:50:10,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:50:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2836 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:50:10,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:50:10,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 73] total 77 [2019-10-01 23:50:10,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 23:50:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 23:50:10,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:50:10,675 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 77 states. [2019-10-01 23:50:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:50:11,377 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2019-10-01 23:50:11,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 23:50:11,378 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 111 [2019-10-01 23:50:11,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:50:11,380 INFO L225 Difference]: With dead ends: 239 [2019-10-01 23:50:11,380 INFO L226 Difference]: Without dead ends: 201 [2019-10-01 23:50:11,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3589 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2925, Invalid=2927, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 23:50:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-01 23:50:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 120. [2019-10-01 23:50:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-01 23:50:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-10-01 23:50:11,390 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 111 [2019-10-01 23:50:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:50:11,391 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-10-01 23:50:11,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 23:50:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-10-01 23:50:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-01 23:50:11,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:50:11,392 INFO L411 BasicCegarLoop]: trace histogram [74, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:50:11,392 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:50:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:50:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1145271305, now seen corresponding path program 27 times [2019-10-01 23:50:11,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:50:11,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:50:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:11,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:50:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:50:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:50:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3153 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:50:11,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:50:11,996 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-01 23:50:12,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:51:36,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:51:36,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:36,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:51:36,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3153 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:51:36,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:36,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:51:36,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:51:36,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:51:36,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:51:36,379 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 31 states. [2019-10-01 23:51:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:36,829 INFO L93 Difference]: Finished difference Result 215 states and 246 transitions. [2019-10-01 23:51:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:51:36,829 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-10-01 23:51:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:36,831 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:51:36,831 INFO L226 Difference]: Without dead ends: 205 [2019-10-01 23:51:36,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:51:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-01 23:51:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 121. [2019-10-01 23:51:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 23:51:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2019-10-01 23:51:36,839 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 116 [2019-10-01 23:51:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:36,840 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2019-10-01 23:51:36,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:51:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2019-10-01 23:51:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:51:36,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:36,841 INFO L411 BasicCegarLoop]: trace histogram [74, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:36,842 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:36,842 INFO L82 PathProgramCache]: Analyzing trace with hash -974188698, now seen corresponding path program 28 times [2019-10-01 23:51:36,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:36,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:36,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:36,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:36,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3181 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-10-01 23:51:37,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:37,401 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-01 23:51:37,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:51:37,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:51:37,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:51:37,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-01 23:51:37,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:51:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3181 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-10-01 23:51:38,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:51:38,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 77] total 82 [2019-10-01 23:51:38,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 23:51:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 23:51:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3320, Invalid=3322, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 23:51:38,323 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 82 states. [2019-10-01 23:51:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:51:39,124 INFO L93 Difference]: Finished difference Result 254 states and 292 transitions. [2019-10-01 23:51:39,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 23:51:39,125 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 117 [2019-10-01 23:51:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:51:39,126 INFO L225 Difference]: With dead ends: 254 [2019-10-01 23:51:39,126 INFO L226 Difference]: Without dead ends: 214 [2019-10-01 23:51:39,128 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3320, Invalid=3322, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 23:51:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-01 23:51:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 127. [2019-10-01 23:51:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 23:51:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2019-10-01 23:51:39,136 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 117 [2019-10-01 23:51:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:51:39,136 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2019-10-01 23:51:39,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 23:51:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2019-10-01 23:51:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 23:51:39,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:51:39,137 INFO L411 BasicCegarLoop]: trace histogram [79, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:51:39,138 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:51:39,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:51:39,138 INFO L82 PathProgramCache]: Analyzing trace with hash -973220859, now seen corresponding path program 29 times [2019-10-01 23:51:39,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:51:39,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:51:39,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:39,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:51:39,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:51:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:51:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3595 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-10-01 23:51:39,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:51:39,832 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-01 23:51:39,916 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:54:21,951 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 23:54:21,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:54:21,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-01 23:54:21,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:54:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3595 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-01 23:54:22,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:54:22,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 82] total 86 [2019-10-01 23:54:22,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 23:54:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 23:54:22,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3654, Invalid=3656, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 23:54:22,886 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 86 states. [2019-10-01 23:54:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:54:23,687 INFO L93 Difference]: Finished difference Result 263 states and 301 transitions. [2019-10-01 23:54:23,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-01 23:54:23,688 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 123 [2019-10-01 23:54:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:54:23,689 INFO L225 Difference]: With dead ends: 263 [2019-10-01 23:54:23,689 INFO L226 Difference]: Without dead ends: 222 [2019-10-01 23:54:23,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4525 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3654, Invalid=3656, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 23:54:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-01 23:54:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 132. [2019-10-01 23:54:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-01 23:54:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2019-10-01 23:54:23,701 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 123 [2019-10-01 23:54:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:54:23,701 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2019-10-01 23:54:23,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 23:54:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2019-10-01 23:54:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-01 23:54:23,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:54:23,703 INFO L411 BasicCegarLoop]: trace histogram [83, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:54:23,703 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:54:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:54:23,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1748933142, now seen corresponding path program 30 times [2019-10-01 23:54:23,703 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:54:23,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:54:23,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:23,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:54:23,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:54:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:54:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-10-01 23:54:24,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:54:24,344 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-01 23:54:24,405 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE