java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:04:34,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:04:34,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:04:34,286 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:04:34,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:04:34,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:04:34,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:04:34,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:04:34,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:04:34,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:04:34,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:04:34,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:04:34,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:04:34,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:04:34,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:04:34,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:04:34,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:04:34,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:04:34,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:04:34,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:04:34,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:04:34,311 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:04:34,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:04:34,317 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:04:34,317 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:04:34,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:04:34,319 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:04:34,320 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:04:34,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:04:34,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:04:34,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:04:34,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:04:34,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:04:34,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:04:34,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:04:34,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:04:34,329 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:04:34,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:04:34,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:04:34,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:04:34,357 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:04:34,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:04:34,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:04:34,359 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:04:34,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:04:34,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:04:34,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:04:34,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:04:34,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:04:34,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:04:34,361 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:04:34,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:04:34,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:04:34,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:04:34,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:04:34,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:04:34,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:04:34,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:04:34,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:04:34,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:04:34,364 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:04:34,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:04:34,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:04:34,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:04:34,365 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:04:34,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:04:34,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:04:34,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:04:34,451 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:04:34,451 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:04:34,452 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-11-06 22:04:34,517 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38280dfd5/5d0379c22dae47b8b16cf363b4111b6f/FLAG30d1837c1 [2018-11-06 22:04:35,026 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:04:35,027 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-11-06 22:04:35,041 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38280dfd5/5d0379c22dae47b8b16cf363b4111b6f/FLAG30d1837c1 [2018-11-06 22:04:35,055 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38280dfd5/5d0379c22dae47b8b16cf363b4111b6f [2018-11-06 22:04:35,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:04:35,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:04:35,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:04:35,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:04:35,070 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:04:35,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386f4038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35, skipping insertion in model container [2018-11-06 22:04:35,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:04:35,143 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:04:35,560 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:04:35,565 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:04:35,657 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:04:35,674 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:04:35,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35 WrapperNode [2018-11-06 22:04:35,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:04:35,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:04:35,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:04:35,677 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:04:35,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:04:35,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:04:35,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:04:35,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:04:35,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (1/1) ... [2018-11-06 22:04:35,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:04:35,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:04:35,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:04:35,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:04:35,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (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 [2018-11-06 22:04:35,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:04:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:04:37,741 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:04:37,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:37 BoogieIcfgContainer [2018-11-06 22:04:37,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:04:37,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:04:37,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:04:37,747 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:04:37,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:04:35" (1/3) ... [2018-11-06 22:04:37,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7337a87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:37, skipping insertion in model container [2018-11-06 22:04:37,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:35" (2/3) ... [2018-11-06 22:04:37,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7337a87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:37, skipping insertion in model container [2018-11-06 22:04:37,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:37" (3/3) ... [2018-11-06 22:04:37,751 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-11-06 22:04:37,760 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:04:37,769 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:04:37,786 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:04:37,820 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:04:37,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:04:37,821 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:04:37,821 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:04:37,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:04:37,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:04:37,822 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:04:37,822 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:04:37,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:04:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-11-06 22:04:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-06 22:04:37,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:37,860 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:37,863 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:37,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -977991394, now seen corresponding path program 1 times [2018-11-06 22:04:37,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:37,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:37,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:38,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:38,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 22:04:38,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-06 22:04:38,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-06 22:04:38,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:04:38,051 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2018-11-06 22:04:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:38,089 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2018-11-06 22:04:38,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 22:04:38,093 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-06 22:04:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:38,108 INFO L225 Difference]: With dead ends: 218 [2018-11-06 22:04:38,108 INFO L226 Difference]: Without dead ends: 106 [2018-11-06 22:04:38,113 INFO L604 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 [2018-11-06 22:04:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-06 22:04:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-06 22:04:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-06 22:04:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2018-11-06 22:04:38,165 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2018-11-06 22:04:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:38,166 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2018-11-06 22:04:38,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-06 22:04:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2018-11-06 22:04:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-06 22:04:38,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:38,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:38,168 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:38,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash 279525351, now seen corresponding path program 1 times [2018-11-06 22:04:38,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:38,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:38,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:38,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:38,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:04:38,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:04:38,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:04:38,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:04:38,298 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2018-11-06 22:04:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:38,529 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2018-11-06 22:04:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:04:38,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-06 22:04:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:38,532 INFO L225 Difference]: With dead ends: 214 [2018-11-06 22:04:38,532 INFO L226 Difference]: Without dead ends: 110 [2018-11-06 22:04:38,534 INFO L604 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 [2018-11-06 22:04:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-06 22:04:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-06 22:04:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-06 22:04:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2018-11-06 22:04:38,546 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2018-11-06 22:04:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:38,546 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2018-11-06 22:04:38,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:04:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2018-11-06 22:04:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-06 22:04:38,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:38,548 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:38,548 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:38,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1710410508, now seen corresponding path program 1 times [2018-11-06 22:04:38,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:38,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:38,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:38,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:38,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:38,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:04:38,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:04:38,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:04:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:04:38,684 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 3 states. [2018-11-06 22:04:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:39,308 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2018-11-06 22:04:39,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:04:39,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-06 22:04:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:39,313 INFO L225 Difference]: With dead ends: 324 [2018-11-06 22:04:39,313 INFO L226 Difference]: Without dead ends: 195 [2018-11-06 22:04:39,315 INFO L604 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 [2018-11-06 22:04:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-06 22:04:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-11-06 22:04:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-06 22:04:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2018-11-06 22:04:39,332 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2018-11-06 22:04:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:39,333 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2018-11-06 22:04:39,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:04:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2018-11-06 22:04:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-06 22:04:39,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:39,335 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:39,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:39,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:39,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1268129073, now seen corresponding path program 1 times [2018-11-06 22:04:39,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:39,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:39,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:39,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:39,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:04:39,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:04:39,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:04:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:04:39,412 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2018-11-06 22:04:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:39,582 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2018-11-06 22:04:39,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:04:39,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-06 22:04:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:39,585 INFO L225 Difference]: With dead ends: 314 [2018-11-06 22:04:39,585 INFO L226 Difference]: Without dead ends: 133 [2018-11-06 22:04:39,586 INFO L604 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 [2018-11-06 22:04:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-06 22:04:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-06 22:04:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-06 22:04:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2018-11-06 22:04:39,597 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2018-11-06 22:04:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:39,598 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2018-11-06 22:04:39,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:04:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2018-11-06 22:04:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-06 22:04:39,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:39,600 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:39,600 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:39,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1534733406, now seen corresponding path program 1 times [2018-11-06 22:04:39,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:39,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:39,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-06 22:04:39,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:39,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:04:39,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:04:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:04:39,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:04:39,725 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2018-11-06 22:04:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:39,934 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2018-11-06 22:04:39,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:04:39,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-06 22:04:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:39,936 INFO L225 Difference]: With dead ends: 243 [2018-11-06 22:04:39,937 INFO L226 Difference]: Without dead ends: 115 [2018-11-06 22:04:39,937 INFO L604 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 [2018-11-06 22:04:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-06 22:04:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-06 22:04:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-06 22:04:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2018-11-06 22:04:39,946 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2018-11-06 22:04:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:39,946 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2018-11-06 22:04:39,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:04:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2018-11-06 22:04:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-06 22:04:39,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:39,948 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:39,948 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:39,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:39,949 INFO L82 PathProgramCache]: Analyzing trace with hash -478960449, now seen corresponding path program 1 times [2018-11-06 22:04:39,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:39,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:39,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:39,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:39,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:40,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:40,113 INFO L225 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 [2018-11-06 22:04:40,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:40,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:40,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:40,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-06 22:04:40,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:04:40,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:04:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:40,376 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2018-11-06 22:04:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:41,691 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2018-11-06 22:04:41,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:04:41,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-06 22:04:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:41,694 INFO L225 Difference]: With dead ends: 204 [2018-11-06 22:04:41,694 INFO L226 Difference]: Without dead ends: 192 [2018-11-06 22:04:41,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-06 22:04:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2018-11-06 22:04:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-06 22:04:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2018-11-06 22:04:41,707 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2018-11-06 22:04:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:41,708 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2018-11-06 22:04:41,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:04:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2018-11-06 22:04:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-06 22:04:41,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:41,710 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:41,710 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:41,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:41,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1951428508, now seen corresponding path program 1 times [2018-11-06 22:04:41,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:41,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:41,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:41,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:41,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:41,877 INFO L225 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 [2018-11-06 22:04:41,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:41,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:42,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:42,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-06 22:04:42,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:04:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:04:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:42,121 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 5 states. [2018-11-06 22:04:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:42,401 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2018-11-06 22:04:42,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:04:42,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-06 22:04:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:42,405 INFO L225 Difference]: With dead ends: 387 [2018-11-06 22:04:42,405 INFO L226 Difference]: Without dead ends: 230 [2018-11-06 22:04:42,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-06 22:04:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2018-11-06 22:04:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-06 22:04:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2018-11-06 22:04:42,417 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2018-11-06 22:04:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:42,418 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2018-11-06 22:04:42,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:04:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2018-11-06 22:04:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-06 22:04:42,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:42,419 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:42,420 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:42,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1318541348, now seen corresponding path program 1 times [2018-11-06 22:04:42,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:42,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:42,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:42,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:42,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-06 22:04:42,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:42,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:04:42,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:04:42,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:04:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:04:42,550 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2018-11-06 22:04:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:42,811 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2018-11-06 22:04:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:04:42,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-06 22:04:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:42,813 INFO L225 Difference]: With dead ends: 409 [2018-11-06 22:04:42,813 INFO L226 Difference]: Without dead ends: 211 [2018-11-06 22:04:42,814 INFO L604 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 [2018-11-06 22:04:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-06 22:04:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-11-06 22:04:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-06 22:04:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2018-11-06 22:04:42,823 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2018-11-06 22:04:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:42,823 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2018-11-06 22:04:42,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:04:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2018-11-06 22:04:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-06 22:04:42,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:42,825 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:42,826 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:42,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:42,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1553389745, now seen corresponding path program 1 times [2018-11-06 22:04:42,826 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:42,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:42,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-06 22:04:42,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:42,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:04:42,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:04:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:04:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:04:42,919 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2018-11-06 22:04:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:43,010 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2018-11-06 22:04:43,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:04:43,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-06 22:04:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:43,013 INFO L225 Difference]: With dead ends: 375 [2018-11-06 22:04:43,013 INFO L226 Difference]: Without dead ends: 211 [2018-11-06 22:04:43,014 INFO L604 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 [2018-11-06 22:04:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-06 22:04:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-11-06 22:04:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-06 22:04:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2018-11-06 22:04:43,021 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2018-11-06 22:04:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:43,021 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2018-11-06 22:04:43,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:04:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2018-11-06 22:04:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-06 22:04:43,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:43,023 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:43,024 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:43,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1840811351, now seen corresponding path program 1 times [2018-11-06 22:04:43,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:43,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 22:04:43,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:43,308 INFO L225 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 [2018-11-06 22:04:43,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:43,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 22:04:43,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:43,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-11-06 22:04:43,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:04:43,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:04:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:43,493 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 5 states. [2018-11-06 22:04:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:44,019 INFO L93 Difference]: Finished difference Result 485 states and 762 transitions. [2018-11-06 22:04:44,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:04:44,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-06 22:04:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:44,022 INFO L225 Difference]: With dead ends: 485 [2018-11-06 22:04:44,022 INFO L226 Difference]: Without dead ends: 270 [2018-11-06 22:04:44,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-06 22:04:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-11-06 22:04:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-06 22:04:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2018-11-06 22:04:44,032 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2018-11-06 22:04:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:44,033 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2018-11-06 22:04:44,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:04:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2018-11-06 22:04:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-06 22:04:44,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:44,035 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:44,035 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:44,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:44,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1242023532, now seen corresponding path program 1 times [2018-11-06 22:04:44,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:44,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:44,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:44,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:04:44,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:44,174 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:04:44,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:44,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 22:04:44,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:44,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-06 22:04:44,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:04:44,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:04:44,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:04:44,337 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2018-11-06 22:04:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:45,409 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2018-11-06 22:04:45,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 22:04:45,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-06 22:04:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:45,412 INFO L225 Difference]: With dead ends: 274 [2018-11-06 22:04:45,412 INFO L226 Difference]: Without dead ends: 262 [2018-11-06 22:04:45,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:04:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-06 22:04:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-06 22:04:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-06 22:04:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-11-06 22:04:45,424 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2018-11-06 22:04:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:45,425 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-11-06 22:04:45,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:04:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-11-06 22:04:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-06 22:04:45,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:45,427 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:45,427 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:45,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:45,427 INFO L82 PathProgramCache]: Analyzing trace with hash -49990723, now seen corresponding path program 1 times [2018-11-06 22:04:45,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:45,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:45,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:45,848 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 22:04:46,217 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 22:04:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:46,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:46,325 INFO L225 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 [2018-11-06 22:04:46,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:46,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:46,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:46,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-06 22:04:46,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:04:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:04:46,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:46,576 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 5 states. [2018-11-06 22:04:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:47,089 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2018-11-06 22:04:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:04:47,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-06 22:04:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:47,093 INFO L225 Difference]: With dead ends: 269 [2018-11-06 22:04:47,093 INFO L226 Difference]: Without dead ends: 267 [2018-11-06 22:04:47,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-06 22:04:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2018-11-06 22:04:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-06 22:04:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2018-11-06 22:04:47,103 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2018-11-06 22:04:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:47,104 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2018-11-06 22:04:47,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:04:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2018-11-06 22:04:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-06 22:04:47,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:47,105 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:47,105 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:47,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1424474683, now seen corresponding path program 1 times [2018-11-06 22:04:47,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:47,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:47,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-06 22:04:47,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:47,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:04:47,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:04:47,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:04:47,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:04:47,179 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2018-11-06 22:04:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:47,257 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2018-11-06 22:04:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:04:47,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-06 22:04:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:47,263 INFO L225 Difference]: With dead ends: 461 [2018-11-06 22:04:47,264 INFO L226 Difference]: Without dead ends: 245 [2018-11-06 22:04:47,265 INFO L604 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 [2018-11-06 22:04:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-06 22:04:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-11-06 22:04:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-06 22:04:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2018-11-06 22:04:47,274 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2018-11-06 22:04:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:47,274 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2018-11-06 22:04:47,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:04:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2018-11-06 22:04:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-06 22:04:47,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:47,275 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:47,278 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:47,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash -358563469, now seen corresponding path program 1 times [2018-11-06 22:04:47,279 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:47,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:47,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:47,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 22:04:47,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:04:47,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:04:47,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:04:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:04:47,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:04:47,374 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2018-11-06 22:04:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:47,571 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2018-11-06 22:04:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:04:47,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-06 22:04:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:47,573 INFO L225 Difference]: With dead ends: 333 [2018-11-06 22:04:47,573 INFO L226 Difference]: Without dead ends: 155 [2018-11-06 22:04:47,574 INFO L604 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 [2018-11-06 22:04:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-06 22:04:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-06 22:04:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-06 22:04:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2018-11-06 22:04:47,581 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2018-11-06 22:04:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:47,581 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2018-11-06 22:04:47,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:04:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2018-11-06 22:04:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-06 22:04:47,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:47,584 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:47,585 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:47,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash 815637581, now seen corresponding path program 1 times [2018-11-06 22:04:47,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:47,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:47,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:47,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 22:04:47,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:47,986 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:04:48,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:48,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 22:04:48,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:48,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-06 22:04:48,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:04:48,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:04:48,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:48,128 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2018-11-06 22:04:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:48,260 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2018-11-06 22:04:48,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:04:48,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-06 22:04:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:48,263 INFO L225 Difference]: With dead ends: 286 [2018-11-06 22:04:48,263 INFO L226 Difference]: Without dead ends: 194 [2018-11-06 22:04:48,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:04:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-06 22:04:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-11-06 22:04:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-06 22:04:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2018-11-06 22:04:48,272 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2018-11-06 22:04:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:48,272 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2018-11-06 22:04:48,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:04:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2018-11-06 22:04:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-06 22:04:48,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:48,274 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:48,274 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:48,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:48,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1231752593, now seen corresponding path program 1 times [2018-11-06 22:04:48,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:48,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:48,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:48,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:48,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:48,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:48,961 INFO L225 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 [2018-11-06 22:04:48,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:49,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:49,644 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-06 22:04:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:49,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:49,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-06 22:04:49,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:04:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:04:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:04:49,685 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 9 states. [2018-11-06 22:04:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:49,883 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2018-11-06 22:04:49,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:04:49,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-11-06 22:04:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:49,886 INFO L225 Difference]: With dead ends: 193 [2018-11-06 22:04:49,886 INFO L226 Difference]: Without dead ends: 191 [2018-11-06 22:04:49,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:04:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-06 22:04:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-11-06 22:04:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-06 22:04:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2018-11-06 22:04:49,894 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2018-11-06 22:04:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:49,894 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2018-11-06 22:04:49,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:04:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2018-11-06 22:04:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-06 22:04:49,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:49,895 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:49,895 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:49,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:49,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1872470397, now seen corresponding path program 1 times [2018-11-06 22:04:49,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:49,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:49,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:50,130 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-06 22:04:50,609 WARN L179 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-11-06 22:04:50,832 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 22:04:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:50,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:50,890 INFO L225 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 [2018-11-06 22:04:50,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:50,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:51,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:51,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-06 22:04:51,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:04:51,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:04:51,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:04:51,204 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 9 states. [2018-11-06 22:04:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:51,534 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2018-11-06 22:04:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:04:51,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-06 22:04:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:51,537 INFO L225 Difference]: With dead ends: 194 [2018-11-06 22:04:51,537 INFO L226 Difference]: Without dead ends: 192 [2018-11-06 22:04:51,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:04:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-06 22:04:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-11-06 22:04:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-06 22:04:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2018-11-06 22:04:51,545 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2018-11-06 22:04:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:51,545 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2018-11-06 22:04:51,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:04:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2018-11-06 22:04:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-06 22:04:51,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:51,546 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:51,547 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:51,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1918414029, now seen corresponding path program 1 times [2018-11-06 22:04:51,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:51,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:51,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:51,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:51,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:51,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:51,754 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:04:51,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:51,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:52,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:52,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-06 22:04:52,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 22:04:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 22:04:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:04:52,241 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 13 states. [2018-11-06 22:04:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:52,864 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2018-11-06 22:04:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:04:52,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-11-06 22:04:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:52,867 INFO L225 Difference]: With dead ends: 301 [2018-11-06 22:04:52,867 INFO L226 Difference]: Without dead ends: 211 [2018-11-06 22:04:52,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:04:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-06 22:04:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-11-06 22:04:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-06 22:04:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2018-11-06 22:04:52,874 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2018-11-06 22:04:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:52,875 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2018-11-06 22:04:52,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 22:04:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2018-11-06 22:04:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-06 22:04:52,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:52,876 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:52,876 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:52,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1532123494, now seen corresponding path program 1 times [2018-11-06 22:04:52,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:52,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:52,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:52,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:52,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:04:53,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:53,037 INFO L225 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 [2018-11-06 22:04:53,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:53,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:04:53,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:53,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2018-11-06 22:04:53,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:04:53,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:04:53,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:04:53,265 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 7 states. [2018-11-06 22:04:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:53,509 INFO L93 Difference]: Finished difference Result 324 states and 466 transitions. [2018-11-06 22:04:53,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:04:53,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-06 22:04:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:53,514 INFO L225 Difference]: With dead ends: 324 [2018-11-06 22:04:53,514 INFO L226 Difference]: Without dead ends: 234 [2018-11-06 22:04:53,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:04:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-06 22:04:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-11-06 22:04:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-06 22:04:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2018-11-06 22:04:53,522 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2018-11-06 22:04:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:53,523 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2018-11-06 22:04:53,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:04:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2018-11-06 22:04:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-06 22:04:53,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:53,524 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:53,525 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:53,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash -644957874, now seen corresponding path program 1 times [2018-11-06 22:04:53,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:53,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:53,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:53,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:53,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:53,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:53,935 INFO L225 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 [2018-11-06 22:04:53,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:54,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:54,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:54,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-06 22:04:54,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:04:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:04:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:04:54,233 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 9 states. [2018-11-06 22:04:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:54,436 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2018-11-06 22:04:54,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:04:54,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-06 22:04:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:54,438 INFO L225 Difference]: With dead ends: 233 [2018-11-06 22:04:54,438 INFO L226 Difference]: Without dead ends: 231 [2018-11-06 22:04:54,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:04:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-06 22:04:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-11-06 22:04:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-06 22:04:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2018-11-06 22:04:54,446 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2018-11-06 22:04:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:54,447 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2018-11-06 22:04:54,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:04:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2018-11-06 22:04:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-06 22:04:54,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:54,448 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:54,448 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:54,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1304536994, now seen corresponding path program 1 times [2018-11-06 22:04:54,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:54,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:54,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:04:54,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:54,614 INFO L225 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 [2018-11-06 22:04:54,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:54,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 22:04:54,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-06 22:04:54,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:04:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:04:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:04:54,817 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2018-11-06 22:04:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:55,010 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2018-11-06 22:04:55,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:04:55,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-11-06 22:04:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:55,012 INFO L225 Difference]: With dead ends: 364 [2018-11-06 22:04:55,012 INFO L226 Difference]: Without dead ends: 272 [2018-11-06 22:04:55,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:04:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-06 22:04:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2018-11-06 22:04:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-06 22:04:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2018-11-06 22:04:55,022 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2018-11-06 22:04:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:55,022 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2018-11-06 22:04:55,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:04:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2018-11-06 22:04:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-06 22:04:55,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:55,023 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:55,024 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:55,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:55,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1370174976, now seen corresponding path program 1 times [2018-11-06 22:04:55,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:55,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:55,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:55,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:55,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:55,365 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-06 22:04:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:55,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:55,685 INFO L225 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 [2018-11-06 22:04:55,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:55,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:56,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:56,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-06 22:04:56,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-06 22:04:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-06 22:04:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-06 22:04:56,258 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 17 states. [2018-11-06 22:04:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:56,744 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2018-11-06 22:04:56,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 22:04:56,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2018-11-06 22:04:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:56,750 INFO L225 Difference]: With dead ends: 271 [2018-11-06 22:04:56,750 INFO L226 Difference]: Without dead ends: 269 [2018-11-06 22:04:56,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-06 22:04:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-06 22:04:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-11-06 22:04:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-06 22:04:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2018-11-06 22:04:56,760 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2018-11-06 22:04:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:56,760 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2018-11-06 22:04:56,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-06 22:04:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2018-11-06 22:04:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-06 22:04:56,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:56,762 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:56,762 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:56,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash 903292370, now seen corresponding path program 2 times [2018-11-06 22:04:56,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:56,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:56,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:04:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:04:57,521 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-11-06 22:04:58,004 WARN L179 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-06 22:04:58,500 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-11-06 22:04:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:58,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:04:58,898 INFO L225 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 [2018-11-06 22:04:58,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:04:59,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:04:59,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:04:59,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:04:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:04:59,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:04:59,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-06 22:04:59,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 22:04:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 22:04:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:04:59,222 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 13 states. [2018-11-06 22:04:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:04:59,671 INFO L93 Difference]: Finished difference Result 272 states and 382 transitions. [2018-11-06 22:04:59,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 22:04:59,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-11-06 22:04:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:04:59,673 INFO L225 Difference]: With dead ends: 272 [2018-11-06 22:04:59,673 INFO L226 Difference]: Without dead ends: 270 [2018-11-06 22:04:59,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:04:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-06 22:04:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-11-06 22:04:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-06 22:04:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2018-11-06 22:04:59,682 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2018-11-06 22:04:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:04:59,683 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2018-11-06 22:04:59,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 22:04:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2018-11-06 22:04:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-06 22:04:59,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:04:59,684 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:04:59,684 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:04:59,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:04:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1176536002, now seen corresponding path program 2 times [2018-11-06 22:04:59,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:04:59,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:04:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:59,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:04:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:04:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:00,209 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-11-06 22:05:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-06 22:05:00,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:00,549 INFO L225 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 [2018-11-06 22:05:00,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:05:00,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:05:00,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:00,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:01,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:01,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-11-06 22:05:01,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-06 22:05:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-06 22:05:01,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-06 22:05:01,014 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 19 states. [2018-11-06 22:05:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:01,360 INFO L93 Difference]: Finished difference Result 381 states and 545 transitions. [2018-11-06 22:05:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 22:05:01,361 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 119 [2018-11-06 22:05:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:01,363 INFO L225 Difference]: With dead ends: 381 [2018-11-06 22:05:01,363 INFO L226 Difference]: Without dead ends: 292 [2018-11-06 22:05:01,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-06 22:05:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-06 22:05:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2018-11-06 22:05:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-06 22:05:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2018-11-06 22:05:01,372 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 119 [2018-11-06 22:05:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:01,372 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2018-11-06 22:05:01,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-06 22:05:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2018-11-06 22:05:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-06 22:05:01,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:01,374 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:01,374 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:01,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash 463474659, now seen corresponding path program 1 times [2018-11-06 22:05:01,374 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:01,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 30 proven. 240 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-06 22:05:01,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:01,709 INFO L225 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 [2018-11-06 22:05:01,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:01,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 30 proven. 240 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-06 22:05:01,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:01,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-06 22:05:01,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:05:01,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:05:01,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:05:01,925 INFO L87 Difference]: Start difference. First operand 289 states and 407 transitions. Second operand 8 states. [2018-11-06 22:05:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:02,168 INFO L93 Difference]: Finished difference Result 402 states and 574 transitions. [2018-11-06 22:05:02,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:05:02,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2018-11-06 22:05:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:02,171 INFO L225 Difference]: With dead ends: 402 [2018-11-06 22:05:02,172 INFO L226 Difference]: Without dead ends: 311 [2018-11-06 22:05:02,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:05:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-06 22:05:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2018-11-06 22:05:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-06 22:05:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2018-11-06 22:05:02,182 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 123 [2018-11-06 22:05:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:02,182 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2018-11-06 22:05:02,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:05:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2018-11-06 22:05:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-06 22:05:02,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:02,184 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:02,184 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:02,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash 778512671, now seen corresponding path program 2 times [2018-11-06 22:05:02,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:02,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:02,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:02,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:02,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:02,635 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 22:05:02,826 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-06 22:05:03,234 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-06 22:05:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:03,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:03,605 INFO L225 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 [2018-11-06 22:05:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:05:03,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:05:03,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:03,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:03,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:03,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-06 22:05:03,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 22:05:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 22:05:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:05:03,881 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 13 states. [2018-11-06 22:05:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:04,361 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2018-11-06 22:05:04,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 22:05:04,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2018-11-06 22:05:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:04,364 INFO L225 Difference]: With dead ends: 311 [2018-11-06 22:05:04,364 INFO L226 Difference]: Without dead ends: 309 [2018-11-06 22:05:04,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:05:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-06 22:05:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-11-06 22:05:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-06 22:05:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2018-11-06 22:05:04,375 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2018-11-06 22:05:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:04,375 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2018-11-06 22:05:04,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 22:05:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2018-11-06 22:05:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-06 22:05:04,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:04,377 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:04,378 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:04,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:04,378 INFO L82 PathProgramCache]: Analyzing trace with hash 199268015, now seen corresponding path program 2 times [2018-11-06 22:05:04,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:04,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:04,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:04,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:04,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-06 22:05:04,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:04,671 INFO L225 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 [2018-11-06 22:05:04,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:05:04,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:05:04,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:04,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-06 22:05:04,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:04,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-06 22:05:04,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:05:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:05:04,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:05:04,888 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2018-11-06 22:05:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:05,148 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2018-11-06 22:05:05,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:05:05,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2018-11-06 22:05:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:05,151 INFO L225 Difference]: With dead ends: 442 [2018-11-06 22:05:05,151 INFO L226 Difference]: Without dead ends: 350 [2018-11-06 22:05:05,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:05:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-06 22:05:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2018-11-06 22:05:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-06 22:05:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2018-11-06 22:05:05,161 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2018-11-06 22:05:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:05,161 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2018-11-06 22:05:05,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:05:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2018-11-06 22:05:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-06 22:05:05,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:05,163 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:05,163 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:05,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2020860881, now seen corresponding path program 2 times [2018-11-06 22:05:05,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:05,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:05,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:05,377 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-06 22:05:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:05,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:05,619 INFO L225 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 [2018-11-06 22:05:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:05:05,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:05:05,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:05,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:06,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:06,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-11-06 22:05:06,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-06 22:05:06,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-06 22:05:06,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-11-06 22:05:06,124 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 25 states. [2018-11-06 22:05:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:06,678 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2018-11-06 22:05:06,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 22:05:06,678 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2018-11-06 22:05:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:06,680 INFO L225 Difference]: With dead ends: 349 [2018-11-06 22:05:06,680 INFO L226 Difference]: Without dead ends: 347 [2018-11-06 22:05:06,681 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-11-06 22:05:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-06 22:05:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-11-06 22:05:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-06 22:05:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2018-11-06 22:05:06,689 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2018-11-06 22:05:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:06,690 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2018-11-06 22:05:06,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-06 22:05:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2018-11-06 22:05:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-06 22:05:06,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:06,691 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:06,691 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:06,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:06,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1480030945, now seen corresponding path program 3 times [2018-11-06 22:05:06,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:06,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:06,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:06,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:06,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:07,460 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-11-06 22:05:07,821 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-06 22:05:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:08,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:08,209 INFO L225 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 [2018-11-06 22:05:08,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:05:08,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-06 22:05:08,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:08,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:09,158 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 10 [2018-11-06 22:05:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 249 proven. 31 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-11-06 22:05:09,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:09,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2018-11-06 22:05:09,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-06 22:05:09,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-06 22:05:09,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-06 22:05:09,526 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 22 states. [2018-11-06 22:05:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:10,623 INFO L93 Difference]: Finished difference Result 545 states and 767 transitions. [2018-11-06 22:05:10,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-06 22:05:10,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 155 [2018-11-06 22:05:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:10,627 INFO L225 Difference]: With dead ends: 545 [2018-11-06 22:05:10,627 INFO L226 Difference]: Without dead ends: 449 [2018-11-06 22:05:10,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2018-11-06 22:05:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-06 22:05:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2018-11-06 22:05:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-06 22:05:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2018-11-06 22:05:10,639 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2018-11-06 22:05:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:10,639 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2018-11-06 22:05:10,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-06 22:05:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2018-11-06 22:05:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-06 22:05:10,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:10,641 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:10,641 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:10,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1330761773, now seen corresponding path program 1 times [2018-11-06 22:05:10,641 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:10,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:10,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:10,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:10,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-06 22:05:10,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:10,936 INFO L225 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 [2018-11-06 22:05:10,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:11,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-06 22:05:11,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:11,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-06 22:05:11,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 22:05:11,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 22:05:11,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:05:11,125 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 10 states. [2018-11-06 22:05:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:11,273 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2018-11-06 22:05:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 22:05:11,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-11-06 22:05:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:11,278 INFO L225 Difference]: With dead ends: 927 [2018-11-06 22:05:11,278 INFO L226 Difference]: Without dead ends: 760 [2018-11-06 22:05:11,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:05:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-11-06 22:05:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2018-11-06 22:05:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-11-06 22:05:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2018-11-06 22:05:11,299 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2018-11-06 22:05:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:11,299 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2018-11-06 22:05:11,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 22:05:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2018-11-06 22:05:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-06 22:05:11,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:11,301 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:11,301 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:11,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1753421813, now seen corresponding path program 1 times [2018-11-06 22:05:11,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:11,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:12,064 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-06 22:05:12,328 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-06 22:05:12,626 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-06 22:05:12,978 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-06 22:05:13,239 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-06 22:05:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 45 proven. 611 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 22:05:13,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:13,296 INFO L225 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 [2018-11-06 22:05:13,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:13,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 22:05:13,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 22:05:13,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-11-06 22:05:13,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-06 22:05:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-06 22:05:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-06 22:05:13,587 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 18 states. [2018-11-06 22:05:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:14,974 INFO L93 Difference]: Finished difference Result 864 states and 1212 transitions. [2018-11-06 22:05:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 22:05:14,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 177 [2018-11-06 22:05:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:14,979 INFO L225 Difference]: With dead ends: 864 [2018-11-06 22:05:14,979 INFO L226 Difference]: Without dead ends: 859 [2018-11-06 22:05:14,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-06 22:05:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-11-06 22:05:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 852. [2018-11-06 22:05:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-11-06 22:05:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2018-11-06 22:05:14,997 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2018-11-06 22:05:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:14,998 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2018-11-06 22:05:14,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-06 22:05:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2018-11-06 22:05:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-06 22:05:14,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:14,999 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:14,999 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:15,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:15,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1467051216, now seen corresponding path program 3 times [2018-11-06 22:05:15,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:15,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:15,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:15,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:15,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:15,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:15,800 INFO L225 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 [2018-11-06 22:05:15,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:05:15,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-06 22:05:15,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:16,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 626 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-06 22:05:16,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:16,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2018-11-06 22:05:16,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-06 22:05:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-06 22:05:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-11-06 22:05:16,335 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 25 states. [2018-11-06 22:05:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:17,282 INFO L93 Difference]: Finished difference Result 855 states and 1203 transitions. [2018-11-06 22:05:17,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 22:05:17,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-11-06 22:05:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:17,287 INFO L225 Difference]: With dead ends: 855 [2018-11-06 22:05:17,287 INFO L226 Difference]: Without dead ends: 853 [2018-11-06 22:05:17,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-11-06 22:05:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-06 22:05:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2018-11-06 22:05:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-11-06 22:05:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1201 transitions. [2018-11-06 22:05:17,305 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1201 transitions. Word has length 178 [2018-11-06 22:05:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:17,306 INFO L480 AbstractCegarLoop]: Abstraction has 853 states and 1201 transitions. [2018-11-06 22:05:17,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-06 22:05:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1201 transitions. [2018-11-06 22:05:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-06 22:05:17,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:17,307 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:17,308 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:17,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1843336189, now seen corresponding path program 1 times [2018-11-06 22:05:17,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:17,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:17,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:17,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:17,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 22:05:18,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:18,123 INFO L225 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 [2018-11-06 22:05:18,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:18,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 22:05:18,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:18,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-06 22:05:18,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 22:05:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 22:05:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:05:18,429 INFO L87 Difference]: Start difference. First operand 853 states and 1201 transitions. Second operand 11 states. [2018-11-06 22:05:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:19,645 INFO L93 Difference]: Finished difference Result 1435 states and 2016 transitions. [2018-11-06 22:05:19,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 22:05:19,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2018-11-06 22:05:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:19,651 INFO L225 Difference]: With dead ends: 1435 [2018-11-06 22:05:19,651 INFO L226 Difference]: Without dead ends: 959 [2018-11-06 22:05:19,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:05:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-11-06 22:05:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2018-11-06 22:05:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-11-06 22:05:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1312 transitions. [2018-11-06 22:05:19,675 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1312 transitions. Word has length 193 [2018-11-06 22:05:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:19,675 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-11-06 22:05:19,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 22:05:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1312 transitions. [2018-11-06 22:05:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-06 22:05:19,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:19,677 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:19,677 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:19,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1976503266, now seen corresponding path program 3 times [2018-11-06 22:05:19,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:19,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:05:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:19,911 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-06 22:05:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:20,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:20,848 INFO L225 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 [2018-11-06 22:05:20,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:05:21,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-06 22:05:21,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:21,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-06 22:05:21,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:21,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-11-06 22:05:21,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-06 22:05:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-06 22:05:21,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-11-06 22:05:21,843 INFO L87 Difference]: Start difference. First operand 930 states and 1312 transitions. Second operand 29 states. [2018-11-06 22:05:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:22,675 INFO L93 Difference]: Finished difference Result 940 states and 1319 transitions. [2018-11-06 22:05:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-06 22:05:22,676 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 194 [2018-11-06 22:05:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:22,680 INFO L225 Difference]: With dead ends: 940 [2018-11-06 22:05:22,680 INFO L226 Difference]: Without dead ends: 938 [2018-11-06 22:05:22,681 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2018-11-06 22:05:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-11-06 22:05:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 930. [2018-11-06 22:05:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-11-06 22:05:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1310 transitions. [2018-11-06 22:05:22,701 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1310 transitions. Word has length 194 [2018-11-06 22:05:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:22,702 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 1310 transitions. [2018-11-06 22:05:22,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-06 22:05:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1310 transitions. [2018-11-06 22:05:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-06 22:05:22,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:22,704 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 13, 13, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:22,704 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:22,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:22,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1917318174, now seen corresponding path program 2 times [2018-11-06 22:05:22,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:22,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:22,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:22,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-06 22:05:22,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:22,998 INFO L225 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 [2018-11-06 22:05:23,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:05:23,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:05:23,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:23,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-06 22:05:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:23,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-06 22:05:23,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 22:05:23,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 22:05:23,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:05:23,245 INFO L87 Difference]: Start difference. First operand 930 states and 1310 transitions. Second operand 12 states. [2018-11-06 22:05:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:23,615 INFO L93 Difference]: Finished difference Result 1125 states and 1566 transitions. [2018-11-06 22:05:23,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 22:05:23,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2018-11-06 22:05:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:23,620 INFO L225 Difference]: With dead ends: 1125 [2018-11-06 22:05:23,620 INFO L226 Difference]: Without dead ends: 1040 [2018-11-06 22:05:23,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:05:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-11-06 22:05:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2018-11-06 22:05:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2018-11-06 22:05:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1417 transitions. [2018-11-06 22:05:23,644 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1417 transitions. Word has length 211 [2018-11-06 22:05:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:23,645 INFO L480 AbstractCegarLoop]: Abstraction has 1008 states and 1417 transitions. [2018-11-06 22:05:23,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 22:05:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1417 transitions. [2018-11-06 22:05:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-06 22:05:23,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:23,647 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 14, 14, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:23,647 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:23,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash -680982655, now seen corresponding path program 4 times [2018-11-06 22:05:23,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:23,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:23,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:23,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:23,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 57 proven. 1086 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:24,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:24,817 INFO L225 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 [2018-11-06 22:05:24,829 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-06 22:05:24,913 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-06 22:05:24,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:24,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 57 proven. 1086 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:25,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:25,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-06 22:05:25,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-06 22:05:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-06 22:05:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-11-06 22:05:25,272 INFO L87 Difference]: Start difference. First operand 1008 states and 1417 transitions. Second operand 21 states. [2018-11-06 22:05:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:26,036 INFO L93 Difference]: Finished difference Result 1011 states and 1420 transitions. [2018-11-06 22:05:26,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-06 22:05:26,037 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 224 [2018-11-06 22:05:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:26,041 INFO L225 Difference]: With dead ends: 1011 [2018-11-06 22:05:26,041 INFO L226 Difference]: Without dead ends: 1009 [2018-11-06 22:05:26,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 215 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-11-06 22:05:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-11-06 22:05:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2018-11-06 22:05:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-11-06 22:05:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1418 transitions. [2018-11-06 22:05:26,061 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1418 transitions. Word has length 224 [2018-11-06 22:05:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:26,061 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1418 transitions. [2018-11-06 22:05:26,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-06 22:05:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1418 transitions. [2018-11-06 22:05:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-06 22:05:26,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:26,063 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:26,063 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:26,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash 196553618, now seen corresponding path program 2 times [2018-11-06 22:05:26,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:26,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:26,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-06 22:05:26,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:26,469 INFO L225 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 [2018-11-06 22:05:26,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 22:05:26,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 22:05:26,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:26,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-06 22:05:26,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:26,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-06 22:05:26,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 22:05:26,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 22:05:26,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:05:26,765 INFO L87 Difference]: Start difference. First operand 1009 states and 1418 transitions. Second operand 13 states. [2018-11-06 22:05:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:27,198 INFO L93 Difference]: Finished difference Result 1675 states and 2347 transitions. [2018-11-06 22:05:27,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 22:05:27,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 239 [2018-11-06 22:05:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:27,203 INFO L225 Difference]: With dead ends: 1675 [2018-11-06 22:05:27,203 INFO L226 Difference]: Without dead ends: 1121 [2018-11-06 22:05:27,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-06 22:05:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-11-06 22:05:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2018-11-06 22:05:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-11-06 22:05:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1528 transitions. [2018-11-06 22:05:27,229 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1528 transitions. Word has length 239 [2018-11-06 22:05:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:27,230 INFO L480 AbstractCegarLoop]: Abstraction has 1086 states and 1528 transitions. [2018-11-06 22:05:27,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 22:05:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1528 transitions. [2018-11-06 22:05:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-06 22:05:27,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:27,232 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:27,232 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:27,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash -569825871, now seen corresponding path program 3 times [2018-11-06 22:05:27,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:27,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:27,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-06 22:05:27,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:27,766 INFO L225 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 [2018-11-06 22:05:27,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:05:28,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-06 22:05:28,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:28,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-06 22:05:28,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:28,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-06 22:05:28,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 22:05:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 22:05:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:05:28,197 INFO L87 Difference]: Start difference. First operand 1086 states and 1528 transitions. Second operand 14 states. [2018-11-06 22:05:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:28,684 INFO L93 Difference]: Finished difference Result 1287 states and 1788 transitions. [2018-11-06 22:05:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 22:05:28,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 257 [2018-11-06 22:05:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:28,689 INFO L225 Difference]: With dead ends: 1287 [2018-11-06 22:05:28,690 INFO L226 Difference]: Without dead ends: 1202 [2018-11-06 22:05:28,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-06 22:05:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-11-06 22:05:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2018-11-06 22:05:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-11-06 22:05:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1635 transitions. [2018-11-06 22:05:28,714 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1635 transitions. Word has length 257 [2018-11-06 22:05:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:28,714 INFO L480 AbstractCegarLoop]: Abstraction has 1164 states and 1635 transitions. [2018-11-06 22:05:28,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 22:05:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1635 transitions. [2018-11-06 22:05:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-06 22:05:28,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:28,716 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 17, 17, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:28,716 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:28,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1648454126, now seen corresponding path program 5 times [2018-11-06 22:05:28,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:28,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:28,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:28,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:28,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1693 backedges. 69 proven. 1624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:29,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:29,856 INFO L225 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 [2018-11-06 22:05:29,865 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-06 22:05:30,204 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-06 22:05:30,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:30,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1693 backedges. 69 proven. 1584 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-06 22:05:31,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:31,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 35 [2018-11-06 22:05:31,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-06 22:05:31,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-06 22:05:31,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-11-06 22:05:31,479 INFO L87 Difference]: Start difference. First operand 1164 states and 1635 transitions. Second operand 35 states. [2018-11-06 22:05:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:32,952 INFO L93 Difference]: Finished difference Result 1167 states and 1638 transitions. [2018-11-06 22:05:32,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-06 22:05:32,953 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 270 [2018-11-06 22:05:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:32,956 INFO L225 Difference]: With dead ends: 1167 [2018-11-06 22:05:32,957 INFO L226 Difference]: Without dead ends: 1165 [2018-11-06 22:05:32,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2018-11-06 22:05:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2018-11-06 22:05:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2018-11-06 22:05:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-06 22:05:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1636 transitions. [2018-11-06 22:05:32,974 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1636 transitions. Word has length 270 [2018-11-06 22:05:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:32,974 INFO L480 AbstractCegarLoop]: Abstraction has 1165 states and 1636 transitions. [2018-11-06 22:05:32,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-06 22:05:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1636 transitions. [2018-11-06 22:05:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-06 22:05:32,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:32,977 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:32,977 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:32,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:32,977 INFO L82 PathProgramCache]: Analyzing trace with hash -579696415, now seen corresponding path program 3 times [2018-11-06 22:05:32,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:32,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:32,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:32,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:32,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-06 22:05:33,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:33,411 INFO L225 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 [2018-11-06 22:05:33,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-06 22:05:33,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-06 22:05:33,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:33,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-11-06 22:05:33,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:33,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-06 22:05:33,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-06 22:05:33,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-06 22:05:33,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-11-06 22:05:33,696 INFO L87 Difference]: Start difference. First operand 1165 states and 1636 transitions. Second operand 19 states. [2018-11-06 22:05:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:34,615 INFO L93 Difference]: Finished difference Result 1316 states and 1836 transitions. [2018-11-06 22:05:34,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-06 22:05:34,616 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2018-11-06 22:05:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:34,620 INFO L225 Difference]: With dead ends: 1316 [2018-11-06 22:05:34,620 INFO L226 Difference]: Without dead ends: 684 [2018-11-06 22:05:34,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-11-06 22:05:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-11-06 22:05:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 659. [2018-11-06 22:05:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-11-06 22:05:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 908 transitions. [2018-11-06 22:05:34,634 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 908 transitions. Word has length 285 [2018-11-06 22:05:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:34,634 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 908 transitions. [2018-11-06 22:05:34,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-06 22:05:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 908 transitions. [2018-11-06 22:05:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-06 22:05:34,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:34,637 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 20, 20, 13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:34,637 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:34,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:34,637 INFO L82 PathProgramCache]: Analyzing trace with hash -491041053, now seen corresponding path program 6 times [2018-11-06 22:05:34,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:34,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:34,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:34,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:34,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:35,498 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 22:05:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 81 proven. 2270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:05:36,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:36,560 INFO L225 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 [2018-11-06 22:05:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-06 22:05:36,957 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-11-06 22:05:36,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:36,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 2285 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-06 22:05:38,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:38,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 46 [2018-11-06 22:05:38,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-06 22:05:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-06 22:05:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1651, Unknown=0, NotChecked=0, Total=2070 [2018-11-06 22:05:38,053 INFO L87 Difference]: Start difference. First operand 659 states and 908 transitions. Second operand 46 states. [2018-11-06 22:05:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:39,507 INFO L93 Difference]: Finished difference Result 705 states and 967 transitions. [2018-11-06 22:05:39,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-06 22:05:39,507 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 316 [2018-11-06 22:05:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:39,510 INFO L225 Difference]: With dead ends: 705 [2018-11-06 22:05:39,510 INFO L226 Difference]: Without dead ends: 703 [2018-11-06 22:05:39,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 301 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=508, Invalid=2042, Unknown=0, NotChecked=0, Total=2550 [2018-11-06 22:05:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-11-06 22:05:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 659. [2018-11-06 22:05:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-11-06 22:05:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2018-11-06 22:05:39,523 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 316 [2018-11-06 22:05:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:39,524 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2018-11-06 22:05:39,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-06 22:05:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2018-11-06 22:05:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-11-06 22:05:39,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:39,527 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:39,527 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:39,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash 981783183, now seen corresponding path program 4 times [2018-11-06 22:05:39,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:39,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:39,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:39,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:05:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-06 22:05:40,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:05:40,031 INFO L225 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 [2018-11-06 22:05:40,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-06 22:05:40,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-06 22:05:40,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 22:05:40,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:05:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-06 22:05:40,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:05:40,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-06 22:05:40,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-06 22:05:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-06 22:05:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-06 22:05:40,490 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 18 states. [2018-11-06 22:05:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:05:40,713 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2018-11-06 22:05:40,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 22:05:40,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 349 [2018-11-06 22:05:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:05:40,718 INFO L225 Difference]: With dead ends: 865 [2018-11-06 22:05:40,718 INFO L226 Difference]: Without dead ends: 780 [2018-11-06 22:05:40,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-06 22:05:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-11-06 22:05:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2018-11-06 22:05:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-06 22:05:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2018-11-06 22:05:40,732 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2018-11-06 22:05:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:05:40,732 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2018-11-06 22:05:40,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-06 22:05:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2018-11-06 22:05:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-06 22:05:40,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:05:40,735 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:05:40,735 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:05:40,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:05:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash -487111266, now seen corresponding path program 5 times [2018-11-06 22:05:40,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:05:40,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:05:40,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:40,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 22:05:40,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:05:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-06 22:05:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-06 22:05:42,626 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-06 22:05:42,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:05:42 BoogieIcfgContainer [2018-11-06 22:05:42,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:05:42,875 INFO L168 Benchmark]: Toolchain (without parser) took 67810.76 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.9 MB). Peak memory consumption was 567.3 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:42,876 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:05:42,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:42,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 160.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.6 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:42,878 INFO L168 Benchmark]: Boogie Preprocessor took 50.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:05:42,878 INFO L168 Benchmark]: RCFGBuilder took 1854.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 67.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:42,878 INFO L168 Benchmark]: TraceAbstraction took 65130.75 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 622.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -73.4 MB). Peak memory consumption was 549.4 MB. Max. memory is 7.1 GB. [2018-11-06 22:05:42,885 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 609.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 160.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.6 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1854.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 67.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65130.75 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 622.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -73.4 MB). Peak memory consumption was 549.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 569]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_Protocol = 1; [L6] int m_msg_2 = 2; [L7] int m_recv_ack_2 = 3; [L8] int m_msg_1_1 = 4; [L9] int m_msg_1_2 = 5; [L10] int m_recv_ack_1_1 = 6; [L11] int m_recv_ack_1_2 = 7; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L16] int q = 0; [L17] int method_id; [L20] int this_expect = 0; [L21] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND TRUE q == 0 [L44] COND TRUE __VERIFIER_nondet_int() [L46] COND TRUE 1 [L48] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L50] COND FALSE !(0) [L54] q = 1 [L56] this_expect=0 [L56] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L290] q = 4 [L292] this_expect=this_expect [L292] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND TRUE q == 4 [L364] COND FALSE !(__VERIFIER_nondet_int()) [L380] COND FALSE !(__VERIFIER_nondet_int()) [L396] COND FALSE !(__VERIFIER_nondet_int()) [L412] COND TRUE __VERIFIER_nondet_int() [L414] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L416] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L418] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L422] q = 5 [L424] this_expect=(this_expect + 1) [L424] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L363] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L463] COND TRUE q == 5 [L464] COND FALSE !(__VERIFIER_nondet_int()) [L480] COND FALSE !(__VERIFIER_nondet_int()) [L496] COND FALSE !(__VERIFIER_nondet_int()) [L512] COND FALSE !(__VERIFIER_nondet_int()) [L528] COND FALSE !(__VERIFIER_nondet_int()) [L544] COND TRUE __VERIFIER_nondet_int() [L546] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L548] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L550] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L554] q = 1 [L556] this_expect=this_expect [L556] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND TRUE q == 1 [L64] COND TRUE __VERIFIER_nondet_int() [L66] COND TRUE !((P1 % 2) != (0 % 2)) [L68] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L70] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L74] q = 3 [L76] this_expect=(this_expect + 1) [L76] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L24] COND TRUE 1 [L27] int P1=__VERIFIER_nondet_int(); [L28] int P2=__VERIFIER_nondet_int(); [L29] int P3=__VERIFIER_nondet_int(); [L30] int P4=__VERIFIER_nondet_int(); [L31] int P5=__VERIFIER_nondet_int(); [L32] int P6=__VERIFIER_nondet_int(); [L33] int P7=__VERIFIER_nondet_int(); [L34] int P8=__VERIFIER_nondet_int(); [L35] int P9=__VERIFIER_nondet_int(); [L38] COND TRUE this_expect > 16 [L39] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L43] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L63] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L163] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L263] COND TRUE q == 3 [L264] COND FALSE !(__VERIFIER_nondet_int()) [L280] COND TRUE __VERIFIER_nondet_int() [L282] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L284] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L286] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L569] __VERIFIER_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 1 error locations. UNSAFE Result, 65.0s OverallTime, 43 OverallIterations, 35 TraceHistogramMax, 22.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10249 SDtfs, 16426 SDslu, 86369 SDs, 0 SdLazy, 11472 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5315 GetRequests, 4786 SyntacticMatches, 53 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 26.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1165occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 42 MinimizatonAttempts, 406 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 6.4s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 10169 NumberOfCodeBlocks, 9747 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 9699 ConstructedInterpolants, 0 QuantifiedInterpolants, 10591132 SizeOfPredicates, 78 NumberOfNonLiveVariables, 25403 ConjunctsInSsa, 881 ConjunctsInUnsatCore, 75 InterpolantComputations, 10 PerfectInterpolantSequences, 10490/42079 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...