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/loops/count_up_down-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:29:07,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:29:07,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:29:07,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:29:07,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:29:07,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:29:07,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:29:07,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:29:07,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:29:07,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:29:07,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:29:07,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:29:07,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:29:07,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:29:07,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:29:07,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:29:07,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:29:07,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:29:07,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:29:07,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:29:07,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:29:07,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:29:07,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:29:07,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:29:07,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:29:07,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:29:07,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:29:07,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:29:07,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:29:07,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:29:07,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:29:07,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:29:07,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:29:07,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:29:07,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:29:07,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:29:07,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:29:07,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:29:07,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:29:07,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:29:07,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:29:07,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:29:07,178 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:29:07,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:29:07,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:29:07,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:29:07,184 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:29:07,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:29:07,184 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:29:07,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:29:07,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:29:07,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:29:07,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:29:07,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:29:07,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:29:07,186 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:29:07,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:29:07,187 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:29:07,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:29:07,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:29:07,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:29:07,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:29:07,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:29:07,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:07,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:29:07,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:29:07,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:29:07,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:29:07,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:29:07,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:29:07,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:29:07,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:29:07,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:29:07,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:29:07,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:29:07,240 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:29:07,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down-1.c [2019-09-05 11:29:07,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee938adaf/5bfc4bee9bd84416b5b0226165414292/FLAG14848f367 [2019-09-05 11:29:07,796 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:29:07,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c [2019-09-05 11:29:07,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee938adaf/5bfc4bee9bd84416b5b0226165414292/FLAG14848f367 [2019-09-05 11:29:08,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee938adaf/5bfc4bee9bd84416b5b0226165414292 [2019-09-05 11:29:08,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:29:08,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:29:08,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:08,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:29:08,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:29:08,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6390ccb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,209 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:29:08,222 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:29:08,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:08,419 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:29:08,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:08,448 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:29:08,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08 WrapperNode [2019-09-05 11:29:08,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:08,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:29:08,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:29:08,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:29:08,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:29:08,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:29:08,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:29:08,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:29:08,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:08,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:29:08,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:29:08,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:29:08,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:29:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:29:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:29:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:29:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:29:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:29:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:29:08,800 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:29:08,800 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:29:08,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:08 BoogieIcfgContainer [2019-09-05 11:29:08,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:29:08,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:29:08,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:29:08,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:29:08,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:29:08" (1/3) ... [2019-09-05 11:29:08,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518449f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (2/3) ... [2019-09-05 11:29:08,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518449f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:08" (3/3) ... [2019-09-05 11:29:08,810 INFO L109 eAbstractionObserver]: Analyzing ICFG count_up_down-1.c [2019-09-05 11:29:08,820 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:29:08,826 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:29:08,841 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:29:08,869 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:29:08,870 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:29:08,870 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:29:08,870 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:29:08,870 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:29:08,870 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:29:08,871 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:29:08,871 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:29:08,871 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:29:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-05 11:29:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:29:08,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:08,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:08,893 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-05 11:29:08,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:08,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:08,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,238 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-09-05 11:29:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:09,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:09,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:29:09,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:29:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:29:09,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:09,459 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2019-09-05 11:29:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,628 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-09-05 11:29:09,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:29:09,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-09-05 11:29:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,640 INFO L225 Difference]: With dead ends: 36 [2019-09-05 11:29:09,640 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 11:29:09,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 11:29:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 11:29:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 11:29:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-05 11:29:09,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-05 11:29:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,691 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-05 11:29:09,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:29:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-05 11:29:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 11:29:09,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:09,693 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-05 11:29:09,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:10,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:10,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:10,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,094 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 11:29:10,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:10,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:10,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:10,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-05 11:29:10,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:29:10,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:29:10,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:10,269 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-09-05 11:29:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,416 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-05 11:29:10,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:29:10,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-09-05 11:29:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,419 INFO L225 Difference]: With dead ends: 20 [2019-09-05 11:29:10,419 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 11:29:10,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 11:29:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 11:29:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 11:29:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-05 11:29:10,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-09-05 11:29:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,429 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-05 11:29:10,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:29:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-05 11:29:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:29:10,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,432 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:10,434 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 2 times [2019-09-05 11:29:10,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,715 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2019-09-05 11:29:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:10,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:10,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:10,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:10,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:10,874 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:29:10,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:10,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:11,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:11,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-05 11:29:11,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:29:11,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:29:11,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:11,042 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-09-05 11:29:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:11,239 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-05 11:29:11,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:29:11,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-09-05 11:29:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:11,241 INFO L225 Difference]: With dead ends: 20 [2019-09-05 11:29:11,241 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 11:29:11,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:29:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 11:29:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 11:29:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 11:29:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-05 11:29:11,252 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-05 11:29:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:11,252 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-05 11:29:11,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:29:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-05 11:29:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:29:11,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:11,254 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:11,254 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 3 times [2019-09-05 11:29:11,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:11,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,594 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-09-05 11:29:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:11,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:11,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:11,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:11,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:29:11,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:11,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:29:11,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:11,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:11,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:11,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-09-05 11:29:11,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:29:11,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:29:11,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:29:11,914 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-09-05 11:29:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:12,065 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-05 11:29:12,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:29:12,065 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-09-05 11:29:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:12,066 INFO L225 Difference]: With dead ends: 21 [2019-09-05 11:29:12,066 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 11:29:12,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:29:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 11:29:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 11:29:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 11:29:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-05 11:29:12,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-05 11:29:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:12,072 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-05 11:29:12,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:29:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-05 11:29:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:29:12,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:12,073 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:12,074 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:12,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:12,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 4 times [2019-09-05 11:29:12,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:12,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:12,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:12,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:12,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:12,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:12,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:12,700 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:29:12,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:14,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:14,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:14,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-05 11:29:14,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:29:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:29:14,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:29:14,910 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-09-05 11:29:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:16,806 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-05 11:29:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:29:16,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-09-05 11:29:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:16,808 INFO L225 Difference]: With dead ends: 22 [2019-09-05 11:29:16,809 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 11:29:16,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:29:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 11:29:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 11:29:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:29:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-05 11:29:16,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-05 11:29:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:16,815 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-05 11:29:16,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:29:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-05 11:29:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:29:16,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:16,816 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:16,816 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 5 times [2019-09-05 11:29:16,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:16,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:16,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,163 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-09-05 11:29:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:17,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:17,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:17,288 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:29:17,332 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:29:17,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:17,340 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 11:29:17,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:17,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:17,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:17,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-05 11:29:17,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:29:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:29:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:29:17,640 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 21 states. [2019-09-05 11:29:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:17,863 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-05 11:29:17,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:29:17,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 16 [2019-09-05 11:29:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:17,864 INFO L225 Difference]: With dead ends: 23 [2019-09-05 11:29:17,864 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:29:17,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:29:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:29:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 11:29:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 11:29:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-05 11:29:17,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-05 11:29:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:17,870 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-05 11:29:17,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:29:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-05 11:29:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:29:17,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:17,871 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:17,871 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 6 times [2019-09-05 11:29:17,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:18,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:18,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:18,267 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:29:30,366 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-05 11:29:30,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:29:30,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:29:30,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-09-05 11:29:30,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:29:30,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:29:30,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:30,401 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 13 states. [2019-09-05 11:29:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:30,539 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-05 11:29:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:29:30,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-09-05 11:29:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:30,544 INFO L225 Difference]: With dead ends: 24 [2019-09-05 11:29:30,544 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 11:29:30,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:29:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 11:29:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 11:29:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 11:29:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-05 11:29:30,549 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-05 11:29:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:30,549 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-05 11:29:30,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:29:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-05 11:29:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:29:30,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:30,550 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:30,550 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:30,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 7 times [2019-09-05 11:29:30,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:30,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:30,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:30,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:30,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:30,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:30,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:31,124 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 11:29:31,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:31,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:31,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:31,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-09-05 11:29:31,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:29:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:29:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:29:31,515 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 25 states. [2019-09-05 11:29:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:31,692 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-05 11:29:31,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:29:31,693 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-09-05 11:29:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:31,694 INFO L225 Difference]: With dead ends: 25 [2019-09-05 11:29:31,694 INFO L226 Difference]: Without dead ends: 20 [2019-09-05 11:29:31,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:29:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-05 11:29:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-05 11:29:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 11:29:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-05 11:29:31,699 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-05 11:29:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:31,699 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-05 11:29:31,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:29:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-05 11:29:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:29:31,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:31,700 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:31,701 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:31,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 8 times [2019-09-05 11:29:31,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:31,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:31,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:31,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:31,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:32,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:32,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:32,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:32,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:32,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:32,321 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:29:32,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:32,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:32,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:32,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2019-09-05 11:29:32,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:29:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:29:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:29:32,503 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-09-05 11:29:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:32,684 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-05 11:29:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:29:32,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-09-05 11:29:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:32,685 INFO L225 Difference]: With dead ends: 26 [2019-09-05 11:29:32,685 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 11:29:32,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:29:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 11:29:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 11:29:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 11:29:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-05 11:29:32,690 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-05 11:29:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:32,690 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-05 11:29:32,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:29:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-05 11:29:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:29:32,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:32,691 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:32,692 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 9 times [2019-09-05 11:29:32,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:32,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:32,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:33,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:33,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-05 11:29:33,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:33,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:29:33,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:33,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 11:29:33,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:33,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:33,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:33,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2019-09-05 11:29:33,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:29:33,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:29:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:29:33,448 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-09-05 11:29:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:33,678 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-05 11:29:33,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:29:33,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-09-05 11:29:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:33,680 INFO L225 Difference]: With dead ends: 27 [2019-09-05 11:29:33,680 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:29:33,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:29:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:29:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 11:29:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:29:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-05 11:29:33,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-05 11:29:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:33,686 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-05 11:29:33,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:29:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-05 11:29:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:29:33,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:33,687 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:33,687 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:33,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 10 times [2019-09-05 11:29:33,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:33,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:33,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:33,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:34,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:34,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:34,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:29:34,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:34,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:34,419 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 11:29:34,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:34,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2019-09-05 11:29:34,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:29:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:29:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:29:34,877 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 31 states. [2019-09-05 11:29:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:35,208 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-05 11:29:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:29:35,211 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 21 [2019-09-05 11:29:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:35,212 INFO L225 Difference]: With dead ends: 28 [2019-09-05 11:29:35,212 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:29:35,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:29:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:29:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 11:29:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 11:29:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-05 11:29:35,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-05 11:29:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:35,217 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-05 11:29:35,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:29:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-05 11:29:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:29:35,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:35,218 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:35,219 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:35,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 11 times [2019-09-05 11:29:35,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:35,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:35,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:35,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:35,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:35,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:30:11,802 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:30:11,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:11,836 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 11:30:11,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:12,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:12,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:12,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-09-05 11:30:12,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:30:12,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:30:12,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:30:12,384 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 33 states. [2019-09-05 11:30:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:12,748 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-05 11:30:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:30:12,753 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 22 [2019-09-05 11:30:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:12,754 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:30:12,754 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 11:30:12,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:30:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 11:30:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 11:30:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:30:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-05 11:30:12,761 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-05 11:30:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:12,762 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-05 11:30:12,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:30:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-05 11:30:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:30:12,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:12,765 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:12,765 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:12,765 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 12 times [2019-09-05 11:30:12,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:12,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:12,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:12,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:13,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:13,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:13,382 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:30:16,625 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-05 11:30:16,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:16,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 11:30:16,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:16,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:16,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:16,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 23 [2019-09-05 11:30:16,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:30:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:30:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:30:16,862 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-09-05 11:30:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:17,200 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-05 11:30:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:30:17,201 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-09-05 11:30:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:17,202 INFO L225 Difference]: With dead ends: 30 [2019-09-05 11:30:17,202 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:30:17,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:30:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:30:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 11:30:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:30:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-05 11:30:17,209 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-05 11:30:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:17,209 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-05 11:30:17,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:30:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-05 11:30:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:30:17,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:17,210 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:17,210 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 13 times [2019-09-05 11:30:17,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:17,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:17,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:17,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:17,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:17,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:17,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:17,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:18,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 11:30:18,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:18,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:18,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:18,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2019-09-05 11:30:18,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 11:30:18,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 11:30:18,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:30:18,779 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 37 states. [2019-09-05 11:30:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:19,186 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-05 11:30:19,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:30:19,187 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 24 [2019-09-05 11:30:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:19,189 INFO L225 Difference]: With dead ends: 31 [2019-09-05 11:30:19,189 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 11:30:19,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:30:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 11:30:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-05 11:30:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:30:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-05 11:30:19,196 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-05 11:30:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:19,196 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-05 11:30:19,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 11:30:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-05 11:30:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-05 11:30:19,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:19,197 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:19,197 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 14 times [2019-09-05 11:30:19,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:19,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:19,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:30:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:19,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:19,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:19,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:30:20,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:30:20,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:20,002 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 11:30:20,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:20,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:20,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:20,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 25 [2019-09-05 11:30:20,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:30:20,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:30:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:30:20,270 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-09-05 11:30:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:20,639 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-05 11:30:20,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:30:20,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-09-05 11:30:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:20,640 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:30:20,640 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:30:20,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 13 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:30:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:30:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 11:30:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:30:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-05 11:30:20,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-05 11:30:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:20,647 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-05 11:30:20,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:30:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-05 11:30:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:30:20,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:20,648 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:20,648 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 15 times [2019-09-05 11:30:20,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:20,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:21,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:21,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:21,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:30:21,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:30:21,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:21,572 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 11:30:21,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:21,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:21,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:21,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 26 [2019-09-05 11:30:21,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:30:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:30:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:30:21,857 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-09-05 11:30:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:22,318 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-05 11:30:22,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:30:22,319 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-09-05 11:30:22,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:22,320 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:30:22,320 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 11:30:22,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:30:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 11:30:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-05 11:30:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 11:30:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-05 11:30:22,326 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-05 11:30:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:22,327 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-05 11:30:22,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:30:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-05 11:30:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 11:30:22,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:22,328 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:22,328 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 16 times [2019-09-05 11:30:22,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:22,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:22,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:22,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:22,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:23,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:23,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:23,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:30:23,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:30:23,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:23,290 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-05 11:30:23,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:23,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:23,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 27 [2019-09-05 11:30:23,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:30:23,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:30:23,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:30:23,563 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-09-05 11:30:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:24,009 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-05 11:30:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:30:24,010 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-09-05 11:30:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:24,011 INFO L225 Difference]: With dead ends: 34 [2019-09-05 11:30:24,011 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:30:24,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:30:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:30:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 11:30:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:30:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-05 11:30:24,017 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-05 11:30:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:24,018 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-05 11:30:24,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:30:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-05 11:30:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:30:24,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:24,019 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:24,019 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 17 times [2019-09-05 11:30:24,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:24,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:24,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:24,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:24,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:24,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:24,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:24,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:31:56,725 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-05 11:31:56,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:31:58,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:31:58,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-09-05 11:31:58,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:31:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:31:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:31:58,235 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 24 states. [2019-09-05 11:31:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:58,654 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-05 11:31:58,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:31:58,655 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-09-05 11:31:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:58,656 INFO L225 Difference]: With dead ends: 35 [2019-09-05 11:31:58,656 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 11:31:58,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:31:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 11:31:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-05 11:31:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:31:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-05 11:31:58,667 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-05 11:31:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:58,670 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-05 11:31:58,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:31:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-05 11:31:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:31:58,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:58,672 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:58,672 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 18 times [2019-09-05 11:31:58,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:58,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:58,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:59,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:59,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:59,587 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:32:55,557 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-05 11:32:55,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:33:02,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:33:02,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-09-05 11:33:02,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:33:02,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:33:02,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:33:02,468 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 25 states. [2019-09-05 11:33:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:02,927 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-05 11:33:02,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:33:02,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-09-05 11:33:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:02,933 INFO L225 Difference]: With dead ends: 36 [2019-09-05 11:33:02,933 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:33:02,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:33:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:33:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 11:33:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:33:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-05 11:33:02,938 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-05 11:33:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:02,938 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-05 11:33:02,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:33:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-05 11:33:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:33:02,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:02,939 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:02,940 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 19 times [2019-09-05 11:33:02,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:02,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:02,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:03,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:03,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:03,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:33:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:03,878 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 11:33:03,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:04,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:04,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:04,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2019-09-05 11:33:04,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 11:33:04,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 11:33:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2193, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:33:04,931 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 49 states. [2019-09-05 11:33:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:05,617 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-05 11:33:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:33:05,617 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 30 [2019-09-05 11:33:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:05,618 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:33:05,618 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:33:05,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=171, Invalid=2379, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 11:33:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:33:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-05 11:33:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:33:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-05 11:33:05,629 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-05 11:33:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:05,629 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-05 11:33:05,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 11:33:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-05 11:33:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:33:05,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:05,630 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:05,631 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 20 times [2019-09-05 11:33:05,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:05,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:05,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:33:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:06,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:06,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:06,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:33:08,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:33:08,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:08,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 11:33:08,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:08,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:08,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 31 [2019-09-05 11:33:08,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:33:08,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:33:08,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:33:08,671 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-09-05 11:33:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:09,289 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-05 11:33:09,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:33:09,289 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-09-05 11:33:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:09,290 INFO L225 Difference]: With dead ends: 38 [2019-09-05 11:33:09,290 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:33:09,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:33:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:33:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 11:33:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:33:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-05 11:33:09,296 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-05 11:33:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:09,297 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-05 11:33:09,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:33:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-05 11:33:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:33:09,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:09,298 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:09,298 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 21 times [2019-09-05 11:33:09,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:09,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:09,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:10,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:10,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:10,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:33:20,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 11:33:20,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:33:20,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-05 11:33:20,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:33:21,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:33:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:21,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:33:21,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2019-09-05 11:33:21,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 11:33:21,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 11:33:21,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:33:21,545 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 53 states. [2019-09-05 11:33:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:22,679 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-05 11:33:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:33:22,681 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 32 [2019-09-05 11:33:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:22,682 INFO L225 Difference]: With dead ends: 39 [2019-09-05 11:33:22,682 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:33:22,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=185, Invalid=2785, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 11:33:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:33:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-05 11:33:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:33:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-05 11:33:22,688 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-05 11:33:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:22,689 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-05 11:33:22,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 11:33:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-05 11:33:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 11:33:22,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:22,689 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:22,690 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 22 times [2019-09-05 11:33:22,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:22,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:23,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:23,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:23,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:33:35,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:33:35,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:33:35,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:33:35,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-09-05 11:33:35,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:33:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:33:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:33:35,980 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 29 states. [2019-09-05 11:33:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:33:36,592 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-05 11:33:36,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:33:36,592 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-09-05 11:33:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:33:36,593 INFO L225 Difference]: With dead ends: 40 [2019-09-05 11:33:36,593 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 11:33:36,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:33:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 11:33:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 11:33:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:33:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-05 11:33:36,599 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-05 11:33:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:33:36,599 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-05 11:33:36,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:33:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-05 11:33:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:33:36,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:33:36,600 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:33:36,600 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:33:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:33:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 23 times [2019-09-05 11:33:36,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:33:36,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:33:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:36,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:33:36,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:33:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:33:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:33:37,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:33:37,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:33:37,871 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:35:51,087 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-05 11:35:51,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:36:07,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:36:07,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-09-05 11:36:07,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:36:07,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:36:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:36:07,465 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 30 states. [2019-09-05 11:36:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:08,150 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-05 11:36:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:36:08,150 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-09-05 11:36:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:08,150 INFO L225 Difference]: With dead ends: 41 [2019-09-05 11:36:08,151 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 11:36:08,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:36:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 11:36:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-05 11:36:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 11:36:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-05 11:36:08,156 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-05 11:36:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:08,157 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-05 11:36:08,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:36:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-05 11:36:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 11:36:08,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:08,157 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:08,157 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 24 times [2019-09-05 11:36:08,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:08,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:36:09,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:09,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:09,329 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:36:54,594 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-05 11:36:54,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:36:57,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:36:57,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-09-05 11:36:57,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:36:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:36:57,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:36:57,078 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 31 states. [2019-09-05 11:36:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:36:57,808 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-05 11:36:57,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:36:57,808 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-09-05 11:36:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:36:57,809 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:36:57,809 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:36:57,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:36:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:36:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 11:36:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:36:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-05 11:36:57,815 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-05 11:36:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:36:57,815 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-05 11:36:57,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:36:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-05 11:36:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:36:57,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:36:57,816 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:36:57,816 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:36:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:36:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 25 times [2019-09-05 11:36:57,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:36:57,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:36:57,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:57,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:36:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:36:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:36:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:36:59,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:36:59,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:36:59,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:37:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-05 11:37:11,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:37:11,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-09-05 11:37:11,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:37:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:37:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:37:11,234 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 32 states. [2019-09-05 11:37:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:12,015 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-05 11:37:12,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:37:12,015 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2019-09-05 11:37:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:12,015 INFO L225 Difference]: With dead ends: 43 [2019-09-05 11:37:12,015 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 11:37:12,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:37:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 11:37:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-05 11:37:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 11:37:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-05 11:37:12,021 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-05 11:37:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:12,022 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-05 11:37:12,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:37:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-05 11:37:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 11:37:12,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:12,023 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:12,023 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 26 times [2019-09-05 11:37:12,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:12,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:12,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:12,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:37:12,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:37:13,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:13,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:13,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:37:25,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:37:25,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:37:25,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:37:25,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-09-05 11:37:25,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:37:25,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:37:25,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:37:25,623 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 33 states. [2019-09-05 11:37:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:37:26,456 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-05 11:37:26,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:37:26,456 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 37 [2019-09-05 11:37:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:37:26,457 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:37:26,457 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:37:26,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:37:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:37:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-05 11:37:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:37:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-05 11:37:26,464 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-05 11:37:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:37:26,464 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-05 11:37:26,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:37:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-05 11:37:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:37:26,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:37:26,465 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:37:26,465 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:37:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:37:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 27 times [2019-09-05 11:37:26,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:37:26,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:37:26,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:26,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:37:26,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:37:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:37:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:37:27,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:37:27,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:37:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:39:46,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 11:39:46,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:39:54,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:39:54,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-09-05 11:39:54,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:39:54,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:39:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:39:54,082 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 34 states. [2019-09-05 11:39:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:54,941 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-05 11:39:54,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:39:54,941 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-09-05 11:39:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:54,942 INFO L225 Difference]: With dead ends: 45 [2019-09-05 11:39:54,942 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 11:39:54,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 11:39:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 11:39:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-05 11:39:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:39:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-05 11:39:54,949 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-05 11:39:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:54,949 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-05 11:39:54,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:39:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-05 11:39:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:39:54,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:54,950 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:54,950 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 28 times [2019-09-05 11:39:54,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:54,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:54,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:39:56,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:56,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:56,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:40:04,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:40:04,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:40:04,723 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-05 11:40:04,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:40:09,836 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 21 [2019-09-05 11:40:17,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:40:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:40:17,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:40:17,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2019-09-05 11:40:17,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-05 11:40:17,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-05 11:40:17,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4198, Unknown=2, NotChecked=0, Total=4422 [2019-09-05 11:40:17,448 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 67 states. [2019-09-05 11:40:23,396 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 33 DAG size of output: 15 [2019-09-05 11:40:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:40:23,519 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-05 11:40:23,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:40:23,520 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 39 [2019-09-05 11:40:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:40:23,520 INFO L225 Difference]: With dead ends: 46 [2019-09-05 11:40:23,521 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 11:40:23,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=234, Invalid=4456, Unknown=2, NotChecked=0, Total=4692 [2019-09-05 11:40:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 11:40:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 11:40:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:40:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-05 11:40:23,530 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-05 11:40:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:40:23,530 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-05 11:40:23,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-05 11:40:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-05 11:40:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:40:23,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:40:23,531 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:40:23,531 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:40:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:40:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 29 times [2019-09-05 11:40:23,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:40:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:40:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:40:23,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:40:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:40:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:40:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:40:24,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:40:24,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:40:24,954 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:43:20,684 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-05 11:43:20,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-05 11:43:25,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:43:25,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-09-05 11:43:25,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:43:25,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:43:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:43:25,282 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 36 states. [2019-09-05 11:43:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:26,291 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-05 11:43:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 11:43:26,291 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-09-05 11:43:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:26,292 INFO L225 Difference]: With dead ends: 47 [2019-09-05 11:43:26,292 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:43:26,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:43:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:43:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-05 11:43:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 11:43:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-05 11:43:26,300 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-05 11:43:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:26,300 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-05 11:43:26,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:43:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-05 11:43:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:43:26,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:26,301 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:26,301 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:26,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 30 times [2019-09-05 11:43:26,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:26,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:26,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:26,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:26,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:27,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:27,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:27,786 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE