java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:28:39,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:28:39,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:28:39,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:28:39,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:28:39,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:28:39,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:28:39,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:28:39,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:28:39,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:28:39,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:28:39,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:28:39,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:28:39,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:28:39,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:28:39,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:28:39,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:28:39,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:28:39,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:28:39,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:28:39,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:28:39,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:28:39,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:28:39,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:28:39,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:28:39,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:28:39,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:28:39,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:28:39,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:28:39,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:28:39,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:28:39,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:28:39,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:28:39,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:28:39,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:28:39,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:28:39,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:28:39,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:28:39,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:28:39,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:28:39,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:28:39,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:28:39,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:28:39,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:28:39,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:28:39,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:28:39,402 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:28:39,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:28:39,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:28:39,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:28:39,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:28:39,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:28:39,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:28:39,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:28:39,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:28:39,404 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:28:39,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:28:39,405 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:28:39,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:28:39,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:28:39,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:28:39,405 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:28:39,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:28:39,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:28:39,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:28:39,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:28:39,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:28:39,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:28:39,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:28:39,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:28:39,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:28:39,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:28:39,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:28:39,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:28:39,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:28:39,453 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:28:39,454 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_2_ground.i [2019-10-01 22:28:39,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207fcbf94/15e25c0664fb4fd69ca77c90d192668f/FLAG61969cb01 [2019-10-01 22:28:39,997 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:28:39,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_2_ground.i [2019-10-01 22:28:40,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207fcbf94/15e25c0664fb4fd69ca77c90d192668f/FLAG61969cb01 [2019-10-01 22:28:40,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207fcbf94/15e25c0664fb4fd69ca77c90d192668f [2019-10-01 22:28:40,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:28:40,332 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:28:40,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:40,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:28:40,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:28:40,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641eaed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40, skipping insertion in model container [2019-10-01 22:28:40,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,352 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:28:40,372 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:28:40,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:40,564 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:28:40,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:40,604 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:28:40,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40 WrapperNode [2019-10-01 22:28:40,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:40,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:28:40,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:28:40,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:28:40,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (1/1) ... [2019-10-01 22:28:40,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:28:40,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:28:40,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:28:40,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:28:40,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:28:40,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:28:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:28:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:28:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:28:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:28:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:28:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:28:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:28:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:28:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:28:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:28:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:28:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:28:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:28:41,087 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:28:41,088 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-01 22:28:41,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:41 BoogieIcfgContainer [2019-10-01 22:28:41,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:28:41,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:28:41,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:28:41,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:28:41,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:28:40" (1/3) ... [2019-10-01 22:28:41,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d264ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:41, skipping insertion in model container [2019-10-01 22:28:41,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:40" (2/3) ... [2019-10-01 22:28:41,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d264ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:41, skipping insertion in model container [2019-10-01 22:28:41,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:41" (3/3) ... [2019-10-01 22:28:41,098 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_2_ground.i [2019-10-01 22:28:41,121 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:28:41,133 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:28:41,149 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:28:41,175 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:28:41,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:28:41,176 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:28:41,176 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:28:41,176 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:28:41,176 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:28:41,176 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:28:41,177 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:28:41,177 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:28:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:28:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:28:41,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:41,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:41,203 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1296691801, now seen corresponding path program 1 times [2019-10-01 22:28:41,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:41,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:41,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:41,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:28:41,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:41,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:28:41,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:28:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:28:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:28:41,372 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:28:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:41,399 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-10-01 22:28:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:28:41,401 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-01 22:28:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:41,411 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:28:41,411 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:28:41,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:28:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:28:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:28:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:28:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-10-01 22:28:41,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2019-10-01 22:28:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:41,486 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-10-01 22:28:41,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:28:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-10-01 22:28:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:28:41,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:41,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:41,489 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1547542812, now seen corresponding path program 1 times [2019-10-01 22:28:41,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:41,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:41,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:41,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:28:41,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:41,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:41,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:41,624 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-10-01 22:28:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:41,667 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 22:28:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:41,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 22:28:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:41,672 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:28:41,672 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:28:41,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:28:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 22:28:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:28:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-01 22:28:41,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2019-10-01 22:28:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:41,684 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-01 22:28:41,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-01 22:28:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 22:28:41,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:41,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:41,686 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:41,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1387426810, now seen corresponding path program 1 times [2019-10-01 22:28:41,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:41,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:41,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:41,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:41,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:41,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:41,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:41,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:41,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:41,753 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-10-01 22:28:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:41,770 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-10-01 22:28:41,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:41,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-01 22:28:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:41,773 INFO L225 Difference]: With dead ends: 44 [2019-10-01 22:28:41,773 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 22:28:41,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 22:28:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-01 22:28:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:28:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-10-01 22:28:41,784 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2019-10-01 22:28:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:41,784 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-01 22:28:41,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-10-01 22:28:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 22:28:41,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:41,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:41,788 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1108929549, now seen corresponding path program 1 times [2019-10-01 22:28:41,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:41,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:41,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:41,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:41,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:41,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:41,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:41,838 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2019-10-01 22:28:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:41,868 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-10-01 22:28:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:41,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-01 22:28:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:41,871 INFO L225 Difference]: With dead ends: 56 [2019-10-01 22:28:41,871 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:28:41,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:28:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-01 22:28:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:28:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-10-01 22:28:41,881 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 20 [2019-10-01 22:28:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:41,883 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-10-01 22:28:41,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-10-01 22:28:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 22:28:41,885 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:41,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:41,885 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2055572838, now seen corresponding path program 1 times [2019-10-01 22:28:41,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:41,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:41,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:41,979 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:42,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:42,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:28:42,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:42,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:42,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:28:42,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:28:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:28:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:28:42,111 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 5 states. [2019-10-01 22:28:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:42,147 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-01 22:28:42,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:28:42,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-01 22:28:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:42,149 INFO L225 Difference]: With dead ends: 58 [2019-10-01 22:28:42,149 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:28:42,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:28:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:28:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-01 22:28:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 22:28:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-01 22:28:42,156 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 23 [2019-10-01 22:28:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:42,157 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-01 22:28:42,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:28:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-01 22:28:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 22:28:42,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:42,158 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:42,159 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash 442145592, now seen corresponding path program 2 times [2019-10-01 22:28:42,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:42,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:42,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:42,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:42,252 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:42,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:42,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:42,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:42,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:28:42,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:42,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:42,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:28:42,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:28:42,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:28:42,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:28:42,328 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2019-10-01 22:28:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:42,359 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-10-01 22:28:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:28:42,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-01 22:28:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:42,360 INFO L225 Difference]: With dead ends: 60 [2019-10-01 22:28:42,360 INFO L226 Difference]: Without dead ends: 37 [2019-10-01 22:28:42,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:28:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-01 22:28:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-01 22:28:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 22:28:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-10-01 22:28:42,368 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 25 [2019-10-01 22:28:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:42,368 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-10-01 22:28:42,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:28:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-10-01 22:28:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:28:42,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:42,370 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:42,370 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash -137161642, now seen corresponding path program 3 times [2019-10-01 22:28:42,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:42,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:42,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:42,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:42,445 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:42,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:42,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:28:42,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:42,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:28:42,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:28:42,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:42,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:28:42,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:42,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:42,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:42,539 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 8 states. [2019-10-01 22:28:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:42,607 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-10-01 22:28:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:28:42,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-10-01 22:28:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:42,609 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:28:42,609 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 22:28:42,610 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 22:28:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-10-01 22:28:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:28:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-10-01 22:28:42,616 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2019-10-01 22:28:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:42,617 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-10-01 22:28:42,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-10-01 22:28:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:28:42,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:42,618 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:42,618 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash -890436781, now seen corresponding path program 4 times [2019-10-01 22:28:42,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:42,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:42,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:28:42,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:42,701 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:42,723 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-10-01 22:28:42,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:42,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:42,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:28:42,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:28:42,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:42,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:28:42,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:42,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:42,784 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 8 states. [2019-10-01 22:28:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:42,823 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-10-01 22:28:42,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:28:42,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-10-01 22:28:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:42,827 INFO L225 Difference]: With dead ends: 74 [2019-10-01 22:28:42,827 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 22:28:42,828 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 22:28:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-10-01 22:28:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-01 22:28:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-10-01 22:28:42,839 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 32 [2019-10-01 22:28:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:42,840 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-10-01 22:28:42,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-10-01 22:28:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:28:42,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:42,842 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:42,842 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash -250762123, now seen corresponding path program 5 times [2019-10-01 22:28:42,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:42,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:42,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:42,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:42,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:28:42,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:42,959 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:42,992 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:43,018 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-01 22:28:43,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:43,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:28:43,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 22:28:43,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:43,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 22:28:43,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:28:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:28:43,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:43,061 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 11 states. [2019-10-01 22:28:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:43,155 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2019-10-01 22:28:43,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:28:43,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-10-01 22:28:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:43,158 INFO L225 Difference]: With dead ends: 86 [2019-10-01 22:28:43,158 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 22:28:43,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 22:28:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2019-10-01 22:28:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 22:28:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-10-01 22:28:43,171 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 34 [2019-10-01 22:28:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:43,172 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-10-01 22:28:43,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:28:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-10-01 22:28:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 22:28:43,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,177 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,177 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1537034928, now seen corresponding path program 6 times [2019-10-01 22:28:43,177 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:43,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 22:28:43,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:43,289 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:43,311 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:43,354 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:28:43,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:43,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:28:43,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:28:43,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:43,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-01 22:28:43,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:28:43,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:28:43,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:28:43,433 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 13 states. [2019-10-01 22:28:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:43,545 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2019-10-01 22:28:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:28:43,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-10-01 22:28:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:43,546 INFO L225 Difference]: With dead ends: 100 [2019-10-01 22:28:43,547 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:28:43,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:28:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:28:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2019-10-01 22:28:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 22:28:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-10-01 22:28:43,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 39 [2019-10-01 22:28:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:43,570 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-10-01 22:28:43,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:28:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-10-01 22:28:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:28:43,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,572 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,572 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash 747611417, now seen corresponding path program 7 times [2019-10-01 22:28:43,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:43,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:43,717 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:43,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:28:43,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:43,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:43,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:28:43,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:28:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:28:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:43,836 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 11 states. [2019-10-01 22:28:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:43,884 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2019-10-01 22:28:43,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:28:43,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-10-01 22:28:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:43,886 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:28:43,886 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:28:43,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:28:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-10-01 22:28:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:28:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-10-01 22:28:43,893 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2019-10-01 22:28:43,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:43,893 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-10-01 22:28:43,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:28:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-10-01 22:28:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:28:43,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,895 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,895 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1331800891, now seen corresponding path program 8 times [2019-10-01 22:28:43,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:44,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,003 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:44,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:44,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:44,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:44,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:44,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:28:44,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:28:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:28:44,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:28:44,093 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 12 states. [2019-10-01 22:28:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,137 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2019-10-01 22:28:44,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:28:44,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-10-01 22:28:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,139 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:28:44,139 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:28:44,139 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:28:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:28:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-10-01 22:28:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-01 22:28:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-10-01 22:28:44,146 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 46 [2019-10-01 22:28:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,146 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-10-01 22:28:44,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:28:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-10-01 22:28:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-01 22:28:44,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,147 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,148 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash 97169629, now seen corresponding path program 9 times [2019-10-01 22:28:44,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:28:44,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,283 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:44,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:44,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:28:44,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:28:44,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:44,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2019-10-01 22:28:44,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:28:44,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:28:44,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:28:44,435 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 17 states. [2019-10-01 22:28:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,561 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2019-10-01 22:28:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:28:44,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2019-10-01 22:28:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,565 INFO L225 Difference]: With dead ends: 118 [2019-10-01 22:28:44,566 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:28:44,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:28:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:28:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2019-10-01 22:28:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-01 22:28:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2019-10-01 22:28:44,576 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 48 [2019-10-01 22:28:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,576 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2019-10-01 22:28:44,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:28:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2019-10-01 22:28:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 22:28:44,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,578 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,578 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash 830729064, now seen corresponding path program 10 times [2019-10-01 22:28:44,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:44,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:28:44,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,737 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:44,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:44,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:44,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:28:44,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:44,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:28:44,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:28:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:28:44,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:28:44,850 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand 14 states. [2019-10-01 22:28:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,913 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2019-10-01 22:28:44,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:28:44,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-10-01 22:28:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,914 INFO L225 Difference]: With dead ends: 122 [2019-10-01 22:28:44,915 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 22:28:44,915 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:28:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 22:28:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-10-01 22:28:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 22:28:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-10-01 22:28:44,931 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 53 [2019-10-01 22:28:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,933 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-10-01 22:28:44,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:28:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2019-10-01 22:28:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:28:44,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,935 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,935 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1163504518, now seen corresponding path program 11 times [2019-10-01 22:28:44,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:28:45,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:45,063 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:45,082 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:45,148 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:28:45,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:45,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:28:45,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-01 22:28:45,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-10-01 22:28:45,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:28:45,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:28:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:45,250 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 20 states. [2019-10-01 22:28:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:45,364 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2019-10-01 22:28:45,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:28:45,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-10-01 22:28:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:45,367 INFO L225 Difference]: With dead ends: 134 [2019-10-01 22:28:45,367 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 22:28:45,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 22:28:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-10-01 22:28:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-01 22:28:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-10-01 22:28:45,384 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 55 [2019-10-01 22:28:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:45,384 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-10-01 22:28:45,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:28:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-10-01 22:28:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-01 22:28:45,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:45,385 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:45,386 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:45,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:45,386 INFO L82 PathProgramCache]: Analyzing trace with hash -264767709, now seen corresponding path program 12 times [2019-10-01 22:28:45,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:45,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:45,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-01 22:28:45,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:45,541 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:45,566 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:45,682 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:28:45,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:45,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:28:45,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:28:45,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:45,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2019-10-01 22:28:45,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:28:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:28:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:45,818 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 22 states. [2019-10-01 22:28:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:45,954 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2019-10-01 22:28:45,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:28:45,955 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-10-01 22:28:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:45,956 INFO L225 Difference]: With dead ends: 148 [2019-10-01 22:28:45,956 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 22:28:45,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 22:28:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-10-01 22:28:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 22:28:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2019-10-01 22:28:45,962 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 60 [2019-10-01 22:28:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:45,962 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2019-10-01 22:28:45,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:28:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2019-10-01 22:28:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 22:28:45,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:45,963 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:45,964 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash 980957794, now seen corresponding path program 13 times [2019-10-01 22:28:45,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:45,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:45,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:46,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:46,112 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:46,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:46,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:28:46,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:46,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:46,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:28:46,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:28:46,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:28:46,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:28:46,213 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand 17 states. [2019-10-01 22:28:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:46,278 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2019-10-01 22:28:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:28:46,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-10-01 22:28:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:46,280 INFO L225 Difference]: With dead ends: 152 [2019-10-01 22:28:46,280 INFO L226 Difference]: Without dead ends: 94 [2019-10-01 22:28:46,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:28:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-01 22:28:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-10-01 22:28:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 22:28:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2019-10-01 22:28:46,286 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 65 [2019-10-01 22:28:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:46,287 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2019-10-01 22:28:46,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:28:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2019-10-01 22:28:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:28:46,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:46,288 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:46,288 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1862843776, now seen corresponding path program 14 times [2019-10-01 22:28:46,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:46,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:46,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:46,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:46,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:46,436 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:46,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:46,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:46,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:46,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:28:46,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:46,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:28:46,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:28:46,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:28:46,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:46,552 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand 18 states. [2019-10-01 22:28:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:46,624 INFO L93 Difference]: Finished difference Result 154 states and 190 transitions. [2019-10-01 22:28:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:28:46,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-10-01 22:28:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:46,625 INFO L225 Difference]: With dead ends: 154 [2019-10-01 22:28:46,625 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 22:28:46,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 22:28:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 22:28:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 22:28:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-10-01 22:28:46,631 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 67 [2019-10-01 22:28:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:46,632 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-10-01 22:28:46,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:28:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-10-01 22:28:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 22:28:46,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:46,633 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:46,633 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:46,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:46,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1048252130, now seen corresponding path program 15 times [2019-10-01 22:28:46,634 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:46,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:46,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:46,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 22:28:46,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:46,849 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:46,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:46,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:28:46,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:46,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:28:46,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-01 22:28:47,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:47,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 26 [2019-10-01 22:28:47,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:28:47,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:28:47,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:47,063 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 26 states. [2019-10-01 22:28:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,188 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2019-10-01 22:28:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:28:47,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-10-01 22:28:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,190 INFO L225 Difference]: With dead ends: 166 [2019-10-01 22:28:47,190 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 22:28:47,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 22:28:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2019-10-01 22:28:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 22:28:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2019-10-01 22:28:47,196 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 69 [2019-10-01 22:28:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,196 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2019-10-01 22:28:47,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:28:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2019-10-01 22:28:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 22:28:47,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,197 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,198 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1331337461, now seen corresponding path program 16 times [2019-10-01 22:28:47,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-01 22:28:47,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:47,381 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:47,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:47,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:47,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:47,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:28:47,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:47,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:47,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2019-10-01 22:28:47,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:28:47,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:28:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:28:47,594 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 28 states. [2019-10-01 22:28:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,736 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2019-10-01 22:28:47,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:28:47,737 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2019-10-01 22:28:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,738 INFO L225 Difference]: With dead ends: 180 [2019-10-01 22:28:47,738 INFO L226 Difference]: Without dead ends: 116 [2019-10-01 22:28:47,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:28:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-01 22:28:47,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2019-10-01 22:28:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 22:28:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2019-10-01 22:28:47,743 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 74 [2019-10-01 22:28:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,743 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2019-10-01 22:28:47,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:28:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2019-10-01 22:28:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-01 22:28:47,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,745 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,745 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash 261485818, now seen corresponding path program 17 times [2019-10-01 22:28:47,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:47,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:28:47,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:47,952 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:47,975 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:48,114 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:28:48,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:48,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:28:48,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-01 22:28:48,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:48,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 30 [2019-10-01 22:28:48,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:28:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:28:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:28:48,279 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 30 states. [2019-10-01 22:28:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:48,439 INFO L93 Difference]: Finished difference Result 194 states and 244 transitions. [2019-10-01 22:28:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:28:48,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2019-10-01 22:28:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:48,440 INFO L225 Difference]: With dead ends: 194 [2019-10-01 22:28:48,441 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 22:28:48,441 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:28:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 22:28:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2019-10-01 22:28:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 22:28:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2019-10-01 22:28:48,447 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 79 [2019-10-01 22:28:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:48,447 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2019-10-01 22:28:48,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:28:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2019-10-01 22:28:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 22:28:48,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:48,449 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:48,449 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:48,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1674935505, now seen corresponding path program 18 times [2019-10-01 22:28:48,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:48,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:48,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:48,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:48,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:48,895 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:48,932 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:49,653 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:28:49,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:49,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:28:49,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:49,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:49,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:28:49,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:28:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:28:49,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:49,712 INFO L87 Difference]: Start difference. First operand 119 states and 143 transitions. Second operand 22 states. [2019-10-01 22:28:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:49,784 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2019-10-01 22:28:49,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:28:49,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2019-10-01 22:28:49,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:49,786 INFO L225 Difference]: With dead ends: 198 [2019-10-01 22:28:49,786 INFO L226 Difference]: Without dead ends: 122 [2019-10-01 22:28:49,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-01 22:28:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-10-01 22:28:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 22:28:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2019-10-01 22:28:49,791 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 84 [2019-10-01 22:28:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:49,792 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2019-10-01 22:28:49,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:28:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2019-10-01 22:28:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-01 22:28:49,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:49,793 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:49,793 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1933852497, now seen corresponding path program 19 times [2019-10-01 22:28:49,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:49,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:49,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:49,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:49,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:50,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:50,133 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:50,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:50,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:28:50,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:50,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:50,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:28:50,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:28:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:28:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:28:50,245 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand 23 states. [2019-10-01 22:28:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:50,324 INFO L93 Difference]: Finished difference Result 200 states and 248 transitions. [2019-10-01 22:28:50,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:28:50,324 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2019-10-01 22:28:50,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:50,326 INFO L225 Difference]: With dead ends: 200 [2019-10-01 22:28:50,326 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 22:28:50,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:28:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 22:28:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-10-01 22:28:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 22:28:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2019-10-01 22:28:50,331 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 86 [2019-10-01 22:28:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:50,332 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2019-10-01 22:28:50,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:28:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2019-10-01 22:28:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-01 22:28:50,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:50,333 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:50,333 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash -354452749, now seen corresponding path program 20 times [2019-10-01 22:28:50,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:50,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:50,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:50,588 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:50,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:50,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:50,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:50,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:28:50,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:50,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:28:50,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:28:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:28:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:28:50,714 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 24 states. [2019-10-01 22:28:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:50,799 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2019-10-01 22:28:50,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:28:50,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2019-10-01 22:28:50,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:50,801 INFO L225 Difference]: With dead ends: 202 [2019-10-01 22:28:50,801 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 22:28:50,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:28:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 22:28:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 22:28:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 22:28:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2019-10-01 22:28:50,807 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 88 [2019-10-01 22:28:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:50,807 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2019-10-01 22:28:50,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:28:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2019-10-01 22:28:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-01 22:28:50,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:50,808 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:50,808 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:50,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash -392538603, now seen corresponding path program 21 times [2019-10-01 22:28:50,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:50,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:28:51,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:51,081 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:51,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:51,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:28:51,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:51,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:28:51,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-10-01 22:28:51,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:51,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2019-10-01 22:28:51,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:28:51,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:28:51,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:28:51,425 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 35 states. [2019-10-01 22:28:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:51,630 INFO L93 Difference]: Finished difference Result 214 states and 268 transitions. [2019-10-01 22:28:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:28:51,631 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2019-10-01 22:28:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:51,632 INFO L225 Difference]: With dead ends: 214 [2019-10-01 22:28:51,632 INFO L226 Difference]: Without dead ends: 138 [2019-10-01 22:28:51,633 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:28:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-01 22:28:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2019-10-01 22:28:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-01 22:28:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2019-10-01 22:28:51,638 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 90 [2019-10-01 22:28:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:51,638 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2019-10-01 22:28:51,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:28:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2019-10-01 22:28:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 22:28:51,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:51,640 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:51,640 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:51,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1768371632, now seen corresponding path program 22 times [2019-10-01 22:28:51,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:51,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:51,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:51,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:51,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 22:28:51,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:51,950 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:51,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:52,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:52,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:52,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:28:52,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 22:28:52,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:52,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:28:52,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:28:52,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:28:52,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:52,052 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand 26 states. [2019-10-01 22:28:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:52,126 INFO L93 Difference]: Finished difference Result 218 states and 270 transitions. [2019-10-01 22:28:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:28:52,127 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2019-10-01 22:28:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:52,128 INFO L225 Difference]: With dead ends: 218 [2019-10-01 22:28:52,128 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 22:28:52,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 22:28:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-10-01 22:28:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 22:28:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2019-10-01 22:28:52,134 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 95 [2019-10-01 22:28:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:52,134 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2019-10-01 22:28:52,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:28:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2019-10-01 22:28:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 22:28:52,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:52,135 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:52,136 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:52,136 INFO L82 PathProgramCache]: Analyzing trace with hash -742920114, now seen corresponding path program 23 times [2019-10-01 22:28:52,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:52,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:52,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:52,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-01 22:28:52,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:52,492 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:52,522 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:52,836 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 22:28:52,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:52,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:28:52,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 1 proven. 176 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:28:53,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:53,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14] total 38 [2019-10-01 22:28:53,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:28:53,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:28:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:28:53,058 INFO L87 Difference]: Start difference. First operand 135 states and 161 transitions. Second operand 38 states. [2019-10-01 22:28:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:53,283 INFO L93 Difference]: Finished difference Result 230 states and 288 transitions. [2019-10-01 22:28:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:28:53,284 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 97 [2019-10-01 22:28:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:53,285 INFO L225 Difference]: With dead ends: 230 [2019-10-01 22:28:53,285 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:28:53,288 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:28:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:28:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2019-10-01 22:28:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 22:28:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2019-10-01 22:28:53,296 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 97 [2019-10-01 22:28:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:53,297 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2019-10-01 22:28:53,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:28:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2019-10-01 22:28:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 22:28:53,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:53,299 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:53,299 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:53,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:53,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1743015205, now seen corresponding path program 24 times [2019-10-01 22:28:53,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:53,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:53,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:53,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:28:53,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:53,882 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:53,914 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:54,992 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:28:54,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:54,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:28:54,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:28:55,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:55,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 22:28:55,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:28:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:28:55,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:28:55,037 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand 28 states. [2019-10-01 22:28:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:55,132 INFO L93 Difference]: Finished difference Result 234 states and 290 transitions. [2019-10-01 22:28:55,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:28:55,133 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 102 [2019-10-01 22:28:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:55,135 INFO L225 Difference]: With dead ends: 234 [2019-10-01 22:28:55,135 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 22:28:55,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:28:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 22:28:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 22:28:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 22:28:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 173 transitions. [2019-10-01 22:28:55,141 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 173 transitions. Word has length 102 [2019-10-01 22:28:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:55,141 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 173 transitions. [2019-10-01 22:28:55,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:28:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 173 transitions. [2019-10-01 22:28:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-01 22:28:55,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:55,142 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:55,143 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1419810179, now seen corresponding path program 25 times [2019-10-01 22:28:55,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:55,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:55,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:55,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:28:55,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:55,731 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:55,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:55,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:28:55,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:28:55,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:55,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 22:28:55,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:28:55,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:28:55,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:28:55,884 INFO L87 Difference]: Start difference. First operand 145 states and 173 transitions. Second operand 29 states. [2019-10-01 22:28:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:55,966 INFO L93 Difference]: Finished difference Result 236 states and 292 transitions. [2019-10-01 22:28:55,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:28:55,967 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 104 [2019-10-01 22:28:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:55,968 INFO L225 Difference]: With dead ends: 236 [2019-10-01 22:28:55,968 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:28:55,970 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:28:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:28:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 22:28:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 22:28:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2019-10-01 22:28:55,975 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 104 [2019-10-01 22:28:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:55,975 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2019-10-01 22:28:55,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:28:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2019-10-01 22:28:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-01 22:28:55,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:55,977 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:55,977 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash -57425505, now seen corresponding path program 26 times [2019-10-01 22:28:55,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:55,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:28:56,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:56,374 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:56,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:56,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:56,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:56,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:28:56,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:56,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:56,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:28:56,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:28:56,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:28:56,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:28:56,491 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand 30 states. [2019-10-01 22:28:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:56,614 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2019-10-01 22:28:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:28:56,614 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 106 [2019-10-01 22:28:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:56,616 INFO L225 Difference]: With dead ends: 238 [2019-10-01 22:28:56,616 INFO L226 Difference]: Without dead ends: 150 [2019-10-01 22:28:56,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:28:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-01 22:28:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-10-01 22:28:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-01 22:28:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2019-10-01 22:28:56,623 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 106 [2019-10-01 22:28:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:56,623 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2019-10-01 22:28:56,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:28:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2019-10-01 22:28:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 22:28:56,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:56,625 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:56,625 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash -770779071, now seen corresponding path program 27 times [2019-10-01 22:28:56,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:56,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:56,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:56,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:56,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-01 22:28:57,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:57,101 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:57,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:57,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:28:57,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:57,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:28:57,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:57,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:57,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 15] total 43 [2019-10-01 22:28:57,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:28:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:28:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=1267, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:28:57,607 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand 43 states. [2019-10-01 22:28:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:57,831 INFO L93 Difference]: Finished difference Result 250 states and 312 transitions. [2019-10-01 22:28:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:28:57,831 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 108 [2019-10-01 22:28:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:57,833 INFO L225 Difference]: With dead ends: 250 [2019-10-01 22:28:57,833 INFO L226 Difference]: Without dead ends: 162 [2019-10-01 22:28:57,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=539, Invalid=1267, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:28:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-01 22:28:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2019-10-01 22:28:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 22:28:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2019-10-01 22:28:57,840 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 108 [2019-10-01 22:28:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:57,840 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2019-10-01 22:28:57,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:28:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2019-10-01 22:28:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-01 22:28:57,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:57,841 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:57,842 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1597532292, now seen corresponding path program 28 times [2019-10-01 22:28:57,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-01 22:28:58,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:58,426 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:58,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:58,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:58,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:58,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:28:58,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-01 22:28:58,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:58,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 22:28:58,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:28:58,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:28:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:28:58,593 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand 32 states. [2019-10-01 22:28:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:58,681 INFO L93 Difference]: Finished difference Result 254 states and 314 transitions. [2019-10-01 22:28:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:28:58,682 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 113 [2019-10-01 22:28:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:58,684 INFO L225 Difference]: With dead ends: 254 [2019-10-01 22:28:58,684 INFO L226 Difference]: Without dead ends: 160 [2019-10-01 22:28:58,686 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:28:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-01 22:28:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-10-01 22:28:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-01 22:28:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2019-10-01 22:28:58,694 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 113 [2019-10-01 22:28:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:58,695 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2019-10-01 22:28:58,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:28:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2019-10-01 22:28:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-01 22:28:58,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:58,696 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:58,696 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1883834462, now seen corresponding path program 29 times [2019-10-01 22:28:58,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:58,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:58,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:58,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-01 22:28:59,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:59,121 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:59,161 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:59,592 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 22:28:59,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:59,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:28:59,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 1 proven. 247 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-10-01 22:28:59,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:59,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 16] total 46 [2019-10-01 22:28:59,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:28:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:28:59,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1455, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:28:59,862 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand 46 states. [2019-10-01 22:29:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:00,064 INFO L93 Difference]: Finished difference Result 266 states and 332 transitions. [2019-10-01 22:29:00,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:29:00,064 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 115 [2019-10-01 22:29:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:00,065 INFO L225 Difference]: With dead ends: 266 [2019-10-01 22:29:00,066 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 22:29:00,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=615, Invalid=1455, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:29:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 22:29:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2019-10-01 22:29:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 22:29:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2019-10-01 22:29:00,074 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 115 [2019-10-01 22:29:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:00,074 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2019-10-01 22:29:00,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:29:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2019-10-01 22:29:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-01 22:29:00,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:00,076 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:00,076 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1764460921, now seen corresponding path program 30 times [2019-10-01 22:29:00,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:00,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:00,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:00,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:00,634 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:00,676 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:06,141 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-01 22:29:06,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:06,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:29:06,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:06,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:06,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 22:29:06,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:29:06,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:29:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:29:06,202 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand 34 states. [2019-10-01 22:29:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:06,304 INFO L93 Difference]: Finished difference Result 270 states and 334 transitions. [2019-10-01 22:29:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:29:06,305 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 120 [2019-10-01 22:29:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:06,306 INFO L225 Difference]: With dead ends: 270 [2019-10-01 22:29:06,306 INFO L226 Difference]: Without dead ends: 170 [2019-10-01 22:29:06,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:29:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-01 22:29:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-10-01 22:29:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 22:29:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2019-10-01 22:29:06,314 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 120 [2019-10-01 22:29:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:06,314 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2019-10-01 22:29:06,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:29:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2019-10-01 22:29:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 22:29:06,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:06,316 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:06,316 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1896499625, now seen corresponding path program 31 times [2019-10-01 22:29:06,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:06,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:06,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:06,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:07,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:07,073 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:07,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:07,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:29:07,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:07,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:07,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:29:07,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:29:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:29:07,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:29:07,214 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand 35 states. [2019-10-01 22:29:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:07,322 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2019-10-01 22:29:07,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:29:07,323 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 122 [2019-10-01 22:29:07,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:07,324 INFO L225 Difference]: With dead ends: 272 [2019-10-01 22:29:07,324 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 22:29:07,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:29:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 22:29:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-01 22:29:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 22:29:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 203 transitions. [2019-10-01 22:29:07,331 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 203 transitions. Word has length 122 [2019-10-01 22:29:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:07,331 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 203 transitions. [2019-10-01 22:29:07,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:29:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2019-10-01 22:29:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 22:29:07,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:07,333 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:07,333 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:07,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1793598389, now seen corresponding path program 32 times [2019-10-01 22:29:07,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:07,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:07,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:07,826 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:07,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:07,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:07,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:07,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:29:07,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:07,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:07,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:29:07,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:29:07,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:29:07,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:29:07,978 INFO L87 Difference]: Start difference. First operand 171 states and 203 transitions. Second operand 36 states. [2019-10-01 22:29:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:08,083 INFO L93 Difference]: Finished difference Result 274 states and 338 transitions. [2019-10-01 22:29:08,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:29:08,086 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 124 [2019-10-01 22:29:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:08,087 INFO L225 Difference]: With dead ends: 274 [2019-10-01 22:29:08,087 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 22:29:08,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:29:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 22:29:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-01 22:29:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 22:29:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 205 transitions. [2019-10-01 22:29:08,093 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 205 transitions. Word has length 124 [2019-10-01 22:29:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:08,094 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 205 transitions. [2019-10-01 22:29:08,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:29:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 205 transitions. [2019-10-01 22:29:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 22:29:08,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:08,095 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:08,095 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash -334803347, now seen corresponding path program 33 times [2019-10-01 22:29:08,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:08,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:08,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:29:08,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:08,616 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:08,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:08,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:29:08,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:08,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:29:08,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1 proven. 287 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-10-01 22:29:09,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:09,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 17] total 51 [2019-10-01 22:29:09,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:29:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:29:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:29:09,215 INFO L87 Difference]: Start difference. First operand 173 states and 205 transitions. Second operand 51 states. [2019-10-01 22:29:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:09,498 INFO L93 Difference]: Finished difference Result 286 states and 356 transitions. [2019-10-01 22:29:09,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 22:29:09,499 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 126 [2019-10-01 22:29:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:09,501 INFO L225 Difference]: With dead ends: 286 [2019-10-01 22:29:09,501 INFO L226 Difference]: Without dead ends: 186 [2019-10-01 22:29:09,502 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:29:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-01 22:29:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2019-10-01 22:29:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 22:29:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2019-10-01 22:29:09,508 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 126 [2019-10-01 22:29:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:09,508 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2019-10-01 22:29:09,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:29:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2019-10-01 22:29:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 22:29:09,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:09,510 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:09,510 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash 912852824, now seen corresponding path program 34 times [2019-10-01 22:29:09,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:09,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:09,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:09,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:09,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-01 22:29:10,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:10,045 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:10,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:10,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:10,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:10,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 22:29:10,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-01 22:29:10,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:10,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 22:29:10,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:29:10,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:29:10,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:29:10,196 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand 38 states. [2019-10-01 22:29:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:10,313 INFO L93 Difference]: Finished difference Result 290 states and 358 transitions. [2019-10-01 22:29:10,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 22:29:10,315 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 131 [2019-10-01 22:29:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:10,317 INFO L225 Difference]: With dead ends: 290 [2019-10-01 22:29:10,317 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 22:29:10,318 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:29:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 22:29:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 22:29:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 22:29:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2019-10-01 22:29:10,323 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 131 [2019-10-01 22:29:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:10,324 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2019-10-01 22:29:10,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:29:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2019-10-01 22:29:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-01 22:29:10,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:10,325 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:10,325 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:10,325 INFO L82 PathProgramCache]: Analyzing trace with hash -906409226, now seen corresponding path program 35 times [2019-10-01 22:29:10,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:10,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:10,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-01 22:29:11,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:11,069 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:11,134 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:15,111 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 22:29:15,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:15,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:29:15,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 1 proven. 330 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-10-01 22:29:15,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:15,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 18] total 54 [2019-10-01 22:29:15,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:29:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:29:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=2007, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:29:15,472 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand 54 states. [2019-10-01 22:29:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:15,782 INFO L93 Difference]: Finished difference Result 302 states and 376 transitions. [2019-10-01 22:29:15,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:29:15,785 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 133 [2019-10-01 22:29:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:15,787 INFO L225 Difference]: With dead ends: 302 [2019-10-01 22:29:15,787 INFO L226 Difference]: Without dead ends: 196 [2019-10-01 22:29:15,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=855, Invalid=2007, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:29:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-01 22:29:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 191. [2019-10-01 22:29:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 22:29:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2019-10-01 22:29:15,794 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 133 [2019-10-01 22:29:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:15,794 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2019-10-01 22:29:15,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:29:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2019-10-01 22:29:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-01 22:29:15,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:15,796 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:15,796 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash 629050931, now seen corresponding path program 36 times [2019-10-01 22:29:15,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:15,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:15,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:15,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:15,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-10-01 22:29:16,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:16,431 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:16,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:37,282 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:29:37,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:37,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:29:37,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 1 proven. 376 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-10-01 22:29:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 19] total 56 [2019-10-01 22:29:37,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:29:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:29:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=911, Invalid=2169, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:29:37,682 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand 56 states. [2019-10-01 22:29:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:37,978 INFO L93 Difference]: Finished difference Result 316 states and 394 transitions. [2019-10-01 22:29:37,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 22:29:37,983 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 138 [2019-10-01 22:29:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:37,985 INFO L225 Difference]: With dead ends: 316 [2019-10-01 22:29:37,985 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 22:29:37,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=911, Invalid=2169, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:29:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 22:29:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2019-10-01 22:29:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 22:29:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2019-10-01 22:29:37,994 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 138 [2019-10-01 22:29:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:37,994 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2019-10-01 22:29:37,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:29:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2019-10-01 22:29:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 22:29:37,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:37,996 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:37,996 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash 355052754, now seen corresponding path program 37 times [2019-10-01 22:29:37,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:37,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:37,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:37,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:38,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:38,618 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:38,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:29:38,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1795 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:38,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:38,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:29:38,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:29:38,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:29:38,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:29:38,784 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand 41 states. [2019-10-01 22:29:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:38,909 INFO L93 Difference]: Finished difference Result 320 states and 396 transitions. [2019-10-01 22:29:38,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:29:38,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2019-10-01 22:29:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:38,911 INFO L225 Difference]: With dead ends: 320 [2019-10-01 22:29:38,911 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 22:29:38,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:29:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 22:29:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 22:29:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 22:29:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 239 transitions. [2019-10-01 22:29:38,917 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 239 transitions. Word has length 143 [2019-10-01 22:29:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:38,917 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 239 transitions. [2019-10-01 22:29:38,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:29:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 239 transitions. [2019-10-01 22:29:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-01 22:29:38,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:38,919 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:38,919 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:38,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1347122032, now seen corresponding path program 38 times [2019-10-01 22:29:38,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:38,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:39,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:39,564 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:39,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:39,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:39,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:29:39,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:39,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:39,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:29:39,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:29:39,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:29:39,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:29:39,720 INFO L87 Difference]: Start difference. First operand 201 states and 239 transitions. Second operand 42 states. [2019-10-01 22:29:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:39,877 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2019-10-01 22:29:39,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:29:39,878 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 145 [2019-10-01 22:29:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:39,879 INFO L225 Difference]: With dead ends: 322 [2019-10-01 22:29:39,879 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 22:29:39,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:29:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 22:29:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 22:29:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 22:29:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 241 transitions. [2019-10-01 22:29:39,885 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 241 transitions. Word has length 145 [2019-10-01 22:29:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:39,886 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 241 transitions. [2019-10-01 22:29:39,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:29:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2019-10-01 22:29:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 22:29:39,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:39,887 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:39,887 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:39,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1242958478, now seen corresponding path program 39 times [2019-10-01 22:29:39,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:39,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:39,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:39,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:39,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-01 22:29:40,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:40,694 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:40,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:41,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:29:41,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:41,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:29:41,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 1 proven. 425 refuted. 0 times theorem prover too weak. 1521 trivial. 0 not checked. [2019-10-01 22:29:41,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:41,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 20] total 60 [2019-10-01 22:29:41,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:29:41,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:29:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1050, Invalid=2490, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:29:41,898 INFO L87 Difference]: Start difference. First operand 203 states and 241 transitions. Second operand 60 states. [2019-10-01 22:29:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:42,222 INFO L93 Difference]: Finished difference Result 334 states and 416 transitions. [2019-10-01 22:29:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:29:42,224 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 147 [2019-10-01 22:29:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:42,225 INFO L225 Difference]: With dead ends: 334 [2019-10-01 22:29:42,225 INFO L226 Difference]: Without dead ends: 216 [2019-10-01 22:29:42,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1050, Invalid=2490, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:29:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-01 22:29:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2019-10-01 22:29:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-01 22:29:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2019-10-01 22:29:42,233 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 147 [2019-10-01 22:29:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:42,233 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2019-10-01 22:29:42,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:29:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2019-10-01 22:29:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 22:29:42,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:42,235 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:42,235 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1582799845, now seen corresponding path program 40 times [2019-10-01 22:29:42,236 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:42,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:42,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:42,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2078 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2019-10-01 22:29:43,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:43,022 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:43,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:43,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:43,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:43,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:29:43,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2078 backedges. 1 proven. 477 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-10-01 22:29:43,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:43,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 21] total 62 [2019-10-01 22:29:43,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:29:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:29:43,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=2670, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:29:43,636 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand 62 states. [2019-10-01 22:29:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:43,985 INFO L93 Difference]: Finished difference Result 348 states and 434 transitions. [2019-10-01 22:29:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 22:29:43,986 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2019-10-01 22:29:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:43,987 INFO L225 Difference]: With dead ends: 348 [2019-10-01 22:29:43,987 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 22:29:43,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1112, Invalid=2670, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:29:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 22:29:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-10-01 22:29:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-01 22:29:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 261 transitions. [2019-10-01 22:29:43,995 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 261 transitions. Word has length 152 [2019-10-01 22:29:43,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:43,995 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 261 transitions. [2019-10-01 22:29:43,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:29:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2019-10-01 22:29:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 22:29:43,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:43,996 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:43,997 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash 463806826, now seen corresponding path program 41 times [2019-10-01 22:29:43,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:43,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:43,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-10-01 22:29:45,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:45,187 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:45,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:47,317 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 22:29:47,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:47,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:29:47,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 1 proven. 532 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-10-01 22:29:47,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:47,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 22] total 64 [2019-10-01 22:29:47,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 22:29:47,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 22:29:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=2856, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:29:47,828 INFO L87 Difference]: Start difference. First operand 219 states and 261 transitions. Second operand 64 states. [2019-10-01 22:29:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:48,214 INFO L93 Difference]: Finished difference Result 362 states and 452 transitions. [2019-10-01 22:29:48,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 22:29:48,214 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 157 [2019-10-01 22:29:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:48,217 INFO L225 Difference]: With dead ends: 362 [2019-10-01 22:29:48,217 INFO L226 Difference]: Without dead ends: 232 [2019-10-01 22:29:48,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1176, Invalid=2856, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:29:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-01 22:29:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2019-10-01 22:29:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-01 22:29:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2019-10-01 22:29:48,225 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 157 [2019-10-01 22:29:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:48,225 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2019-10-01 22:29:48,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 22:29:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2019-10-01 22:29:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 22:29:48,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:48,227 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:48,227 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:48,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:48,227 INFO L82 PathProgramCache]: Analyzing trace with hash 983362879, now seen corresponding path program 42 times [2019-10-01 22:29:48,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:48,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:48,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:48,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:48,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-10-01 22:29:48,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:48,996 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:30:41,005 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-10-01 22:30:41,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:41,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:30:41,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 1 proven. 590 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-10-01 22:30:41,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:41,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 23] total 66 [2019-10-01 22:30:41,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:30:41,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:30:41,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=3048, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:30:41,746 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand 66 states. [2019-10-01 22:30:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:42,113 INFO L93 Difference]: Finished difference Result 376 states and 470 transitions. [2019-10-01 22:30:42,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:30:42,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 162 [2019-10-01 22:30:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:42,115 INFO L225 Difference]: With dead ends: 376 [2019-10-01 22:30:42,115 INFO L226 Difference]: Without dead ends: 240 [2019-10-01 22:30:42,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1242, Invalid=3048, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:30:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-01 22:30:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 235. [2019-10-01 22:30:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-01 22:30:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 281 transitions. [2019-10-01 22:30:42,122 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 281 transitions. Word has length 162 [2019-10-01 22:30:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:42,122 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 281 transitions. [2019-10-01 22:30:42,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:30:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 281 transitions. [2019-10-01 22:30:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 22:30:42,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:42,124 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:42,124 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1921476678, now seen corresponding path program 43 times [2019-10-01 22:30:42,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:42,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:42,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:42,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:42,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-01 22:30:42,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:42,947 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:43,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:43,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:30:43,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-01 22:30:43,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:43,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 22:30:43,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:30:43,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:30:43,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:30:43,134 INFO L87 Difference]: Start difference. First operand 235 states and 281 transitions. Second operand 47 states. [2019-10-01 22:30:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:43,311 INFO L93 Difference]: Finished difference Result 380 states and 472 transitions. [2019-10-01 22:30:43,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:30:43,312 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 167 [2019-10-01 22:30:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:43,313 INFO L225 Difference]: With dead ends: 380 [2019-10-01 22:30:43,313 INFO L226 Difference]: Without dead ends: 238 [2019-10-01 22:30:43,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:30:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-01 22:30:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-10-01 22:30:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-01 22:30:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 283 transitions. [2019-10-01 22:30:43,319 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 283 transitions. Word has length 167 [2019-10-01 22:30:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:43,319 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 283 transitions. [2019-10-01 22:30:43,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:30:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 283 transitions. [2019-10-01 22:30:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-01 22:30:43,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:43,321 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:43,321 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:43,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1945717532, now seen corresponding path program 44 times [2019-10-01 22:30:43,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:43,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:43,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:43,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:43,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2588 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-01 22:30:44,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:44,145 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:44,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:30:44,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:30:44,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:44,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:30:44,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2588 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:30:44,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:44,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:30:44,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:30:44,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:30:44,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:30:44,362 INFO L87 Difference]: Start difference. First operand 237 states and 283 transitions. Second operand 48 states. [2019-10-01 22:30:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:44,511 INFO L93 Difference]: Finished difference Result 382 states and 474 transitions. [2019-10-01 22:30:44,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:30:44,512 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 169 [2019-10-01 22:30:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:44,513 INFO L225 Difference]: With dead ends: 382 [2019-10-01 22:30:44,513 INFO L226 Difference]: Without dead ends: 240 [2019-10-01 22:30:44,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:30:44,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-01 22:30:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-10-01 22:30:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-01 22:30:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 285 transitions. [2019-10-01 22:30:44,519 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 285 transitions. Word has length 169 [2019-10-01 22:30:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:44,520 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 285 transitions. [2019-10-01 22:30:44,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:30:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 285 transitions. [2019-10-01 22:30:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-01 22:30:44,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:44,521 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:44,522 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:44,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:44,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1122324994, now seen corresponding path program 45 times [2019-10-01 22:30:44,522 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:44,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:44,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:44,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:44,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-01 22:30:45,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:45,738 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:30:47,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-10-01 22:30:47,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:47,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:30:47,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 1 proven. 651 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-10-01 22:30:47,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:47,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 24] total 70 [2019-10-01 22:30:47,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 22:30:47,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 22:30:47,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=3427, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:30:47,900 INFO L87 Difference]: Start difference. First operand 239 states and 285 transitions. Second operand 70 states. [2019-10-01 22:30:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:48,297 INFO L93 Difference]: Finished difference Result 394 states and 492 transitions. [2019-10-01 22:30:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 22:30:48,298 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 171 [2019-10-01 22:30:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:48,299 INFO L225 Difference]: With dead ends: 394 [2019-10-01 22:30:48,299 INFO L226 Difference]: Without dead ends: 252 [2019-10-01 22:30:48,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1403, Invalid=3427, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:30:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-01 22:30:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 247. [2019-10-01 22:30:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-01 22:30:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 295 transitions. [2019-10-01 22:30:48,306 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 295 transitions. Word has length 171 [2019-10-01 22:30:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:48,306 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 295 transitions. [2019-10-01 22:30:48,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 22:30:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 295 transitions. [2019-10-01 22:30:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 22:30:48,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:48,308 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:48,308 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1869885991, now seen corresponding path program 46 times [2019-10-01 22:30:48,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:48,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:48,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-10-01 22:30:49,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:49,222 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:49,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:30:49,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:30:49,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:49,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 22:30:49,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-10-01 22:30:49,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:49,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 22:30:49,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:30:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:30:49,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:30:49,457 INFO L87 Difference]: Start difference. First operand 247 states and 295 transitions. Second operand 50 states. [2019-10-01 22:30:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:49,649 INFO L93 Difference]: Finished difference Result 398 states and 494 transitions. [2019-10-01 22:30:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:30:49,649 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 176 [2019-10-01 22:30:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:49,650 INFO L225 Difference]: With dead ends: 398 [2019-10-01 22:30:49,651 INFO L226 Difference]: Without dead ends: 250 [2019-10-01 22:30:49,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:30:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-01 22:30:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-10-01 22:30:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-01 22:30:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 297 transitions. [2019-10-01 22:30:49,658 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 297 transitions. Word has length 176 [2019-10-01 22:30:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:49,658 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 297 transitions. [2019-10-01 22:30:49,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:30:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 297 transitions. [2019-10-01 22:30:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 22:30:49,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:49,664 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:49,664 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 666777417, now seen corresponding path program 47 times [2019-10-01 22:30:49,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:49,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:49,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:49,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2925 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-10-01 22:30:50,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:50,643 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:50,741 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:31:02,410 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-01 22:31:02,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:02,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:31:02,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2925 backedges. 1 proven. 715 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-10-01 22:31:03,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:03,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 25] total 73 [2019-10-01 22:31:03,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:31:03,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:31:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=3732, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:31:03,384 INFO L87 Difference]: Start difference. First operand 249 states and 297 transitions. Second operand 73 states. [2019-10-01 22:31:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:03,814 INFO L93 Difference]: Finished difference Result 410 states and 512 transitions. [2019-10-01 22:31:03,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:31:03,815 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 178 [2019-10-01 22:31:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:03,816 INFO L225 Difference]: With dead ends: 410 [2019-10-01 22:31:03,816 INFO L226 Difference]: Without dead ends: 262 [2019-10-01 22:31:03,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1524, Invalid=3732, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:31:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-01 22:31:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 257. [2019-10-01 22:31:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-10-01 22:31:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2019-10-01 22:31:03,826 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 178 [2019-10-01 22:31:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:03,826 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2019-10-01 22:31:03,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:31:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2019-10-01 22:31:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-01 22:31:03,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:03,832 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:03,832 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1277062652, now seen corresponding path program 48 times [2019-10-01 22:31:03,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:03,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:03,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:03,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:03,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3087 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2019-10-01 22:31:04,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:04,835 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:31:43,549 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-10-01 22:31:43,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:43,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:31:43,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3087 backedges. 1 proven. 782 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-10-01 22:31:44,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:44,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 26] total 75 [2019-10-01 22:31:44,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-01 22:31:44,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-01 22:31:44,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=3951, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 22:31:44,269 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand 75 states. [2019-10-01 22:31:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:44,724 INFO L93 Difference]: Finished difference Result 424 states and 530 transitions. [2019-10-01 22:31:44,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-01 22:31:44,724 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 183 [2019-10-01 22:31:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:44,726 INFO L225 Difference]: With dead ends: 424 [2019-10-01 22:31:44,726 INFO L226 Difference]: Without dead ends: 270 [2019-10-01 22:31:44,727 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1599, Invalid=3951, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 22:31:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-01 22:31:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 265. [2019-10-01 22:31:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-01 22:31:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 317 transitions. [2019-10-01 22:31:44,733 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 317 transitions. Word has length 183 [2019-10-01 22:31:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:44,734 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 317 transitions. [2019-10-01 22:31:44,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-01 22:31:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 317 transitions. [2019-10-01 22:31:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-01 22:31:44,735 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:44,736 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:44,736 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1577941229, now seen corresponding path program 49 times [2019-10-01 22:31:44,736 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:44,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:44,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3254 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:31:45,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:45,847 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:45,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:46,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 22:31:46,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3254 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:31:46,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:46,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 22:31:46,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:31:46,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:31:46,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:31:46,076 INFO L87 Difference]: Start difference. First operand 265 states and 317 transitions. Second operand 53 states. [2019-10-01 22:31:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:46,274 INFO L93 Difference]: Finished difference Result 428 states and 532 transitions. [2019-10-01 22:31:46,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 22:31:46,274 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 188 [2019-10-01 22:31:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:46,276 INFO L225 Difference]: With dead ends: 428 [2019-10-01 22:31:46,276 INFO L226 Difference]: Without dead ends: 268 [2019-10-01 22:31:46,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:31:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-01 22:31:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2019-10-01 22:31:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-01 22:31:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 319 transitions. [2019-10-01 22:31:46,281 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 319 transitions. Word has length 188 [2019-10-01 22:31:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:46,281 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 319 transitions. [2019-10-01 22:31:46,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:31:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 319 transitions. [2019-10-01 22:31:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-01 22:31:46,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:46,283 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:46,283 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash 870243087, now seen corresponding path program 50 times [2019-10-01 22:31:46,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:46,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3353 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:31:47,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:47,423 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:47,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:31:47,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:31:47,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:47,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 22:31:47,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3353 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:31:47,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:47,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 22:31:47,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:31:47,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:31:47,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:31:47,656 INFO L87 Difference]: Start difference. First operand 267 states and 319 transitions. Second operand 54 states. [2019-10-01 22:31:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:47,889 INFO L93 Difference]: Finished difference Result 430 states and 534 transitions. [2019-10-01 22:31:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:31:47,889 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 190 [2019-10-01 22:31:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:47,891 INFO L225 Difference]: With dead ends: 430 [2019-10-01 22:31:47,891 INFO L226 Difference]: Without dead ends: 270 [2019-10-01 22:31:47,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:31:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-01 22:31:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-10-01 22:31:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-01 22:31:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 321 transitions. [2019-10-01 22:31:47,897 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 321 transitions. Word has length 190 [2019-10-01 22:31:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:47,898 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 321 transitions. [2019-10-01 22:31:47,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:31:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 321 transitions. [2019-10-01 22:31:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 22:31:47,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:47,899 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:47,900 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:47,900 INFO L82 PathProgramCache]: Analyzing trace with hash -622838607, now seen corresponding path program 51 times [2019-10-01 22:31:47,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:47,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:47,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:47,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2019-10-01 22:31:49,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:49,262 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:49,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:31:51,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-10-01 22:31:51,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:51,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:31:51,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 1 proven. 852 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-10-01 22:31:52,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:52,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 27] total 79 [2019-10-01 22:31:52,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 22:31:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 22:31:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1781, Invalid=4381, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:31:52,523 INFO L87 Difference]: Start difference. First operand 269 states and 321 transitions. Second operand 79 states. [2019-10-01 22:31:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:52,946 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2019-10-01 22:31:52,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 22:31:52,947 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 192 [2019-10-01 22:31:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:52,948 INFO L225 Difference]: With dead ends: 442 [2019-10-01 22:31:52,948 INFO L226 Difference]: Without dead ends: 282 [2019-10-01 22:31:52,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1781, Invalid=4381, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:31:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-01 22:31:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 277. [2019-10-01 22:31:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-01 22:31:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2019-10-01 22:31:52,954 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 192 [2019-10-01 22:31:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:52,954 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2019-10-01 22:31:52,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 22:31:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2019-10-01 22:31:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-01 22:31:52,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:52,956 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:52,956 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:52,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:52,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1272970476, now seen corresponding path program 52 times [2019-10-01 22:31:52,957 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:52,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:52,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2019-10-01 22:31:54,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:54,270 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:54,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:31:54,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:31:54,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:54,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 22:31:54,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2019-10-01 22:31:54,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:54,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 22:31:54,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:31:54,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:31:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:31:54,528 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand 56 states. [2019-10-01 22:31:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:54,769 INFO L93 Difference]: Finished difference Result 446 states and 554 transitions. [2019-10-01 22:31:54,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:31:54,770 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 197 [2019-10-01 22:31:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:54,772 INFO L225 Difference]: With dead ends: 446 [2019-10-01 22:31:54,772 INFO L226 Difference]: Without dead ends: 280 [2019-10-01 22:31:54,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:31:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-01 22:31:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2019-10-01 22:31:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-01 22:31:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 333 transitions. [2019-10-01 22:31:54,778 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 333 transitions. Word has length 197 [2019-10-01 22:31:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:54,778 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 333 transitions. [2019-10-01 22:31:54,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:31:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 333 transitions. [2019-10-01 22:31:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-01 22:31:54,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:54,780 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:54,780 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:54,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1753081650, now seen corresponding path program 53 times [2019-10-01 22:31:54,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:54,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:54,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2019-10-01 22:31:55,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:55,950 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:56,048 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:32:28,125 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 22:32:28,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:28,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:32:28,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 1 proven. 925 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-10-01 22:32:29,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:29,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 28] total 82 [2019-10-01 22:32:29,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:32:29,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:32:29,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1917, Invalid=4725, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:32:29,143 INFO L87 Difference]: Start difference. First operand 279 states and 333 transitions. Second operand 82 states. [2019-10-01 22:32:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:29,611 INFO L93 Difference]: Finished difference Result 458 states and 572 transitions. [2019-10-01 22:32:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:32:29,614 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 199 [2019-10-01 22:32:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:29,615 INFO L225 Difference]: With dead ends: 458 [2019-10-01 22:32:29,615 INFO L226 Difference]: Without dead ends: 292 [2019-10-01 22:32:29,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1917, Invalid=4725, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:32:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-01 22:32:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2019-10-01 22:32:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-01 22:32:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 343 transitions. [2019-10-01 22:32:29,622 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 343 transitions. Word has length 199 [2019-10-01 22:32:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:29,623 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 343 transitions. [2019-10-01 22:32:29,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:32:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 343 transitions. [2019-10-01 22:32:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 22:32:29,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:29,624 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:29,625 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:29,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1218602999, now seen corresponding path program 54 times [2019-10-01 22:32:29,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:29,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:29,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:32:30,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:30,837 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:32:30,938 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:35:40,356 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-10-01 22:35:40,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:40,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 22:35:40,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:35:40,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:40,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-10-01 22:35:40,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:35:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:35:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:35:40,470 INFO L87 Difference]: Start difference. First operand 287 states and 343 transitions. Second operand 58 states. [2019-10-01 22:35:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:40,626 INFO L93 Difference]: Finished difference Result 462 states and 574 transitions. [2019-10-01 22:35:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 22:35:40,628 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 204 [2019-10-01 22:35:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:40,630 INFO L225 Difference]: With dead ends: 462 [2019-10-01 22:35:40,630 INFO L226 Difference]: Without dead ends: 290 [2019-10-01 22:35:40,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:35:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-01 22:35:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-10-01 22:35:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-01 22:35:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 345 transitions. [2019-10-01 22:35:40,637 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 345 transitions. Word has length 204 [2019-10-01 22:35:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:40,637 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 345 transitions. [2019-10-01 22:35:40,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:35:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 345 transitions. [2019-10-01 22:35:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-01 22:35:40,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:40,639 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:40,639 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:40,639 INFO L82 PathProgramCache]: Analyzing trace with hash 436160025, now seen corresponding path program 55 times [2019-10-01 22:35:40,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:40,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:40,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4027 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:35:42,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:42,016 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:42,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:35:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:42,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 22:35:42,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4027 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:35:42,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:42,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 22:35:42,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:35:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:35:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:35:42,292 INFO L87 Difference]: Start difference. First operand 289 states and 345 transitions. Second operand 59 states. [2019-10-01 22:35:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:42,502 INFO L93 Difference]: Finished difference Result 464 states and 576 transitions. [2019-10-01 22:35:42,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:35:42,502 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 206 [2019-10-01 22:35:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:42,504 INFO L225 Difference]: With dead ends: 464 [2019-10-01 22:35:42,504 INFO L226 Difference]: Without dead ends: 292 [2019-10-01 22:35:42,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:35:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-01 22:35:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-10-01 22:35:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-01 22:35:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 347 transitions. [2019-10-01 22:35:42,511 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 347 transitions. Word has length 206 [2019-10-01 22:35:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:42,511 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 347 transitions. [2019-10-01 22:35:42,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:35:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 347 transitions. [2019-10-01 22:35:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-01 22:35:42,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:42,513 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:42,513 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 127738811, now seen corresponding path program 56 times [2019-10-01 22:35:42,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:42,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:42,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:35:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:35:43,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:43,927 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:44,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:35:44,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:35:44,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:44,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 22:35:44,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:35:44,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:44,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 22:35:44,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:35:44,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:35:44,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:35:44,184 INFO L87 Difference]: Start difference. First operand 291 states and 347 transitions. Second operand 60 states. [2019-10-01 22:35:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:44,424 INFO L93 Difference]: Finished difference Result 466 states and 578 transitions. [2019-10-01 22:35:44,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 22:35:44,425 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 208 [2019-10-01 22:35:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:44,426 INFO L225 Difference]: With dead ends: 466 [2019-10-01 22:35:44,426 INFO L226 Difference]: Without dead ends: 294 [2019-10-01 22:35:44,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:35:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-01 22:35:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-10-01 22:35:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-01 22:35:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 349 transitions. [2019-10-01 22:35:44,431 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 349 transitions. Word has length 208 [2019-10-01 22:35:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:44,431 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 349 transitions. [2019-10-01 22:35:44,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:35:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 349 transitions. [2019-10-01 22:35:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-01 22:35:44,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:44,433 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:44,433 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash 87695581, now seen corresponding path program 57 times [2019-10-01 22:35:44,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:44,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:44,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4251 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-10-01 22:35:45,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:45,933 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:46,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:35:50,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-10-01 22:35:50,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:50,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:35:50,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4251 backedges. 1 proven. 1001 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-10-01 22:35:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:51,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 29] total 87 [2019-10-01 22:35:51,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-01 22:35:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-01 22:35:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2175, Invalid=5307, Unknown=0, NotChecked=0, Total=7482 [2019-10-01 22:35:51,063 INFO L87 Difference]: Start difference. First operand 293 states and 349 transitions. Second operand 87 states. [2019-10-01 22:35:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:51,557 INFO L93 Difference]: Finished difference Result 478 states and 596 transitions. [2019-10-01 22:35:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-01 22:35:51,558 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 210 [2019-10-01 22:35:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:51,559 INFO L225 Difference]: With dead ends: 478 [2019-10-01 22:35:51,559 INFO L226 Difference]: Without dead ends: 306 [2019-10-01 22:35:51,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2175, Invalid=5307, Unknown=0, NotChecked=0, Total=7482 [2019-10-01 22:35:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-01 22:35:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2019-10-01 22:35:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-01 22:35:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 359 transitions. [2019-10-01 22:35:51,567 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 359 transitions. Word has length 210 [2019-10-01 22:35:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:51,567 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 359 transitions. [2019-10-01 22:35:51,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-01 22:35:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 359 transitions. [2019-10-01 22:35:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-01 22:35:51,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:51,569 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:51,569 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 314127336, now seen corresponding path program 58 times [2019-10-01 22:35:51,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:51,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 22:35:52,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:52,935 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:53,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:35:53,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:35:53,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:53,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 22:35:53,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 22:35:53,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:53,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 22:35:53,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:35:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:35:53,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:35:53,203 INFO L87 Difference]: Start difference. First operand 301 states and 359 transitions. Second operand 62 states. [2019-10-01 22:35:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:53,467 INFO L93 Difference]: Finished difference Result 482 states and 598 transitions. [2019-10-01 22:35:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 22:35:53,467 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 215 [2019-10-01 22:35:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:53,468 INFO L225 Difference]: With dead ends: 482 [2019-10-01 22:35:53,468 INFO L226 Difference]: Without dead ends: 304 [2019-10-01 22:35:53,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:35:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-01 22:35:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2019-10-01 22:35:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-10-01 22:35:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 361 transitions. [2019-10-01 22:35:53,475 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 361 transitions. Word has length 215 [2019-10-01 22:35:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:53,475 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 361 transitions. [2019-10-01 22:35:53,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:35:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 361 transitions. [2019-10-01 22:35:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-01 22:35:53,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:53,477 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:53,477 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:53,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:53,477 INFO L82 PathProgramCache]: Analyzing trace with hash 584944774, now seen corresponding path program 59 times [2019-10-01 22:35:53,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:53,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:53,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:53,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:53,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-01 22:35:54,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:54,945 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:55,054 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:36:31,427 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-10-01 22:36:31,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:31,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:36:31,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 1 proven. 1080 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2019-10-01 22:36:32,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:32,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 30] total 90 [2019-10-01 22:36:32,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-01 22:36:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-01 22:36:32,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2325, Invalid=5685, Unknown=0, NotChecked=0, Total=8010 [2019-10-01 22:36:32,379 INFO L87 Difference]: Start difference. First operand 303 states and 361 transitions. Second operand 90 states. [2019-10-01 22:36:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:32,892 INFO L93 Difference]: Finished difference Result 494 states and 616 transitions. [2019-10-01 22:36:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-01 22:36:32,892 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 217 [2019-10-01 22:36:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:32,894 INFO L225 Difference]: With dead ends: 494 [2019-10-01 22:36:32,894 INFO L226 Difference]: Without dead ends: 316 [2019-10-01 22:36:32,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2325, Invalid=5685, Unknown=0, NotChecked=0, Total=8010 [2019-10-01 22:36:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-10-01 22:36:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2019-10-01 22:36:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-01 22:36:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 371 transitions. [2019-10-01 22:36:32,899 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 371 transitions. Word has length 217 [2019-10-01 22:36:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:32,899 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 371 transitions. [2019-10-01 22:36:32,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-01 22:36:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 371 transitions. [2019-10-01 22:36:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 22:36:32,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:32,901 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:32,901 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:32,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1516687965, now seen corresponding path program 60 times [2019-10-01 22:36:32,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:32,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:32,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:32,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:32,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4763 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2019-10-01 22:36:34,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:34,381 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:34,516 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:38:10,759 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2019-10-01 22:38:10,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:38:10,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:38:10,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:38:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4763 backedges. 1 proven. 1162 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-10-01 22:38:11,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:38:11,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 31] total 92 [2019-10-01 22:38:11,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-10-01 22:38:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-10-01 22:38:11,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=5955, Unknown=0, NotChecked=0, Total=8372 [2019-10-01 22:38:11,781 INFO L87 Difference]: Start difference. First operand 311 states and 371 transitions. Second operand 92 states. [2019-10-01 22:38:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:38:12,251 INFO L93 Difference]: Finished difference Result 508 states and 634 transitions. [2019-10-01 22:38:12,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-10-01 22:38:12,252 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 222 [2019-10-01 22:38:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:38:12,253 INFO L225 Difference]: With dead ends: 508 [2019-10-01 22:38:12,254 INFO L226 Difference]: Without dead ends: 324 [2019-10-01 22:38:12,255 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2417, Invalid=5955, Unknown=0, NotChecked=0, Total=8372 [2019-10-01 22:38:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-01 22:38:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2019-10-01 22:38:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-01 22:38:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 381 transitions. [2019-10-01 22:38:12,260 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 381 transitions. Word has length 222 [2019-10-01 22:38:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:38:12,261 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 381 transitions. [2019-10-01 22:38:12,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-10-01 22:38:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 381 transitions. [2019-10-01 22:38:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-01 22:38:12,262 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:38:12,263 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:38:12,263 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:38:12,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:38:12,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1166503010, now seen corresponding path program 61 times [2019-10-01 22:38:12,263 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:38:12,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:38:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:12,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:38:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:38:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4969 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:38:13,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:38:13,793 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:38:13,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:38:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:38:14,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 22:38:14,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:38:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4969 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:38:14,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:38:14,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-10-01 22:38:14,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 22:38:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 22:38:14,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:38:14,077 INFO L87 Difference]: Start difference. First operand 319 states and 381 transitions. Second operand 65 states. [2019-10-01 22:38:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:38:14,295 INFO L93 Difference]: Finished difference Result 512 states and 636 transitions. [2019-10-01 22:38:14,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 22:38:14,297 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 227 [2019-10-01 22:38:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:38:14,298 INFO L225 Difference]: With dead ends: 512 [2019-10-01 22:38:14,298 INFO L226 Difference]: Without dead ends: 322 [2019-10-01 22:38:14,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:38:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-01 22:38:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-10-01 22:38:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-01 22:38:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 383 transitions. [2019-10-01 22:38:14,305 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 383 transitions. Word has length 227 [2019-10-01 22:38:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:38:14,306 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 383 transitions. [2019-10-01 22:38:14,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 22:38:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 383 transitions. [2019-10-01 22:38:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-01 22:38:14,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:38:14,308 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:38:14,308 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:38:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:38:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2126891008, now seen corresponding path program 62 times [2019-10-01 22:38:14,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:38:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:38:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:14,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:38:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:38:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5092 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:38:15,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:38:15,852 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:38:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:38:16,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:38:16,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:38:16,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-01 22:38:16,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:38:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5092 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:38:16,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:38:16,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-10-01 22:38:16,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:38:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:38:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:38:16,149 INFO L87 Difference]: Start difference. First operand 321 states and 383 transitions. Second operand 66 states. [2019-10-01 22:38:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:38:16,383 INFO L93 Difference]: Finished difference Result 514 states and 638 transitions. [2019-10-01 22:38:16,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 22:38:16,383 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 229 [2019-10-01 22:38:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:38:16,385 INFO L225 Difference]: With dead ends: 514 [2019-10-01 22:38:16,385 INFO L226 Difference]: Without dead ends: 324 [2019-10-01 22:38:16,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:38:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-01 22:38:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2019-10-01 22:38:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-01 22:38:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 385 transitions. [2019-10-01 22:38:16,394 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 385 transitions. Word has length 229 [2019-10-01 22:38:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:38:16,394 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 385 transitions. [2019-10-01 22:38:16,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:38:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 385 transitions. [2019-10-01 22:38:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-01 22:38:16,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:38:16,396 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:38:16,396 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:38:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:38:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1641788446, now seen corresponding path program 63 times [2019-10-01 22:38:16,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:38:16,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:38:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:16,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:38:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:38:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5217 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-10-01 22:38:17,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:38:17,965 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:38:18,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:38:24,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-10-01 22:38:24,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:38:24,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:38:24,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:38:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5217 backedges. 1 proven. 1247 refuted. 0 times theorem prover too weak. 3969 trivial. 0 not checked. [2019-10-01 22:38:25,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:38:25,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 32] total 96 [2019-10-01 22:38:25,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-10-01 22:38:25,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-10-01 22:38:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=6480, Unknown=0, NotChecked=0, Total=9120 [2019-10-01 22:38:25,577 INFO L87 Difference]: Start difference. First operand 323 states and 385 transitions. Second operand 96 states. [2019-10-01 22:38:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:38:26,013 INFO L93 Difference]: Finished difference Result 526 states and 656 transitions. [2019-10-01 22:38:26,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-01 22:38:26,014 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2019-10-01 22:38:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:38:26,016 INFO L225 Difference]: With dead ends: 526 [2019-10-01 22:38:26,016 INFO L226 Difference]: Without dead ends: 336 [2019-10-01 22:38:26,018 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2640, Invalid=6480, Unknown=0, NotChecked=0, Total=9120 [2019-10-01 22:38:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-01 22:38:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 331. [2019-10-01 22:38:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-10-01 22:38:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 395 transitions. [2019-10-01 22:38:26,024 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 395 transitions. Word has length 231 [2019-10-01 22:38:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:38:26,025 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 395 transitions. [2019-10-01 22:38:26,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-10-01 22:38:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 395 transitions. [2019-10-01 22:38:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 22:38:26,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:38:26,026 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:38:26,027 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:38:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:38:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1046043531, now seen corresponding path program 64 times [2019-10-01 22:38:26,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:38:26,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:38:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:26,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:38:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:38:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5432 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2019-10-01 22:38:27,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:38:27,687 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:38:27,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:38:27,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:38:27,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:38:27,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 22:38:27,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:38:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5432 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2019-10-01 22:38:28,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:38:28,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 22:38:28,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:38:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:38:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:38:28,031 INFO L87 Difference]: Start difference. First operand 331 states and 395 transitions. Second operand 68 states. [2019-10-01 22:38:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:38:28,279 INFO L93 Difference]: Finished difference Result 530 states and 658 transitions. [2019-10-01 22:38:28,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 22:38:28,279 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 236 [2019-10-01 22:38:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:38:28,281 INFO L225 Difference]: With dead ends: 530 [2019-10-01 22:38:28,281 INFO L226 Difference]: Without dead ends: 334 [2019-10-01 22:38:28,282 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:38:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-01 22:38:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-10-01 22:38:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-10-01 22:38:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 397 transitions. [2019-10-01 22:38:28,288 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 397 transitions. Word has length 236 [2019-10-01 22:38:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:38:28,289 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 397 transitions. [2019-10-01 22:38:28,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:38:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 397 transitions. [2019-10-01 22:38:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 22:38:28,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:38:28,291 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:38:28,291 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:38:28,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:38:28,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1801793965, now seen corresponding path program 65 times [2019-10-01 22:38:28,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:38:28,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:38:28,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:28,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:38:28,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:38:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:38:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5561 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2019-10-01 22:38:29,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:38:29,994 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:38:30,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:39:40,995 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-10-01 22:39:40,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:39:41,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:39:41,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:39:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5561 backedges. 1 proven. 1335 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2019-10-01 22:39:42,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:39:42,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 33] total 99 [2019-10-01 22:39:42,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-01 22:39:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-01 22:39:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2805, Invalid=6897, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 22:39:42,190 INFO L87 Difference]: Start difference. First operand 333 states and 397 transitions. Second operand 99 states. [2019-10-01 22:39:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:39:42,717 INFO L93 Difference]: Finished difference Result 542 states and 676 transitions. [2019-10-01 22:39:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-01 22:39:42,717 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 238 [2019-10-01 22:39:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:39:42,719 INFO L225 Difference]: With dead ends: 542 [2019-10-01 22:39:42,719 INFO L226 Difference]: Without dead ends: 346 [2019-10-01 22:39:42,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2805, Invalid=6897, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 22:39:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-01 22:39:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 341. [2019-10-01 22:39:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-10-01 22:39:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 407 transitions. [2019-10-01 22:39:42,724 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 407 transitions. Word has length 238 [2019-10-01 22:39:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:39:42,724 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 407 transitions. [2019-10-01 22:39:42,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-01 22:39:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 407 transitions. [2019-10-01 22:39:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-01 22:39:42,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:39:42,726 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:39:42,726 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:39:42,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:39:42,727 INFO L82 PathProgramCache]: Analyzing trace with hash 289634328, now seen corresponding path program 66 times [2019-10-01 22:39:42,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:39:42,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:39:42,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:42,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:39:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:39:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:39:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5783 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-01 22:39:44,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:39:44,401 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:39:44,542 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE