java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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-d380424 [2018-10-24 17:10:33,316 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 17:10:33,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 17:10:33,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 17:10:33,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 17:10:33,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 17:10:33,339 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 17:10:33,340 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 17:10:33,342 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 17:10:33,343 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 17:10:33,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 17:10:33,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 17:10:33,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 17:10:33,347 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 17:10:33,348 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 17:10:33,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 17:10:33,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 17:10:33,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 17:10:33,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 17:10:33,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 17:10:33,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 17:10:33,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 17:10:33,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 17:10:33,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 17:10:33,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 17:10:33,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 17:10:33,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 17:10:33,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 17:10:33,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 17:10:33,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 17:10:33,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 17:10:33,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 17:10:33,371 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 17:10:33,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 17:10:33,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 17:10:33,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 17:10:33,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 17:10:33,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 17:10:33,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 17:10:33,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 17:10:33,390 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 17:10:33,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 17:10:33,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 17:10:33,391 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 17:10:33,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 17:10:33,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 17:10:33,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 17:10:33,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 17:10:33,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 17:10:33,393 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 17:10:33,393 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 17:10:33,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 17:10:33,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 17:10:33,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 17:10:33,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 17:10:33,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 17:10:33,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 17:10:33,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 17:10:33,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 17:10:33,395 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 17:10:33,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 17:10:33,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 17:10:33,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 17:10:33,395 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 17:10:33,395 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 17:10:33,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 17:10:33,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 17:10:33,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 17:10:33,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 17:10:33,481 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 17:10:33,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-24 17:10:33,546 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c666fb66e/f5eee884d15140159dc82fc6ef826a47/FLAG613866f98 [2018-10-24 17:10:34,055 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 17:10:34,057 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-24 17:10:34,070 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c666fb66e/f5eee884d15140159dc82fc6ef826a47/FLAG613866f98 [2018-10-24 17:10:34,084 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c666fb66e/f5eee884d15140159dc82fc6ef826a47 [2018-10-24 17:10:34,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 17:10:34,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 17:10:34,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 17:10:34,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 17:10:34,102 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 17:10:34,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26998074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34, skipping insertion in model container [2018-10-24 17:10:34,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 17:10:34,180 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 17:10:34,510 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 17:10:34,516 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 17:10:34,600 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 17:10:34,622 INFO L193 MainTranslator]: Completed translation [2018-10-24 17:10:34,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34 WrapperNode [2018-10-24 17:10:34,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 17:10:34,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 17:10:34,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 17:10:34,625 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 17:10:34,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 17:10:34,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 17:10:34,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 17:10:34,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 17:10:34,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... [2018-10-24 17:10:34,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 17:10:34,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 17:10:34,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 17:10:34,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 17:10:34,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:35,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 17:10:35,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 17:10:36,912 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 17:10:36,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:10:36 BoogieIcfgContainer [2018-10-24 17:10:36,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 17:10:36,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 17:10:36,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 17:10:36,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 17:10:36,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:10:34" (1/3) ... [2018-10-24 17:10:36,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ab6a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:10:36, skipping insertion in model container [2018-10-24 17:10:36,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:10:34" (2/3) ... [2018-10-24 17:10:36,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ab6a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:10:36, skipping insertion in model container [2018-10-24 17:10:36,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:10:36" (3/3) ... [2018-10-24 17:10:36,923 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-24 17:10:36,931 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 17:10:36,939 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 17:10:36,955 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 17:10:36,990 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 17:10:36,991 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 17:10:36,991 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 17:10:36,991 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 17:10:36,992 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 17:10:36,992 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 17:10:36,992 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 17:10:36,992 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 17:10:36,992 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 17:10:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2018-10-24 17:10:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-24 17:10:37,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:37,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:10:37,023 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:37,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash -977991394, now seen corresponding path program 1 times [2018-10-24 17:10:37,031 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:37,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:37,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:37,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:37,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:37,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:37,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 17:10:37,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 17:10:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 17:10:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 17:10:37,219 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2018-10-24 17:10:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:37,264 INFO L93 Difference]: Finished difference Result 218 states and 420 transitions. [2018-10-24 17:10:37,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 17:10:37,268 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-10-24 17:10:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:37,281 INFO L225 Difference]: With dead ends: 218 [2018-10-24 17:10:37,282 INFO L226 Difference]: Without dead ends: 106 [2018-10-24 17:10:37,286 INFO L605 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-10-24 17:10:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-24 17:10:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-10-24 17:10:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-24 17:10:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2018-10-24 17:10:37,341 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2018-10-24 17:10:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:37,341 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2018-10-24 17:10:37,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 17:10:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2018-10-24 17:10:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-24 17:10:37,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:37,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:10:37,344 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:37,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 279525351, now seen corresponding path program 1 times [2018-10-24 17:10:37,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:37,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:37,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:37,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:37,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:37,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:10:37,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:10:37,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:10:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:10:37,416 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2018-10-24 17:10:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:37,615 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2018-10-24 17:10:37,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:10:37,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-24 17:10:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:37,621 INFO L225 Difference]: With dead ends: 214 [2018-10-24 17:10:37,621 INFO L226 Difference]: Without dead ends: 110 [2018-10-24 17:10:37,623 INFO L605 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-10-24 17:10:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-24 17:10:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-10-24 17:10:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-24 17:10:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2018-10-24 17:10:37,646 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2018-10-24 17:10:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:37,647 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2018-10-24 17:10:37,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:10:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2018-10-24 17:10:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-24 17:10:37,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:37,654 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:10:37,654 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:37,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1710410508, now seen corresponding path program 1 times [2018-10-24 17:10:37,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:37,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:37,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:37,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:37,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:37,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:10:37,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:10:37,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:10:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:10:37,792 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 3 states. [2018-10-24 17:10:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:38,501 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2018-10-24 17:10:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:10:38,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-24 17:10:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:38,505 INFO L225 Difference]: With dead ends: 324 [2018-10-24 17:10:38,505 INFO L226 Difference]: Without dead ends: 195 [2018-10-24 17:10:38,506 INFO L605 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-10-24 17:10:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-24 17:10:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-10-24 17:10:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-24 17:10:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2018-10-24 17:10:38,524 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2018-10-24 17:10:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:38,524 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2018-10-24 17:10:38,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:10:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2018-10-24 17:10:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 17:10:38,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:38,526 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:10:38,526 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:38,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1268129073, now seen corresponding path program 1 times [2018-10-24 17:10:38,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:38,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:38,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:38,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:38,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:38,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:10:38,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:10:38,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:10:38,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:10:38,624 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2018-10-24 17:10:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:38,757 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2018-10-24 17:10:38,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:10:38,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-24 17:10:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:38,760 INFO L225 Difference]: With dead ends: 314 [2018-10-24 17:10:38,760 INFO L226 Difference]: Without dead ends: 133 [2018-10-24 17:10:38,761 INFO L605 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-10-24 17:10:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-24 17:10:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-24 17:10:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-24 17:10:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2018-10-24 17:10:38,772 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2018-10-24 17:10:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:38,772 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2018-10-24 17:10:38,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:10:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2018-10-24 17:10:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 17:10:38,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:38,774 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 17:10:38,774 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:38,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:38,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1534733406, now seen corresponding path program 1 times [2018-10-24 17:10:38,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:38,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:38,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 17:10:38,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:38,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:10:38,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:10:38,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:10:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:10:38,897 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2018-10-24 17:10:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:38,949 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2018-10-24 17:10:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:10:38,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-24 17:10:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:38,951 INFO L225 Difference]: With dead ends: 243 [2018-10-24 17:10:38,951 INFO L226 Difference]: Without dead ends: 115 [2018-10-24 17:10:38,952 INFO L605 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-10-24 17:10:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-24 17:10:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-10-24 17:10:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-24 17:10:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2018-10-24 17:10:38,960 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2018-10-24 17:10:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:38,960 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2018-10-24 17:10:38,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:10:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2018-10-24 17:10:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-24 17:10:38,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:38,962 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-10-24 17:10:38,962 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:38,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash -478960449, now seen corresponding path program 1 times [2018-10-24 17:10:38,963 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:38,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:38,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:39,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:39,047 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:39,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:39,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:39,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:39,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-24 17:10:39,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 17:10:39,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 17:10:39,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:39,212 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2018-10-24 17:10:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:40,173 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2018-10-24 17:10:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 17:10:40,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-24 17:10:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:40,176 INFO L225 Difference]: With dead ends: 204 [2018-10-24 17:10:40,176 INFO L226 Difference]: Without dead ends: 192 [2018-10-24 17:10:40,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-24 17:10:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2018-10-24 17:10:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-24 17:10:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2018-10-24 17:10:40,186 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2018-10-24 17:10:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:40,187 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2018-10-24 17:10:40,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 17:10:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2018-10-24 17:10:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 17:10:40,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:40,189 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-10-24 17:10:40,189 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:40,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:40,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1951428508, now seen corresponding path program 1 times [2018-10-24 17:10:40,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:40,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:40,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:40,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:40,360 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:40,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:40,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:40,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:40,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-24 17:10:40,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 17:10:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 17:10:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:40,563 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 5 states. [2018-10-24 17:10:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:41,053 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2018-10-24 17:10:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 17:10:41,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-10-24 17:10:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:41,057 INFO L225 Difference]: With dead ends: 387 [2018-10-24 17:10:41,057 INFO L226 Difference]: Without dead ends: 230 [2018-10-24 17:10:41,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-24 17:10:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2018-10-24 17:10:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-24 17:10:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2018-10-24 17:10:41,067 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2018-10-24 17:10:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:41,068 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2018-10-24 17:10:41,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 17:10:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2018-10-24 17:10:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 17:10:41,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:41,069 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-10-24 17:10:41,070 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:41,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:41,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1318541348, now seen corresponding path program 1 times [2018-10-24 17:10:41,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:41,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:41,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:41,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:41,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 17:10:41,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:41,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:10:41,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:10:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:10:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:10:41,148 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2018-10-24 17:10:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:41,279 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2018-10-24 17:10:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:10:41,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-24 17:10:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:41,281 INFO L225 Difference]: With dead ends: 409 [2018-10-24 17:10:41,282 INFO L226 Difference]: Without dead ends: 211 [2018-10-24 17:10:41,282 INFO L605 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-10-24 17:10:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-24 17:10:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-24 17:10:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-24 17:10:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2018-10-24 17:10:41,290 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2018-10-24 17:10:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:41,291 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2018-10-24 17:10:41,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:10:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2018-10-24 17:10:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 17:10:41,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:41,293 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-10-24 17:10:41,293 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:41,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1553389745, now seen corresponding path program 1 times [2018-10-24 17:10:41,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:41,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:41,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:41,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:41,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 17:10:41,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:41,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:10:41,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:10:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:10:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:10:41,369 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2018-10-24 17:10:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:41,625 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2018-10-24 17:10:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:10:41,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-24 17:10:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:41,627 INFO L225 Difference]: With dead ends: 375 [2018-10-24 17:10:41,627 INFO L226 Difference]: Without dead ends: 211 [2018-10-24 17:10:41,628 INFO L605 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-10-24 17:10:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-24 17:10:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-24 17:10:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-24 17:10:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2018-10-24 17:10:41,636 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2018-10-24 17:10:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:41,638 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2018-10-24 17:10:41,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:10:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2018-10-24 17:10:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 17:10:41,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:41,639 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-10-24 17:10:41,640 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:41,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1840811351, now seen corresponding path program 1 times [2018-10-24 17:10:41,641 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:41,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:41,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:41,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:41,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 17:10:41,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:41,847 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:41,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 17:10:42,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-10-24 17:10:42,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 17:10:42,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 17:10:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:42,014 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 5 states. [2018-10-24 17:10:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:42,523 INFO L93 Difference]: Finished difference Result 485 states and 762 transitions. [2018-10-24 17:10:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 17:10:42,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-24 17:10:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:42,527 INFO L225 Difference]: With dead ends: 485 [2018-10-24 17:10:42,527 INFO L226 Difference]: Without dead ends: 270 [2018-10-24 17:10:42,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-24 17:10:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-10-24 17:10:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-24 17:10:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2018-10-24 17:10:42,537 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2018-10-24 17:10:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:42,538 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2018-10-24 17:10:42,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 17:10:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2018-10-24 17:10:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-24 17:10:42,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:42,539 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-10-24 17:10:42,540 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:42,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:42,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1242023532, now seen corresponding path program 1 times [2018-10-24 17:10:42,540 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:42,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:42,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:42,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:42,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 17:10:42,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:42,659 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:42,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:42,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 17:10:42,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:42,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-24 17:10:42,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 17:10:42,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 17:10:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 17:10:42,862 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2018-10-24 17:10:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:43,952 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2018-10-24 17:10:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 17:10:43,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-10-24 17:10:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:43,955 INFO L225 Difference]: With dead ends: 274 [2018-10-24 17:10:43,955 INFO L226 Difference]: Without dead ends: 262 [2018-10-24 17:10:43,956 INFO L605 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-10-24 17:10:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-24 17:10:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-10-24 17:10:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-24 17:10:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-10-24 17:10:43,965 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2018-10-24 17:10:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:43,966 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-10-24 17:10:43,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 17:10:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-10-24 17:10:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 17:10:43,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:43,967 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-10-24 17:10:43,968 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:43,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash -49990723, now seen corresponding path program 1 times [2018-10-24 17:10:43,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:43,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:43,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:43,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:43,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:44,383 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:10:44,761 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 17:10:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:44,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:44,868 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:44,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:44,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:45,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:45,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-24 17:10:45,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 17:10:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 17:10:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:45,133 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 5 states. [2018-10-24 17:10:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:45,907 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2018-10-24 17:10:45,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 17:10:45,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-10-24 17:10:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:45,910 INFO L225 Difference]: With dead ends: 269 [2018-10-24 17:10:45,910 INFO L226 Difference]: Without dead ends: 267 [2018-10-24 17:10:45,911 INFO L605 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-10-24 17:10:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-24 17:10:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2018-10-24 17:10:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-24 17:10:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2018-10-24 17:10:45,920 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2018-10-24 17:10:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:45,920 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2018-10-24 17:10:45,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 17:10:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2018-10-24 17:10:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-24 17:10:45,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:45,922 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-10-24 17:10:45,922 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:45,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1424474683, now seen corresponding path program 1 times [2018-10-24 17:10:45,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:45,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:45,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:45,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-24 17:10:46,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:46,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:10:46,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:10:46,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:10:46,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:10:46,008 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2018-10-24 17:10:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:46,142 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2018-10-24 17:10:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:10:46,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-24 17:10:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:46,145 INFO L225 Difference]: With dead ends: 461 [2018-10-24 17:10:46,145 INFO L226 Difference]: Without dead ends: 245 [2018-10-24 17:10:46,146 INFO L605 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-10-24 17:10:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-24 17:10:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-24 17:10:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-24 17:10:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2018-10-24 17:10:46,154 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2018-10-24 17:10:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:46,155 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2018-10-24 17:10:46,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:10:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2018-10-24 17:10:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-24 17:10:46,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:46,156 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-10-24 17:10:46,156 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:46,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:46,157 INFO L82 PathProgramCache]: Analyzing trace with hash -358563469, now seen corresponding path program 1 times [2018-10-24 17:10:46,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:46,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:46,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 17:10:46,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 17:10:46,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 17:10:46,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 17:10:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 17:10:46,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 17:10:46,247 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2018-10-24 17:10:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:46,501 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2018-10-24 17:10:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 17:10:46,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-24 17:10:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:46,503 INFO L225 Difference]: With dead ends: 333 [2018-10-24 17:10:46,503 INFO L226 Difference]: Without dead ends: 155 [2018-10-24 17:10:46,504 INFO L605 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-10-24 17:10:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-24 17:10:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-24 17:10:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-24 17:10:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2018-10-24 17:10:46,509 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2018-10-24 17:10:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:46,509 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2018-10-24 17:10:46,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 17:10:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2018-10-24 17:10:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 17:10:46,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:46,510 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-10-24 17:10:46,511 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:46,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash 815637581, now seen corresponding path program 1 times [2018-10-24 17:10:46,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:46,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:46,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:46,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 17:10:46,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:46,653 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:46,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:46,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 17:10:46,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:46,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-24 17:10:46,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 17:10:46,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 17:10:46,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:46,801 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2018-10-24 17:10:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:46,932 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2018-10-24 17:10:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 17:10:46,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-10-24 17:10:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:46,934 INFO L225 Difference]: With dead ends: 286 [2018-10-24 17:10:46,934 INFO L226 Difference]: Without dead ends: 194 [2018-10-24 17:10:46,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 17:10:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-24 17:10:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-10-24 17:10:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-24 17:10:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2018-10-24 17:10:46,945 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2018-10-24 17:10:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:46,945 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2018-10-24 17:10:46,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 17:10:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2018-10-24 17:10:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-24 17:10:46,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:46,946 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-10-24 17:10:46,947 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:46,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1231752593, now seen corresponding path program 1 times [2018-10-24 17:10:46,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:47,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:47,150 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:47,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:47,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:47,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:47,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-24 17:10:47,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 17:10:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 17:10:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:10:47,641 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 9 states. [2018-10-24 17:10:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:48,025 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2018-10-24 17:10:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 17:10:48,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-10-24 17:10:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:48,027 INFO L225 Difference]: With dead ends: 193 [2018-10-24 17:10:48,027 INFO L226 Difference]: Without dead ends: 191 [2018-10-24 17:10:48,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:10:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-24 17:10:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-24 17:10:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-24 17:10:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2018-10-24 17:10:48,035 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2018-10-24 17:10:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:48,035 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2018-10-24 17:10:48,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 17:10:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2018-10-24 17:10:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-24 17:10:48,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:48,036 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-10-24 17:10:48,036 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:48,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:48,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1872470397, now seen corresponding path program 1 times [2018-10-24 17:10:48,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:48,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:48,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:48,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:48,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:48,541 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-24 17:10:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:48,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:48,577 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:48,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:48,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:48,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:48,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-24 17:10:48,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 17:10:48,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 17:10:48,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:10:48,825 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 9 states. [2018-10-24 17:10:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:49,099 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2018-10-24 17:10:49,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 17:10:49,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-10-24 17:10:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:49,101 INFO L225 Difference]: With dead ends: 194 [2018-10-24 17:10:49,101 INFO L226 Difference]: Without dead ends: 192 [2018-10-24 17:10:49,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:10:49,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-24 17:10:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-10-24 17:10:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-24 17:10:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2018-10-24 17:10:49,107 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2018-10-24 17:10:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:49,108 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2018-10-24 17:10:49,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 17:10:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2018-10-24 17:10:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-24 17:10:49,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:49,109 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-10-24 17:10:49,109 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:49,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1918414029, now seen corresponding path program 1 times [2018-10-24 17:10:49,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:49,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:49,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:49,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:49,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:49,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:49,927 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:49,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:50,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:50,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:50,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-10-24 17:10:50,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 17:10:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 17:10:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-24 17:10:50,520 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 13 states. [2018-10-24 17:10:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:51,046 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2018-10-24 17:10:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 17:10:51,046 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-10-24 17:10:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:51,048 INFO L225 Difference]: With dead ends: 301 [2018-10-24 17:10:51,048 INFO L226 Difference]: Without dead ends: 211 [2018-10-24 17:10:51,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-24 17:10:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-24 17:10:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-24 17:10:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-24 17:10:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2018-10-24 17:10:51,056 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2018-10-24 17:10:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:51,056 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2018-10-24 17:10:51,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 17:10:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2018-10-24 17:10:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-24 17:10:51,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:51,057 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-10-24 17:10:51,058 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:51,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1532123494, now seen corresponding path program 1 times [2018-10-24 17:10:51,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:51,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-24 17:10:51,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:51,273 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:51,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:51,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-24 17:10:51,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:51,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2018-10-24 17:10:51,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 17:10:51,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 17:10:51,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-24 17:10:51,463 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 7 states. [2018-10-24 17:10:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:51,705 INFO L93 Difference]: Finished difference Result 324 states and 466 transitions. [2018-10-24 17:10:51,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 17:10:51,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-10-24 17:10:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:51,707 INFO L225 Difference]: With dead ends: 324 [2018-10-24 17:10:51,708 INFO L226 Difference]: Without dead ends: 234 [2018-10-24 17:10:51,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-24 17:10:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-24 17:10:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-10-24 17:10:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-24 17:10:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2018-10-24 17:10:51,716 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2018-10-24 17:10:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:51,716 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2018-10-24 17:10:51,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 17:10:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2018-10-24 17:10:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-24 17:10:51,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:51,717 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-10-24 17:10:51,718 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:51,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash -644957874, now seen corresponding path program 1 times [2018-10-24 17:10:51,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:51,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:51,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:52,100 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:10:52,712 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-24 17:10:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:52,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:52,895 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:52,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:52,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:53,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:53,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-24 17:10:53,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 17:10:53,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 17:10:53,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:10:53,281 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 9 states. [2018-10-24 17:10:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:53,577 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2018-10-24 17:10:53,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 17:10:53,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-10-24 17:10:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:53,580 INFO L225 Difference]: With dead ends: 233 [2018-10-24 17:10:53,580 INFO L226 Difference]: Without dead ends: 231 [2018-10-24 17:10:53,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:10:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-24 17:10:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-24 17:10:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-24 17:10:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2018-10-24 17:10:53,588 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2018-10-24 17:10:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:53,588 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2018-10-24 17:10:53,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 17:10:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2018-10-24 17:10:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 17:10:53,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:53,589 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-10-24 17:10:53,590 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:53,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1304536994, now seen corresponding path program 1 times [2018-10-24 17:10:53,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:53,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:53,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:53,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:53,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-24 17:10:54,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:54,175 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:54,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:54,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-24 17:10:54,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:54,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-24 17:10:54,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 17:10:54,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 17:10:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-24 17:10:54,366 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2018-10-24 17:10:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:54,559 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2018-10-24 17:10:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 17:10:54,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-10-24 17:10:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:54,562 INFO L225 Difference]: With dead ends: 364 [2018-10-24 17:10:54,562 INFO L226 Difference]: Without dead ends: 272 [2018-10-24 17:10:54,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-24 17:10:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-24 17:10:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2018-10-24 17:10:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-24 17:10:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2018-10-24 17:10:54,571 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2018-10-24 17:10:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:54,572 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2018-10-24 17:10:54,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 17:10:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2018-10-24 17:10:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-24 17:10:54,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:54,573 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-10-24 17:10:54,574 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:54,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:54,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1370174976, now seen corresponding path program 1 times [2018-10-24 17:10:54,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:54,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:54,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:54,770 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 17:10:55,258 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 17:10:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:55,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:55,497 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:55,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:55,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:55,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:55,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-24 17:10:55,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-24 17:10:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-24 17:10:55,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-24 17:10:55,835 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 17 states. [2018-10-24 17:10:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:56,126 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2018-10-24 17:10:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 17:10:56,127 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2018-10-24 17:10:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:56,129 INFO L225 Difference]: With dead ends: 271 [2018-10-24 17:10:56,129 INFO L226 Difference]: Without dead ends: 269 [2018-10-24 17:10:56,130 INFO L605 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-10-24 17:10:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-24 17:10:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-10-24 17:10:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-24 17:10:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2018-10-24 17:10:56,138 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2018-10-24 17:10:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:56,139 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2018-10-24 17:10:56,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-24 17:10:56,139 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2018-10-24 17:10:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-24 17:10:56,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:56,141 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-10-24 17:10:56,141 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:56,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash 903292370, now seen corresponding path program 2 times [2018-10-24 17:10:56,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:56,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:56,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:56,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:10:56,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:56,921 WARN L179 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-10-24 17:10:57,422 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 17:10:57,631 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-10-24 17:10:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:57,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:57,812 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:57,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:10:57,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:10:57,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:10:57,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:58,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:58,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-24 17:10:58,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 17:10:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 17:10:58,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-10-24 17:10:58,148 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 13 states. [2018-10-24 17:10:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:58,608 INFO L93 Difference]: Finished difference Result 272 states and 382 transitions. [2018-10-24 17:10:58,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 17:10:58,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-10-24 17:10:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:58,611 INFO L225 Difference]: With dead ends: 272 [2018-10-24 17:10:58,611 INFO L226 Difference]: Without dead ends: 270 [2018-10-24 17:10:58,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-10-24 17:10:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-24 17:10:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-10-24 17:10:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-24 17:10:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2018-10-24 17:10:58,619 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2018-10-24 17:10:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:58,619 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2018-10-24 17:10:58,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 17:10:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2018-10-24 17:10:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-24 17:10:58,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:58,621 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-10-24 17:10:58,621 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:58,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:58,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1176536002, now seen corresponding path program 2 times [2018-10-24 17:10:58,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:58,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:58,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:58,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:10:58,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:10:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-24 17:10:59,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:10:59,073 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:10:59,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:10:59,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:10:59,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:10:59,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:10:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:10:59,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:10:59,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-10-24 17:10:59,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 17:10:59,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 17:10:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-10-24 17:10:59,525 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 19 states. [2018-10-24 17:10:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:10:59,932 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2018-10-24 17:10:59,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 17:10:59,932 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 119 [2018-10-24 17:10:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:10:59,935 INFO L225 Difference]: With dead ends: 379 [2018-10-24 17:10:59,935 INFO L226 Difference]: Without dead ends: 289 [2018-10-24 17:10:59,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-10-24 17:10:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-24 17:10:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-10-24 17:10:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-24 17:10:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2018-10-24 17:10:59,943 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2018-10-24 17:10:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:10:59,943 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2018-10-24 17:10:59,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 17:10:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2018-10-24 17:10:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 17:10:59,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:10:59,945 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 17:10:59,945 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:10:59,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:10:59,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1647353035, now seen corresponding path program 2 times [2018-10-24 17:10:59,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:10:59,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:10:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:59,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:10:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:10:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 17:11:00,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:00,152 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:00,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:11:00,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:11:00,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:00,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 17:11:00,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:00,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-10-24 17:11:00,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 17:11:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 17:11:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:11:00,389 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 9 states. [2018-10-24 17:11:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:00,685 INFO L93 Difference]: Finished difference Result 402 states and 573 transitions. [2018-10-24 17:11:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 17:11:00,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-10-24 17:11:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:00,688 INFO L225 Difference]: With dead ends: 402 [2018-10-24 17:11:00,689 INFO L226 Difference]: Without dead ends: 312 [2018-10-24 17:11:00,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:11:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-24 17:11:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2018-10-24 17:11:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-24 17:11:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2018-10-24 17:11:00,698 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2018-10-24 17:11:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:00,699 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2018-10-24 17:11:00,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 17:11:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2018-10-24 17:11:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-24 17:11:00,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:00,700 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-10-24 17:11:00,701 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:00,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash 778512671, now seen corresponding path program 2 times [2018-10-24 17:11:00,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:00,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:00,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:00,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:00,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:11:01,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:01,261 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:01,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:11:01,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:11:01,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:01,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:11:01,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:01,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-24 17:11:01,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 17:11:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 17:11:01,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-24 17:11:01,532 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 13 states. [2018-10-24 17:11:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:01,981 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2018-10-24 17:11:01,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 17:11:01,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2018-10-24 17:11:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:01,984 INFO L225 Difference]: With dead ends: 311 [2018-10-24 17:11:01,984 INFO L226 Difference]: Without dead ends: 309 [2018-10-24 17:11:01,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-24 17:11:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-24 17:11:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-10-24 17:11:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-24 17:11:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2018-10-24 17:11:01,994 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2018-10-24 17:11:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:01,994 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2018-10-24 17:11:01,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 17:11:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2018-10-24 17:11:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-24 17:11:01,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:01,996 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-10-24 17:11:01,996 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:01,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:01,997 INFO L82 PathProgramCache]: Analyzing trace with hash 199268015, now seen corresponding path program 2 times [2018-10-24 17:11:01,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:01,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:01,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 17:11:02,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:02,513 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:02,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:11:02,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:11:02,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:02,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 17:11:02,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:02,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-24 17:11:02,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 17:11:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 17:11:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:11:02,745 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2018-10-24 17:11:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:02,989 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2018-10-24 17:11:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 17:11:02,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2018-10-24 17:11:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:02,992 INFO L225 Difference]: With dead ends: 442 [2018-10-24 17:11:02,992 INFO L226 Difference]: Without dead ends: 350 [2018-10-24 17:11:02,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-24 17:11:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-24 17:11:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2018-10-24 17:11:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-24 17:11:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2018-10-24 17:11:03,001 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2018-10-24 17:11:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:03,001 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2018-10-24 17:11:03,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 17:11:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2018-10-24 17:11:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-24 17:11:03,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:03,003 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-10-24 17:11:03,003 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:03,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:03,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2020860881, now seen corresponding path program 2 times [2018-10-24 17:11:03,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:03,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:03,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:11:03,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:03,623 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:03,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:11:03,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:11:03,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:03,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:11:04,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:04,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-10-24 17:11:04,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-24 17:11:04,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-24 17:11:04,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-10-24 17:11:04,172 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 25 states. [2018-10-24 17:11:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:04,773 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2018-10-24 17:11:04,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 17:11:04,774 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2018-10-24 17:11:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:04,776 INFO L225 Difference]: With dead ends: 349 [2018-10-24 17:11:04,776 INFO L226 Difference]: Without dead ends: 347 [2018-10-24 17:11:04,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-10-24 17:11:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-24 17:11:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-24 17:11:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-24 17:11:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2018-10-24 17:11:04,786 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2018-10-24 17:11:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:04,787 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2018-10-24 17:11:04,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-24 17:11:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2018-10-24 17:11:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 17:11:04,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:04,788 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-10-24 17:11:04,788 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:04,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1480030945, now seen corresponding path program 3 times [2018-10-24 17:11:04,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:04,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:04,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:05,321 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-10-24 17:11:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:11:05,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:05,869 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:05,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 17:11:05,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 17:11:05,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:05,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:06,839 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 10 [2018-10-24 17:11:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 249 proven. 31 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-10-24 17:11:07,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:07,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2018-10-24 17:11:07,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 17:11:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 17:11:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-10-24 17:11:07,092 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 22 states. [2018-10-24 17:11:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:09,801 INFO L93 Difference]: Finished difference Result 545 states and 767 transitions. [2018-10-24 17:11:09,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 17:11:09,802 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 155 [2018-10-24 17:11:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:09,804 INFO L225 Difference]: With dead ends: 545 [2018-10-24 17:11:09,804 INFO L226 Difference]: Without dead ends: 449 [2018-10-24 17:11:09,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 17:11:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-24 17:11:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2018-10-24 17:11:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-24 17:11:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2018-10-24 17:11:09,816 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2018-10-24 17:11:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:09,817 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2018-10-24 17:11:09,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-24 17:11:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2018-10-24 17:11:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-24 17:11:09,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:09,818 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-10-24 17:11:09,819 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:09,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:09,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1330761773, now seen corresponding path program 1 times [2018-10-24 17:11:09,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:09,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:09,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:09,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:09,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-24 17:11:10,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:10,058 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:11:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:10,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-24 17:11:10,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:10,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-24 17:11:10,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 17:11:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 17:11:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-24 17:11:10,261 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 10 states. [2018-10-24 17:11:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:10,751 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2018-10-24 17:11:10,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 17:11:10,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-10-24 17:11:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:10,754 INFO L225 Difference]: With dead ends: 927 [2018-10-24 17:11:10,754 INFO L226 Difference]: Without dead ends: 760 [2018-10-24 17:11:10,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-24 17:11:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-24 17:11:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2018-10-24 17:11:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-10-24 17:11:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2018-10-24 17:11:10,772 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2018-10-24 17:11:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:10,773 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2018-10-24 17:11:10,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 17:11:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2018-10-24 17:11:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-24 17:11:10,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:10,774 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-10-24 17:11:10,775 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:10,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:10,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1753421813, now seen corresponding path program 1 times [2018-10-24 17:11:10,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:10,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:10,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:10,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:11:10,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:11,479 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-10-24 17:11:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 45 proven. 611 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 17:11:11,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:11,643 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:11,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:11:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:11,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 17:11:11,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 17:11:11,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-10-24 17:11:11,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 17:11:11,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 17:11:11,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-10-24 17:11:11,972 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 18 states. [2018-10-24 17:11:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:12,276 INFO L93 Difference]: Finished difference Result 864 states and 1212 transitions. [2018-10-24 17:11:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 17:11:12,277 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 177 [2018-10-24 17:11:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:12,281 INFO L225 Difference]: With dead ends: 864 [2018-10-24 17:11:12,281 INFO L226 Difference]: Without dead ends: 859 [2018-10-24 17:11:12,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-10-24 17:11:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-10-24 17:11:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 852. [2018-10-24 17:11:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-10-24 17:11:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2018-10-24 17:11:12,299 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2018-10-24 17:11:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:12,299 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2018-10-24 17:11:12,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 17:11:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2018-10-24 17:11:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-24 17:11:12,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:12,301 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-10-24 17:11:12,301 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:12,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1467051216, now seen corresponding path program 3 times [2018-10-24 17:11:12,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:12,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:11:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:12,685 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 17:11:12,856 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:11:13,045 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 17:11:13,247 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 17:11:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:11:13,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:13,697 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:13,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 17:11:13,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-10-24 17:11:13,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:13,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:15,205 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-10-24 17:11:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 626 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-24 17:11:15,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:15,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2018-10-24 17:11:15,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-24 17:11:15,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-24 17:11:15,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-10-24 17:11:15,276 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 25 states. [2018-10-24 17:11:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:16,854 INFO L93 Difference]: Finished difference Result 855 states and 1203 transitions. [2018-10-24 17:11:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 17:11:16,855 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-10-24 17:11:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:16,858 INFO L225 Difference]: With dead ends: 855 [2018-10-24 17:11:16,858 INFO L226 Difference]: Without dead ends: 853 [2018-10-24 17:11:16,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-10-24 17:11:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-10-24 17:11:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2018-10-24 17:11:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-10-24 17:11:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1201 transitions. [2018-10-24 17:11:16,880 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1201 transitions. Word has length 178 [2018-10-24 17:11:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:16,881 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1201 transitions. [2018-10-24 17:11:16,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-24 17:11:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1201 transitions. [2018-10-24 17:11:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-24 17:11:16,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:16,883 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-10-24 17:11:16,883 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:16,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:16,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1843336189, now seen corresponding path program 1 times [2018-10-24 17:11:16,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:16,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:16,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 17:11:18,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:18,181 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:18,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:11:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:18,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 17:11:18,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:18,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-24 17:11:18,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 17:11:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 17:11:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-24 17:11:18,426 INFO L87 Difference]: Start difference. First operand 853 states and 1201 transitions. Second operand 11 states. [2018-10-24 17:11:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:18,664 INFO L93 Difference]: Finished difference Result 1435 states and 2016 transitions. [2018-10-24 17:11:18,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 17:11:18,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2018-10-24 17:11:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:18,668 INFO L225 Difference]: With dead ends: 1435 [2018-10-24 17:11:18,668 INFO L226 Difference]: Without dead ends: 959 [2018-10-24 17:11:18,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-24 17:11:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-10-24 17:11:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2018-10-24 17:11:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-10-24 17:11:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1312 transitions. [2018-10-24 17:11:18,691 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1312 transitions. Word has length 193 [2018-10-24 17:11:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:18,692 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-10-24 17:11:18,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 17:11:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1312 transitions. [2018-10-24 17:11:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-24 17:11:18,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:18,693 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-10-24 17:11:18,693 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:18,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1976503266, now seen corresponding path program 3 times [2018-10-24 17:11:18,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:18,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:18,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 17:11:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 17:11:19,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:19,242 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:19,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 17:11:19,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-10-24 17:11:19,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:19,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-24 17:11:20,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:20,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-10-24 17:11:20,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 17:11:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 17:11:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2018-10-24 17:11:20,031 INFO L87 Difference]: Start difference. First operand 930 states and 1312 transitions. Second operand 29 states. [2018-10-24 17:11:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:21,052 INFO L93 Difference]: Finished difference Result 938 states and 1318 transitions. [2018-10-24 17:11:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-24 17:11:21,053 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 194 [2018-10-24 17:11:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:21,057 INFO L225 Difference]: With dead ends: 938 [2018-10-24 17:11:21,057 INFO L226 Difference]: Without dead ends: 936 [2018-10-24 17:11:21,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=274, Invalid=1058, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 17:11:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-10-24 17:11:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 930. [2018-10-24 17:11:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-10-24 17:11:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2018-10-24 17:11:21,078 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 194 [2018-10-24 17:11:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:21,078 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2018-10-24 17:11:21,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 17:11:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2018-10-24 17:11:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-24 17:11:21,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:21,080 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-10-24 17:11:21,080 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:21,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1917318174, now seen corresponding path program 2 times [2018-10-24 17:11:21,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:21,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:21,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 17:11:21,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:21,522 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:21,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:11:21,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:11:21,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:21,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 17:11:21,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:21,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-24 17:11:21,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 17:11:21,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 17:11:21,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-24 17:11:21,780 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand 12 states. [2018-10-24 17:11:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:21,966 INFO L93 Difference]: Finished difference Result 1125 states and 1564 transitions. [2018-10-24 17:11:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 17:11:21,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2018-10-24 17:11:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:21,972 INFO L225 Difference]: With dead ends: 1125 [2018-10-24 17:11:21,972 INFO L226 Difference]: Without dead ends: 1040 [2018-10-24 17:11:21,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-24 17:11:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-10-24 17:11:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2018-10-24 17:11:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2018-10-24 17:11:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1416 transitions. [2018-10-24 17:11:21,996 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1416 transitions. Word has length 211 [2018-10-24 17:11:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:21,997 INFO L481 AbstractCegarLoop]: Abstraction has 1008 states and 1416 transitions. [2018-10-24 17:11:21,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 17:11:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1416 transitions. [2018-10-24 17:11:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-24 17:11:21,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:21,999 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-10-24 17:11:21,999 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:21,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash 196553618, now seen corresponding path program 2 times [2018-10-24 17:11:21,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:21,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:22,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-24 17:11:23,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:23,059 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:23,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 17:11:23,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 17:11:23,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:23,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-24 17:11:23,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:23,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-24 17:11:23,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 17:11:23,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 17:11:23,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-24 17:11:23,331 INFO L87 Difference]: Start difference. First operand 1008 states and 1416 transitions. Second operand 13 states. [2018-10-24 17:11:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:23,524 INFO L93 Difference]: Finished difference Result 1675 states and 2346 transitions. [2018-10-24 17:11:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 17:11:23,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 239 [2018-10-24 17:11:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:23,530 INFO L225 Difference]: With dead ends: 1675 [2018-10-24 17:11:23,530 INFO L226 Difference]: Without dead ends: 1121 [2018-10-24 17:11:23,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-24 17:11:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-24 17:11:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2018-10-24 17:11:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-10-24 17:11:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1527 transitions. [2018-10-24 17:11:23,555 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1527 transitions. Word has length 239 [2018-10-24 17:11:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:23,555 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1527 transitions. [2018-10-24 17:11:23,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 17:11:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1527 transitions. [2018-10-24 17:11:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-24 17:11:23,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:23,557 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-10-24 17:11:23,558 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:23,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash -569825871, now seen corresponding path program 3 times [2018-10-24 17:11:23,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:23,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:23,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:23,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:23,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 17:11:23,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:23,959 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:23,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 17:11:24,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-10-24 17:11:24,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:24,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 17:11:24,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:24,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-24 17:11:24,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 17:11:24,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 17:11:24,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-24 17:11:24,357 INFO L87 Difference]: Start difference. First operand 1086 states and 1527 transitions. Second operand 14 states. [2018-10-24 17:11:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:24,650 INFO L93 Difference]: Finished difference Result 1287 states and 1786 transitions. [2018-10-24 17:11:24,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 17:11:24,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 257 [2018-10-24 17:11:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:24,656 INFO L225 Difference]: With dead ends: 1287 [2018-10-24 17:11:24,656 INFO L226 Difference]: Without dead ends: 1202 [2018-10-24 17:11:24,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-24 17:11:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-10-24 17:11:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2018-10-24 17:11:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-10-24 17:11:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1634 transitions. [2018-10-24 17:11:24,683 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1634 transitions. Word has length 257 [2018-10-24 17:11:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:24,683 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1634 transitions. [2018-10-24 17:11:24,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 17:11:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1634 transitions. [2018-10-24 17:11:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-24 17:11:24,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:24,686 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-10-24 17:11:24,686 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:24,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:24,686 INFO L82 PathProgramCache]: Analyzing trace with hash -579696415, now seen corresponding path program 3 times [2018-10-24 17:11:24,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:24,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:24,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:24,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:24,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-24 17:11:25,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:25,058 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:25,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 17:11:25,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-24 17:11:25,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:25,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:25,537 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-10-24 17:11:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-10-24 17:11:25,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:25,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-10-24 17:11:25,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 17:11:25,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 17:11:25,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-10-24 17:11:25,927 INFO L87 Difference]: Start difference. First operand 1164 states and 1634 transitions. Second operand 19 states. [2018-10-24 17:11:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:27,038 INFO L93 Difference]: Finished difference Result 1314 states and 1834 transitions. [2018-10-24 17:11:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 17:11:27,039 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2018-10-24 17:11:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:27,041 INFO L225 Difference]: With dead ends: 1314 [2018-10-24 17:11:27,041 INFO L226 Difference]: Without dead ends: 682 [2018-10-24 17:11:27,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 17:11:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-10-24 17:11:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 659. [2018-10-24 17:11:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-10-24 17:11:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2018-10-24 17:11:27,059 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 285 [2018-10-24 17:11:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:27,059 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2018-10-24 17:11:27,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 17:11:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2018-10-24 17:11:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-24 17:11:27,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:27,062 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-10-24 17:11:27,063 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:27,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash 981783183, now seen corresponding path program 4 times [2018-10-24 17:11:27,063 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:27,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:27,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 17:11:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-24 17:11:27,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 17:11:27,913 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 17:11:27,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 17:11:28,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 17:11:28,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 17:11:28,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 17:11:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-24 17:11:28,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 17:11:28,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-24 17:11:28,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 17:11:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 17:11:28,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-24 17:11:28,404 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 18 states. [2018-10-24 17:11:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 17:11:29,580 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2018-10-24 17:11:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 17:11:29,580 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 349 [2018-10-24 17:11:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 17:11:29,584 INFO L225 Difference]: With dead ends: 865 [2018-10-24 17:11:29,584 INFO L226 Difference]: Without dead ends: 780 [2018-10-24 17:11:29,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-24 17:11:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-10-24 17:11:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2018-10-24 17:11:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-10-24 17:11:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2018-10-24 17:11:29,598 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2018-10-24 17:11:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 17:11:29,599 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2018-10-24 17:11:29,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 17:11:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2018-10-24 17:11:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-24 17:11:29,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 17:11:29,602 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-10-24 17:11:29,602 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 17:11:29,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 17:11:29,602 INFO L82 PathProgramCache]: Analyzing trace with hash -487111266, now seen corresponding path program 5 times [2018-10-24 17:11:29,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 17:11:29,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 17:11:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:29,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 17:11:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 17:11:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 17:11:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-24 17:11:31,108 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-24 17:11:31,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:11:31 BoogieIcfgContainer [2018-10-24 17:11:31,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 17:11:31,378 INFO L168 Benchmark]: Toolchain (without parser) took 57284.64 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -615.3 MB). Peak memory consumption was 650.8 MB. Max. memory is 7.1 GB. [2018-10-24 17:11:31,379 INFO L168 Benchmark]: CDTParser took 0.24 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-10-24 17:11:31,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.21 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-10-24 17:11:31,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 17:11:31,380 INFO L168 Benchmark]: Boogie Preprocessor took 173.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2018-10-24 17:11:31,382 INFO L168 Benchmark]: RCFGBuilder took 2000.19 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.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-10-24 17:11:31,382 INFO L168 Benchmark]: TraceAbstraction took 54463.40 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 505.9 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 124.2 MB). Peak memory consumption was 630.2 MB. Max. memory is 7.1 GB. [2018-10-24 17:11:31,390 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.24 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 528.21 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 114.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2000.19 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.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54463.40 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 505.9 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 124.2 MB). Peak memory consumption was 630.2 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, 54.3s OverallTime, 40 OverallIterations, 35 TraceHistogramMax, 20.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8468 SDtfs, 12147 SDslu, 55543 SDs, 0 SdLazy, 8444 SolverSat, 584 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4433 GetRequests, 4017 SyntacticMatches, 38 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=37, 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.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 356 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 8561 NumberOfCodeBlocks, 8239 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 8097 ConstructedInterpolants, 0 QuantifiedInterpolants, 6689054 SizeOfPredicates, 67 NumberOfNonLiveVariables, 21692 ConjunctsInSsa, 705 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 7790/31839 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...