java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:59:21,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:59:21,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:59:21,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:59:21,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:59:21,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:59:21,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:59:21,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:59:21,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:59:21,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:59:21,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:59:21,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:59:21,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:59:21,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:59:21,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:59:21,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:59:21,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:59:21,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:59:21,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:59:21,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:59:21,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:59:21,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:59:21,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:59:21,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:59:21,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:59:21,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:59:21,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:59:21,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:59:21,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:59:21,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:59:21,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:59:21,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:59:21,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:59:21,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:59:21,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:59:21,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:59:21,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:59:21,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:59:21,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:59:21,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:59:21,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:59:21,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:59:21,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:59:21,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:59:21,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:59:21,403 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:59:21,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:59:21,404 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:59:21,404 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:59:21,404 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:59:21,404 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:59:21,404 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:59:21,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:59:21,405 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:59:21,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:59:21,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:59:21,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:59:21,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:59:21,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:59:21,407 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:59:21,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:59:21,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:59:21,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:59:21,407 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:59:21,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:59:21,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:21,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:59:21,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:59:21,408 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:59:21,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:59:21,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:59:21,409 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:59:21,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:59:21,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:59:21,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:59:21,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:59:21,473 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:59:21,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-10-03 02:59:21,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d833d31/3c519121201b4cdf817d81c2a2b369e4/FLAG3bf8b46f5 [2019-10-03 02:59:22,080 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:59:22,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-10-03 02:59:22,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d833d31/3c519121201b4cdf817d81c2a2b369e4/FLAG3bf8b46f5 [2019-10-03 02:59:22,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d833d31/3c519121201b4cdf817d81c2a2b369e4 [2019-10-03 02:59:22,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:59:22,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:59:22,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:22,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:59:22,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:59:22,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:22" (1/1) ... [2019-10-03 02:59:22,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f51fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:22, skipping insertion in model container [2019-10-03 02:59:22,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:22" (1/1) ... [2019-10-03 02:59:22,374 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:59:22,425 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:59:22,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:22,871 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:59:22,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:23,010 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:59:23,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23 WrapperNode [2019-10-03 02:59:23,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:23,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:59:23,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:59:23,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:59:23,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (1/1) ... [2019-10-03 02:59:23,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (1/1) ... [2019-10-03 02:59:23,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (1/1) ... [2019-10-03 02:59:23,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (1/1) ... [2019-10-03 02:59:23,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (1/1) ... [2019-10-03 02:59:23,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (1/1) ... [2019-10-03 02:59:23,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (1/1) ... [2019-10-03 02:59:23,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:59:23,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:59:23,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:59:23,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:59:23,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:59:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:59:23,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:59:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:59:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:59:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:59:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:59:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:59:24,067 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:59:24,068 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-03 02:59:24,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:24 BoogieIcfgContainer [2019-10-03 02:59:24,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:59:24,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:59:24,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:59:24,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:59:24,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:59:22" (1/3) ... [2019-10-03 02:59:24,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fbb1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:24, skipping insertion in model container [2019-10-03 02:59:24,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:23" (2/3) ... [2019-10-03 02:59:24,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73fbb1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:24, skipping insertion in model container [2019-10-03 02:59:24,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:24" (3/3) ... [2019-10-03 02:59:24,080 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-10-03 02:59:24,091 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:59:24,101 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:59:24,121 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:59:24,153 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:59:24,153 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:59:24,153 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:59:24,154 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:59:24,154 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:59:24,154 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:59:24,155 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:59:24,155 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:59:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-10-03 02:59:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:59:24,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:24,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:24,193 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash 218362772, now seen corresponding path program 1 times [2019-10-03 02:59:24,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:24,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:24,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:24,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:24,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:24,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:24,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:24,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:24,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:24,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:24,405 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-10-03 02:59:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:24,827 INFO L93 Difference]: Finished difference Result 222 states and 406 transitions. [2019-10-03 02:59:24,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:24,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-03 02:59:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:24,844 INFO L225 Difference]: With dead ends: 222 [2019-10-03 02:59:24,844 INFO L226 Difference]: Without dead ends: 206 [2019-10-03 02:59:24,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-03 02:59:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-10-03 02:59:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-03 02:59:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2019-10-03 02:59:24,902 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 13 [2019-10-03 02:59:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:24,903 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2019-10-03 02:59:24,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2019-10-03 02:59:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-03 02:59:24,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:24,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:24,905 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash 486806227, now seen corresponding path program 1 times [2019-10-03 02:59:24,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:24,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:24,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:24,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:24,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:24,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:24,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:24,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:24,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:24,958 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2019-10-03 02:59:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:24,999 INFO L93 Difference]: Finished difference Result 189 states and 322 transitions. [2019-10-03 02:59:25,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:25,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-03 02:59:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:25,003 INFO L225 Difference]: With dead ends: 189 [2019-10-03 02:59:25,004 INFO L226 Difference]: Without dead ends: 189 [2019-10-03 02:59:25,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-03 02:59:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-10-03 02:59:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-03 02:59:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2019-10-03 02:59:25,023 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 14 [2019-10-03 02:59:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:25,024 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2019-10-03 02:59:25,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2019-10-03 02:59:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:59:25,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:25,025 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:25,026 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:25,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:25,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1338497339, now seen corresponding path program 1 times [2019-10-03 02:59:25,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:25,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:25,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:25,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:25,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:25,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:59:25,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:25,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:59:25,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:59:25,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:59:25,468 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 5 states. [2019-10-03 02:59:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:25,928 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2019-10-03 02:59:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:59:25,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-03 02:59:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:25,931 INFO L225 Difference]: With dead ends: 290 [2019-10-03 02:59:25,931 INFO L226 Difference]: Without dead ends: 276 [2019-10-03 02:59:25,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:59:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-03 02:59:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2019-10-03 02:59:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-03 02:59:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2019-10-03 02:59:25,960 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 20 [2019-10-03 02:59:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:25,961 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2019-10-03 02:59:25,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:59:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2019-10-03 02:59:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:59:25,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:25,963 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:25,964 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1294991850, now seen corresponding path program 1 times [2019-10-03 02:59:25,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:25,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:25,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:25,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:26,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:26,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:26,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:26,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:26,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:26,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:26,039 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2019-10-03 02:59:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:26,078 INFO L93 Difference]: Finished difference Result 216 states and 356 transitions. [2019-10-03 02:59:26,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:26,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:59:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:26,081 INFO L225 Difference]: With dead ends: 216 [2019-10-03 02:59:26,081 INFO L226 Difference]: Without dead ends: 216 [2019-10-03 02:59:26,082 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-03 02:59:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-10-03 02:59:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-03 02:59:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2019-10-03 02:59:26,103 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 21 [2019-10-03 02:59:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:26,104 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2019-10-03 02:59:26,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2019-10-03 02:59:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:59:26,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:26,113 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:26,114 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash -438692304, now seen corresponding path program 1 times [2019-10-03 02:59:26,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:26,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:26,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:26,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:26,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:26,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:26,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-10-03 02:59:26,252 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [53], [55], [525], [531], [532], [533], [534] [2019-10-03 02:59:26,299 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:26,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:26,504 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:28,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:28,029 INFO L272 AbstractInterpreter]: Visited 21 different actions 45 times. Merged at 12 different actions 18 times. Never widened. Performed 238 root evaluator evaluations with a maximum evaluation depth of 15. Performed 238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2019-10-03 02:59:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:28,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:28,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:28,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:28,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:28,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:28,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 02:59:28,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 02:59:28,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 02:59:28,164 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:59:28,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-03 02:59:28,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:28,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:28,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:28,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:59:28,166 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 3 states. [2019-10-03 02:59:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:28,211 INFO L93 Difference]: Finished difference Result 182 states and 292 transitions. [2019-10-03 02:59:28,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:28,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:59:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:28,213 INFO L225 Difference]: With dead ends: 182 [2019-10-03 02:59:28,214 INFO L226 Difference]: Without dead ends: 182 [2019-10-03 02:59:28,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:59:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-03 02:59:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-10-03 02:59:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-03 02:59:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 291 transitions. [2019-10-03 02:59:28,231 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 291 transitions. Word has length 27 [2019-10-03 02:59:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:28,231 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 291 transitions. [2019-10-03 02:59:28,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 291 transitions. [2019-10-03 02:59:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:59:28,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:28,233 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:28,234 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:28,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1434478097, now seen corresponding path program 1 times [2019-10-03 02:59:28,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:28,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:28,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:28,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:28,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:28,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:28,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:28,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2019-10-03 02:59:28,300 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [238], [241], [244], [525], [531], [532], [533], [534] [2019-10-03 02:59:28,302 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:28,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:28,317 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:29,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:29,161 INFO L272 AbstractInterpreter]: Visited 26 different actions 74 times. Merged at 17 different actions 38 times. Never widened. Performed 337 root evaluator evaluations with a maximum evaluation depth of 15. Performed 337 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 5 fixpoints after 3 different actions. Largest state had 39 variables. [2019-10-03 02:59:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:29,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:29,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:29,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 02:59:29,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:29,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,255 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:29,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 02:59:29,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:29,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:59:29,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:59:29,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:59:29,281 INFO L87 Difference]: Start difference. First operand 180 states and 291 transitions. Second operand 6 states. [2019-10-03 02:59:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:29,754 INFO L93 Difference]: Finished difference Result 540 states and 831 transitions. [2019-10-03 02:59:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:59:29,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-10-03 02:59:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:29,758 INFO L225 Difference]: With dead ends: 540 [2019-10-03 02:59:29,758 INFO L226 Difference]: Without dead ends: 507 [2019-10-03 02:59:29,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:59:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-03 02:59:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 438. [2019-10-03 02:59:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-10-03 02:59:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 730 transitions. [2019-10-03 02:59:29,770 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 730 transitions. Word has length 29 [2019-10-03 02:59:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:29,771 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 730 transitions. [2019-10-03 02:59:29,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:59:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 730 transitions. [2019-10-03 02:59:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:59:29,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:29,772 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:29,772 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1137564592, now seen corresponding path program 1 times [2019-10-03 02:59:29,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:29,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:29,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2019-10-03 02:59:29,962 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [259], [525], [531], [532], [533], [534] [2019-10-03 02:59:29,967 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:29,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:29,982 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:30,498 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:30,499 INFO L272 AbstractInterpreter]: Visited 26 different actions 53 times. Merged at 16 different actions 22 times. Never widened. Performed 258 root evaluator evaluations with a maximum evaluation depth of 15. Performed 258 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 4 fixpoints after 3 different actions. Largest state had 40 variables. [2019-10-03 02:59:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:30,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:30,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:30,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-03 02:59:30,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:30,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:30,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:30,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:30,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-10-03 02:59:30,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:30,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:59:30,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:59:30,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:59:30,682 INFO L87 Difference]: Start difference. First operand 438 states and 730 transitions. Second operand 6 states. [2019-10-03 02:59:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,909 INFO L93 Difference]: Finished difference Result 493 states and 812 transitions. [2019-10-03 02:59:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:59:30,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-03 02:59:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,916 INFO L225 Difference]: With dead ends: 493 [2019-10-03 02:59:30,917 INFO L226 Difference]: Without dead ends: 490 [2019-10-03 02:59:30,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:59:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-03 02:59:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 484. [2019-10-03 02:59:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-03 02:59:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 802 transitions. [2019-10-03 02:59:30,935 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 802 transitions. Word has length 30 [2019-10-03 02:59:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,938 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 802 transitions. [2019-10-03 02:59:30,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:59:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 802 transitions. [2019-10-03 02:59:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:59:30,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,945 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:30,945 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash -49035728, now seen corresponding path program 1 times [2019-10-03 02:59:30,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 02:59:30,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,999 INFO L87 Difference]: Start difference. First operand 484 states and 802 transitions. Second operand 3 states. [2019-10-03 02:59:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:31,041 INFO L93 Difference]: Finished difference Result 495 states and 795 transitions. [2019-10-03 02:59:31,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:31,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:59:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:31,046 INFO L225 Difference]: With dead ends: 495 [2019-10-03 02:59:31,047 INFO L226 Difference]: Without dead ends: 495 [2019-10-03 02:59:31,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-03 02:59:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-10-03 02:59:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-03 02:59:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 794 transitions. [2019-10-03 02:59:31,066 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 794 transitions. Word has length 31 [2019-10-03 02:59:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:31,067 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 794 transitions. [2019-10-03 02:59:31,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 794 transitions. [2019-10-03 02:59:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 02:59:31,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:31,068 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:59:31,068 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash -382323394, now seen corresponding path program 1 times [2019-10-03 02:59:31,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:31,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:31,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 02:59:31,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:31,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:31,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:31,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:31,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:31,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:31,148 INFO L87 Difference]: Start difference. First operand 493 states and 794 transitions. Second operand 3 states. [2019-10-03 02:59:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:31,197 INFO L93 Difference]: Finished difference Result 495 states and 789 transitions. [2019-10-03 02:59:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:31,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-03 02:59:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:31,202 INFO L225 Difference]: With dead ends: 495 [2019-10-03 02:59:31,202 INFO L226 Difference]: Without dead ends: 495 [2019-10-03 02:59:31,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-03 02:59:31,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2019-10-03 02:59:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-03 02:59:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 788 transitions. [2019-10-03 02:59:31,220 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 788 transitions. Word has length 39 [2019-10-03 02:59:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:31,221 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 788 transitions. [2019-10-03 02:59:31,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 788 transitions. [2019-10-03 02:59:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-03 02:59:31,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:31,224 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-10-03 02:59:31,224 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash -510837400, now seen corresponding path program 1 times [2019-10-03 02:59:31,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:31,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:59:31,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:31,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:31,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2019-10-03 02:59:31,454 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [334], [337], [340], [525], [531], [532], [533], [534] [2019-10-03 02:59:31,459 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:31,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:31,470 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:33,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:33,226 INFO L272 AbstractInterpreter]: Visited 31 different actions 174 times. Merged at 23 different actions 123 times. Widened at 2 different actions 5 times. Performed 885 root evaluator evaluations with a maximum evaluation depth of 15. Performed 885 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 19 fixpoints after 9 different actions. Largest state had 41 variables. [2019-10-03 02:59:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:33,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:33,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:33,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:33,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:33,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:33,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 02:59:33,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:59:33,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:33,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:33,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:33,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:33,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:33,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:33,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:33,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:59:33,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:33,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-10-03 02:59:33,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:33,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:59:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:59:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:59:33,547 INFO L87 Difference]: Start difference. First operand 493 states and 788 transitions. Second operand 6 states. [2019-10-03 02:59:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:33,766 INFO L93 Difference]: Finished difference Result 564 states and 886 transitions. [2019-10-03 02:59:33,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:59:33,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-10-03 02:59:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:33,770 INFO L225 Difference]: With dead ends: 564 [2019-10-03 02:59:33,770 INFO L226 Difference]: Without dead ends: 557 [2019-10-03 02:59:33,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:59:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-03 02:59:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 544. [2019-10-03 02:59:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-03 02:59:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 867 transitions. [2019-10-03 02:59:33,786 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 867 transitions. Word has length 40 [2019-10-03 02:59:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:33,786 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 867 transitions. [2019-10-03 02:59:33,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:59:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 867 transitions. [2019-10-03 02:59:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 02:59:33,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:33,788 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 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, 1] [2019-10-03 02:59:33,788 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1355356315, now seen corresponding path program 1 times [2019-10-03 02:59:33,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:33,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:33,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:33,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:33,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:59:33,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:33,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:33,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2019-10-03 02:59:33,892 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [349], [352], [355], [525], [531], [532], [533], [534] [2019-10-03 02:59:33,896 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:33,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:33,906 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:35,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:35,702 INFO L272 AbstractInterpreter]: Visited 32 different actions 182 times. Merged at 21 different actions 130 times. Widened at 2 different actions 5 times. Performed 866 root evaluator evaluations with a maximum evaluation depth of 15. Performed 866 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 19 fixpoints after 6 different actions. Largest state had 42 variables. [2019-10-03 02:59:35,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:35,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:35,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:35,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:35,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:35,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:35,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-03 02:59:35,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:59:35,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:59:35,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:35,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-10-03 02:59:35,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:35,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:59:35,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:59:35,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:59:35,805 INFO L87 Difference]: Start difference. First operand 544 states and 867 transitions. Second operand 4 states. [2019-10-03 02:59:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:35,916 INFO L93 Difference]: Finished difference Result 556 states and 868 transitions. [2019-10-03 02:59:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:59:35,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-03 02:59:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:35,920 INFO L225 Difference]: With dead ends: 556 [2019-10-03 02:59:35,920 INFO L226 Difference]: Without dead ends: 546 [2019-10-03 02:59:35,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:59:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-03 02:59:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-10-03 02:59:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-03 02:59:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 841 transitions. [2019-10-03 02:59:35,932 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 841 transitions. Word has length 41 [2019-10-03 02:59:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:35,932 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 841 transitions. [2019-10-03 02:59:35,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:59:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 841 transitions. [2019-10-03 02:59:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 02:59:35,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:35,933 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1] [2019-10-03 02:59:35,934 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1488632364, now seen corresponding path program 1 times [2019-10-03 02:59:35,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:35,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:35,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:36,420 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 34 [2019-10-03 02:59:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:36,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:36,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:36,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2019-10-03 02:59:36,558 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [385], [525], [531], [532], [533], [534] [2019-10-03 02:59:36,560 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:36,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:36,567 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:37,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:37,295 INFO L272 AbstractInterpreter]: Visited 34 different actions 74 times. Merged at 17 different actions 31 times. Never widened. Performed 344 root evaluator evaluations with a maximum evaluation depth of 15. Performed 344 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 8 fixpoints after 5 different actions. Largest state had 44 variables. [2019-10-03 02:59:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:37,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:37,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:37,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:37,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:37,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:37,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 02:59:37,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:37,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:37,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 02:59:37,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 02:59:37,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 02:59:37,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:59:37,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:59:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:37,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2019-10-03 02:59:37,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:37,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:59:37,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:59:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:59:37,812 INFO L87 Difference]: Start difference. First operand 544 states and 841 transitions. Second operand 7 states. [2019-10-03 02:59:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:38,209 INFO L93 Difference]: Finished difference Result 553 states and 848 transitions. [2019-10-03 02:59:38,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:59:38,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-10-03 02:59:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:38,213 INFO L225 Difference]: With dead ends: 553 [2019-10-03 02:59:38,213 INFO L226 Difference]: Without dead ends: 553 [2019-10-03 02:59:38,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:59:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-03 02:59:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 545. [2019-10-03 02:59:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-03 02:59:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 842 transitions. [2019-10-03 02:59:38,225 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 842 transitions. Word has length 43 [2019-10-03 02:59:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:38,226 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 842 transitions. [2019-10-03 02:59:38,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:59:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 842 transitions. [2019-10-03 02:59:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:59:38,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:38,227 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1] [2019-10-03 02:59:38,227 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:38,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash -971799210, now seen corresponding path program 1 times [2019-10-03 02:59:38,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:38,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:38,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:38,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:38,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 02:59:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:38,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:38,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:38,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:38,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:38,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:38,260 INFO L87 Difference]: Start difference. First operand 545 states and 842 transitions. Second operand 3 states. [2019-10-03 02:59:38,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:38,289 INFO L93 Difference]: Finished difference Result 557 states and 836 transitions. [2019-10-03 02:59:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:38,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-03 02:59:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:38,292 INFO L225 Difference]: With dead ends: 557 [2019-10-03 02:59:38,293 INFO L226 Difference]: Without dead ends: 557 [2019-10-03 02:59:38,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-03 02:59:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 555. [2019-10-03 02:59:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-03 02:59:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 835 transitions. [2019-10-03 02:59:38,306 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 835 transitions. Word has length 44 [2019-10-03 02:59:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:38,306 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 835 transitions. [2019-10-03 02:59:38,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 835 transitions. [2019-10-03 02:59:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:59:38,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:38,307 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2019-10-03 02:59:38,307 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash -838324451, now seen corresponding path program 1 times [2019-10-03 02:59:38,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:38,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:38,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 02:59:38,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:38,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:38,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:38,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:38,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:38,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:38,351 INFO L87 Difference]: Start difference. First operand 555 states and 835 transitions. Second operand 3 states. [2019-10-03 02:59:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:38,379 INFO L93 Difference]: Finished difference Result 313 states and 455 transitions. [2019-10-03 02:59:38,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:38,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-03 02:59:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:38,382 INFO L225 Difference]: With dead ends: 313 [2019-10-03 02:59:38,382 INFO L226 Difference]: Without dead ends: 313 [2019-10-03 02:59:38,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-03 02:59:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2019-10-03 02:59:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-03 02:59:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2019-10-03 02:59:38,390 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 54 [2019-10-03 02:59:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:38,390 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2019-10-03 02:59:38,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2019-10-03 02:59:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 02:59:38,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:38,391 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2019-10-03 02:59:38,392 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:38,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1172050941, now seen corresponding path program 1 times [2019-10-03 02:59:38,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:38,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:38,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:59:38,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:38,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:38,450 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-10-03 02:59:38,450 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [445], [448], [451], [525], [531], [532], [533], [534] [2019-10-03 02:59:38,452 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:38,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:38,460 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:45,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:45,828 INFO L272 AbstractInterpreter]: Visited 41 different actions 268 times. Merged at 33 different actions 187 times. Widened at 2 different actions 6 times. Performed 1238 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 29 fixpoints after 10 different actions. Largest state had 46 variables. [2019-10-03 02:59:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:45,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:45,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:45,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:45,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:45,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:45,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 02:59:45,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:59:45,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:59:45,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:45,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-10-03 02:59:45,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:45,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:59:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:59:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:59:46,000 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand 5 states. [2019-10-03 02:59:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:46,135 INFO L93 Difference]: Finished difference Result 418 states and 601 transitions. [2019-10-03 02:59:46,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:59:46,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-03 02:59:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:46,140 INFO L225 Difference]: With dead ends: 418 [2019-10-03 02:59:46,141 INFO L226 Difference]: Without dead ends: 418 [2019-10-03 02:59:46,141 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:59:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-03 02:59:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 389. [2019-10-03 02:59:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-10-03 02:59:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 573 transitions. [2019-10-03 02:59:46,152 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 573 transitions. Word has length 55 [2019-10-03 02:59:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:46,152 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 573 transitions. [2019-10-03 02:59:46,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:59:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 573 transitions. [2019-10-03 02:59:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 02:59:46,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:46,153 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 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] [2019-10-03 02:59:46,154 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:46,154 INFO L82 PathProgramCache]: Analyzing trace with hash -913885503, now seen corresponding path program 1 times [2019-10-03 02:59:46,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:46,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:46,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:46,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:46,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:59:46,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:46,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:46,307 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-10-03 02:59:46,308 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [445], [448], [451], [525], [531], [532], [533], [534] [2019-10-03 02:59:46,310 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:46,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:46,321 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:59:55,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:59:55,875 INFO L272 AbstractInterpreter]: Visited 40 different actions 244 times. Merged at 29 different actions 174 times. Widened at 3 different actions 6 times. Performed 1127 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 28 fixpoints after 8 different actions. Largest state had 46 variables. [2019-10-03 02:59:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:55,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:59:55,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:55,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:59:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:55,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:59:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:55,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-03 02:59:55,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:59:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:59:55,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:59:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:59:56,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:59:56,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2019-10-03 02:59:56,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:59:56,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:59:56,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:59:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:56,029 INFO L87 Difference]: Start difference. First operand 389 states and 573 transitions. Second operand 5 states. [2019-10-03 02:59:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:56,140 INFO L93 Difference]: Finished difference Result 434 states and 634 transitions. [2019-10-03 02:59:56,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:59:56,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-03 02:59:56,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:56,143 INFO L225 Difference]: With dead ends: 434 [2019-10-03 02:59:56,143 INFO L226 Difference]: Without dead ends: 430 [2019-10-03 02:59:56,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-03 02:59:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-10-03 02:59:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-03 02:59:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 627 transitions. [2019-10-03 02:59:56,163 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 627 transitions. Word has length 55 [2019-10-03 02:59:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:56,164 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 627 transitions. [2019-10-03 02:59:56,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:59:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 627 transitions. [2019-10-03 02:59:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:59:56,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:56,165 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1] [2019-10-03 02:59:56,165 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1026084125, now seen corresponding path program 1 times [2019-10-03 02:59:56,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:56,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:56,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:56,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:56,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:56,334 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2019-10-03 02:59:56,336 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [511], [525], [531], [532], [533], [534] [2019-10-03 02:59:56,343 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:56,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:56,351 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:00:06,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:00:06,659 INFO L272 AbstractInterpreter]: Visited 44 different actions 225 times. Merged at 33 different actions 154 times. Widened at 2 different actions 5 times. Performed 1056 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 24 fixpoints after 7 different actions. Largest state had 50 variables. [2019-10-03 03:00:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:06,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:00:06,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:06,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:00:06,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:06,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:00:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:06,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 03:00:06,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:00:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:06,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:00:06,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:06,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:00:06,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2019-10-03 03:00:06,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:00:06,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:00:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:00:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:00:06,913 INFO L87 Difference]: Start difference. First operand 427 states and 627 transitions. Second operand 9 states. [2019-10-03 03:00:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:07,024 INFO L93 Difference]: Finished difference Result 427 states and 626 transitions. [2019-10-03 03:00:07,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 03:00:07,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-03 03:00:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:07,027 INFO L225 Difference]: With dead ends: 427 [2019-10-03 03:00:07,027 INFO L226 Difference]: Without dead ends: 427 [2019-10-03 03:00:07,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-03 03:00:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-03 03:00:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-10-03 03:00:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-03 03:00:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 626 transitions. [2019-10-03 03:00:07,040 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 626 transitions. Word has length 59 [2019-10-03 03:00:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:07,040 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 626 transitions. [2019-10-03 03:00:07,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:00:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 626 transitions. [2019-10-03 03:00:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:00:07,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:07,042 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 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, 1, 1, 1, 1] [2019-10-03 03:00:07,042 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:07,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:07,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1844017654, now seen corresponding path program 1 times [2019-10-03 03:00:07,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:07,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:07,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:07,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:07,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:07,588 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2019-10-03 03:00:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:07,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:07,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:00:07,606 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2019-10-03 03:00:07,606 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [53], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:00:07,607 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:00:07,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:00:07,614 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:00:18,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:00:18,463 INFO L272 AbstractInterpreter]: Visited 45 different actions 270 times. Merged at 37 different actions 191 times. Widened at 4 different actions 7 times. Performed 1362 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 33 fixpoints after 14 different actions. Largest state had 50 variables. [2019-10-03 03:00:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:18,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:00:18,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:18,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:00:18,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:18,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:00:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:18,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-03 03:00:18,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:00:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:18,635 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:00:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:00:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:18,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:00:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:00:18,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:00:18,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 14 [2019-10-03 03:00:18,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:00:18,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:00:18,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:00:18,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:00:18,779 INFO L87 Difference]: Start difference. First operand 427 states and 626 transitions. Second operand 11 states. [2019-10-03 03:00:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:19,337 INFO L93 Difference]: Finished difference Result 451 states and 648 transitions. [2019-10-03 03:00:19,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:00:19,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-10-03 03:00:19,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:19,342 INFO L225 Difference]: With dead ends: 451 [2019-10-03 03:00:19,342 INFO L226 Difference]: Without dead ends: 451 [2019-10-03 03:00:19,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:00:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-03 03:00:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 428. [2019-10-03 03:00:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-03 03:00:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-10-03 03:00:19,355 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 66 [2019-10-03 03:00:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:19,355 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-10-03 03:00:19,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:00:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-10-03 03:00:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 03:00:19,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:19,356 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1] [2019-10-03 03:00:19,357 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:19,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:19,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1592840319, now seen corresponding path program 1 times [2019-10-03 03:00:19,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:19,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:19,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:19,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 03:00:19,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:19,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:00:19,441 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2019-10-03 03:00:19,441 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [259], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:00:19,444 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:00:19,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:00:19,453 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:00:36,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:00:36,382 INFO L272 AbstractInterpreter]: Visited 46 different actions 489 times. Merged at 38 different actions 371 times. Widened at 5 different actions 16 times. Performed 2233 root evaluator evaluations with a maximum evaluation depth of 17. Performed 2233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 56 fixpoints after 15 different actions. Largest state had 50 variables. [2019-10-03 03:00:36,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:36,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:00:36,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:36,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:00:36,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:36,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:00:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:36,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-03 03:00:36,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:00:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 03:00:36,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:00:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 03:00:36,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:00:36,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-10-03 03:00:36,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:00:36,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:00:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:00:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:00:36,534 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 6 states. [2019-10-03 03:00:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:36,727 INFO L93 Difference]: Finished difference Result 545 states and 783 transitions. [2019-10-03 03:00:36,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 03:00:36,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-10-03 03:00:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:36,732 INFO L225 Difference]: With dead ends: 545 [2019-10-03 03:00:36,732 INFO L226 Difference]: Without dead ends: 545 [2019-10-03 03:00:36,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:00:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-10-03 03:00:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 506. [2019-10-03 03:00:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-03 03:00:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 746 transitions. [2019-10-03 03:00:36,747 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 746 transitions. Word has length 76 [2019-10-03 03:00:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:36,748 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 746 transitions. [2019-10-03 03:00:36,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:00:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 746 transitions. [2019-10-03 03:00:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 03:00:36,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:36,749 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 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, 1, 1, 1, 1] [2019-10-03 03:00:36,750 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1985867329, now seen corresponding path program 1 times [2019-10-03 03:00:36,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:36,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:36,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:37,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:37,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:00:37,158 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2019-10-03 03:00:37,159 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [259], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:00:37,160 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:00:37,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:00:37,167 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:00:50,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:00:50,414 INFO L272 AbstractInterpreter]: Visited 45 different actions 312 times. Merged at 37 different actions 229 times. Widened at 5 different actions 8 times. Performed 1572 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1572 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 36 fixpoints after 13 different actions. Largest state had 50 variables. [2019-10-03 03:00:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:50,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:00:50,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:50,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:00:50,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:50,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:00:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:50,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-03 03:00:50,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:00:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:50,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:00:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-03 03:00:50,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:00:50,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 19 [2019-10-03 03:00:50,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:00:50,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:00:50,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:00:50,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:00:50,786 INFO L87 Difference]: Start difference. First operand 506 states and 746 transitions. Second operand 15 states. [2019-10-03 03:00:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:51,277 INFO L93 Difference]: Finished difference Result 554 states and 800 transitions. [2019-10-03 03:00:51,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:00:51,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2019-10-03 03:00:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:51,281 INFO L225 Difference]: With dead ends: 554 [2019-10-03 03:00:51,286 INFO L226 Difference]: Without dead ends: 552 [2019-10-03 03:00:51,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:00:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-03 03:00:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 525. [2019-10-03 03:00:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-10-03 03:00:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 772 transitions. [2019-10-03 03:00:51,305 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 772 transitions. Word has length 76 [2019-10-03 03:00:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:51,306 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 772 transitions. [2019-10-03 03:00:51,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:00:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 772 transitions. [2019-10-03 03:00:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-03 03:00:51,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:51,307 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 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, 1, 1, 1, 1] [2019-10-03 03:00:51,307 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:51,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash -444830537, now seen corresponding path program 1 times [2019-10-03 03:00:51,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:51,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:51,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:51,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:00:51,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:00:51,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:00:51,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2019-10-03 03:00:51,520 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [334], [337], [340], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:00:51,522 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:00:51,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:00:51,532 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:01:09,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:01:09,223 INFO L272 AbstractInterpreter]: Visited 47 different actions 356 times. Merged at 39 different actions 268 times. Widened at 4 different actions 8 times. Performed 1841 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1841 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 40 fixpoints after 9 different actions. Largest state had 50 variables. [2019-10-03 03:01:09,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:09,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:01:09,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:09,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:01:09,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:09,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:01:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:09,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-03 03:01:09,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:01:09,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:09,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:09,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:09,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:09,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:09,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:09,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-03 03:01:09,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:09,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 10 [2019-10-03 03:01:09,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:09,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:01:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:01:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:09,534 INFO L87 Difference]: Start difference. First operand 525 states and 772 transitions. Second operand 7 states. [2019-10-03 03:01:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:09,676 INFO L93 Difference]: Finished difference Result 550 states and 804 transitions. [2019-10-03 03:01:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 03:01:09,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-10-03 03:01:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:09,681 INFO L225 Difference]: With dead ends: 550 [2019-10-03 03:01:09,681 INFO L226 Difference]: Without dead ends: 548 [2019-10-03 03:01:09,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-03 03:01:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 544. [2019-10-03 03:01:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-03 03:01:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 798 transitions. [2019-10-03 03:01:09,694 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 798 transitions. Word has length 86 [2019-10-03 03:01:09,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:09,694 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 798 transitions. [2019-10-03 03:01:09,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:01:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 798 transitions. [2019-10-03 03:01:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 03:01:09,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:09,695 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 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, 1, 1, 1, 1] [2019-10-03 03:01:09,695 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash 804066429, now seen corresponding path program 1 times [2019-10-03 03:01:09,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:09,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:09,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:09,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:09,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 14 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:10,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:10,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:10,121 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-10-03 03:01:10,121 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [385], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:01:10,122 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:01:10,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:01:10,131 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:01:19,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:01:19,428 INFO L272 AbstractInterpreter]: Visited 45 different actions 238 times. Merged at 37 different actions 164 times. Widened at 3 different actions 5 times. Performed 1081 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1081 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 28 fixpoints after 12 different actions. Largest state had 50 variables. [2019-10-03 03:01:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:19,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:01:19,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:19,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:01:19,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:19,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:01:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:19,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-03 03:01:19,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 14 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:19,591 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:19,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:01:19,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:01:19,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:01:19,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:19,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:19,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 44 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:20,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2019-10-03 03:01:20,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:20,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:20,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:20,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-03 03:01:20,306 INFO L87 Difference]: Start difference. First operand 544 states and 798 transitions. Second operand 10 states. [2019-10-03 03:01:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:20,609 INFO L93 Difference]: Finished difference Result 545 states and 799 transitions. [2019-10-03 03:01:20,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:20,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-10-03 03:01:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:20,618 INFO L225 Difference]: With dead ends: 545 [2019-10-03 03:01:20,618 INFO L226 Difference]: Without dead ends: 545 [2019-10-03 03:01:20,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-03 03:01:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-10-03 03:01:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2019-10-03 03:01:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-03 03:01:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 799 transitions. [2019-10-03 03:01:20,629 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 799 transitions. Word has length 89 [2019-10-03 03:01:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:20,630 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 799 transitions. [2019-10-03 03:01:20,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 799 transitions. [2019-10-03 03:01:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 03:01:20,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:20,635 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1] [2019-10-03 03:01:20,635 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash -569092908, now seen corresponding path program 1 times [2019-10-03 03:01:20,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:20,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:20,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:01:20,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:20,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:20,749 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-10-03 03:01:20,750 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [445], [448], [451], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:01:20,751 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:01:20,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:01:20,757 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:01:30,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:01:30,666 INFO L272 AbstractInterpreter]: Visited 48 different actions 350 times. Merged at 37 different actions 248 times. Widened at 3 different actions 7 times. Performed 1420 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 42 fixpoints after 11 different actions. Largest state had 50 variables. [2019-10-03 03:01:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:30,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:01:30,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:30,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:01:30,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:30,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:01:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:30,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-03 03:01:30,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:01:30,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 118 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:01:30,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:30,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-10-03 03:01:30,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:30,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:01:30,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:01:30,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:01:30,871 INFO L87 Difference]: Start difference. First operand 545 states and 799 transitions. Second operand 7 states. [2019-10-03 03:01:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:31,079 INFO L93 Difference]: Finished difference Result 672 states and 964 transitions. [2019-10-03 03:01:31,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 03:01:31,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-10-03 03:01:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:31,083 INFO L225 Difference]: With dead ends: 672 [2019-10-03 03:01:31,083 INFO L226 Difference]: Without dead ends: 672 [2019-10-03 03:01:31,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:01:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-10-03 03:01:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 623. [2019-10-03 03:01:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 03:01:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 918 transitions. [2019-10-03 03:01:31,098 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 918 transitions. Word has length 101 [2019-10-03 03:01:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:31,099 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 918 transitions. [2019-10-03 03:01:31,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:01:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 918 transitions. [2019-10-03 03:01:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 03:01:31,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:31,100 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 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, 1, 1, 1, 1] [2019-10-03 03:01:31,100 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash -310927470, now seen corresponding path program 1 times [2019-10-03 03:01:31,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:31,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 16 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:01:31,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:31,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:31,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-10-03 03:01:31,363 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [445], [448], [451], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:01:31,367 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:01:31,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:01:31,379 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:01:39,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:01:39,298 INFO L272 AbstractInterpreter]: Visited 47 different actions 252 times. Merged at 39 different actions 175 times. Widened at 3 different actions 5 times. Performed 1102 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1102 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 30 fixpoints after 12 different actions. Largest state had 50 variables. [2019-10-03 03:01:39,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:39,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:01:39,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:39,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:01:39,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:39,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:01:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:39,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-03 03:01:39,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 16 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:01:39,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-03 03:01:39,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:39,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 4] total 10 [2019-10-03 03:01:39,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:39,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:01:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:01:39,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:39,524 INFO L87 Difference]: Start difference. First operand 623 states and 918 transitions. Second operand 8 states. [2019-10-03 03:01:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:39,730 INFO L93 Difference]: Finished difference Result 668 states and 979 transitions. [2019-10-03 03:01:39,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 03:01:39,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-03 03:01:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:39,734 INFO L225 Difference]: With dead ends: 668 [2019-10-03 03:01:39,734 INFO L226 Difference]: Without dead ends: 664 [2019-10-03 03:01:39,735 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-10-03 03:01:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2019-10-03 03:01:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-03 03:01:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 972 transitions. [2019-10-03 03:01:39,748 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 972 transitions. Word has length 101 [2019-10-03 03:01:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:39,749 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 972 transitions. [2019-10-03 03:01:39,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:01:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 972 transitions. [2019-10-03 03:01:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 03:01:39,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:39,750 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 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, 1, 1, 1, 1] [2019-10-03 03:01:39,751 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:39,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:39,751 INFO L82 PathProgramCache]: Analyzing trace with hash 869583668, now seen corresponding path program 1 times [2019-10-03 03:01:39,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:39,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:39,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:39,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:39,991 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-10-03 03:01:39,992 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [511], [513], [525], [531], [532], [533], [534] [2019-10-03 03:01:39,993 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:01:39,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:01:39,999 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:01:53,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:01:53,796 INFO L272 AbstractInterpreter]: Visited 45 different actions 299 times. Merged at 37 different actions 218 times. Widened at 4 different actions 7 times. Performed 1562 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 36 fixpoints after 14 different actions. Largest state had 50 variables. [2019-10-03 03:01:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:53,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:01:53,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:53,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:01:53,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:53,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:01:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:53,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-03 03:01:53,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:54,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:54,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 62 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:54,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:54,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-10-03 03:01:54,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:54,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-03 03:01:54,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-03 03:01:54,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:01:54,335 INFO L87 Difference]: Start difference. First operand 661 states and 972 transitions. Second operand 17 states. [2019-10-03 03:01:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:54,655 INFO L93 Difference]: Finished difference Result 661 states and 971 transitions. [2019-10-03 03:01:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:01:54,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 105 [2019-10-03 03:01:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:54,661 INFO L225 Difference]: With dead ends: 661 [2019-10-03 03:01:54,661 INFO L226 Difference]: Without dead ends: 661 [2019-10-03 03:01:54,662 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:01:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-10-03 03:01:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2019-10-03 03:01:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-03 03:01:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 971 transitions. [2019-10-03 03:01:54,675 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 971 transitions. Word has length 105 [2019-10-03 03:01:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:54,676 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 971 transitions. [2019-10-03 03:01:54,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-03 03:01:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 971 transitions. [2019-10-03 03:01:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 03:01:54,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:54,678 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 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, 1, 1, 1, 1] [2019-10-03 03:01:54,678 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash 190652569, now seen corresponding path program 2 times [2019-10-03 03:01:54,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:54,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:54,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 18 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:55,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:55,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:55,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:01:55,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:01:55,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:55,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:01:55,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 03:01:55,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 03:01:55,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-03 03:01:55,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 03:01:55,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-03 03:01:55,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:55,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:01:55,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 136 proven. 31 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-03 03:01:55,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:55,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:55,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:01:56,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:56,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:56,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:56,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:56,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:01:56,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 135 proven. 32 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:01:56,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:56,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 21 [2019-10-03 03:01:56,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:56,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-03 03:01:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-03 03:01:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:01:56,262 INFO L87 Difference]: Start difference. First operand 661 states and 971 transitions. Second operand 17 states. [2019-10-03 03:01:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:57,752 INFO L93 Difference]: Finished difference Result 605 states and 832 transitions. [2019-10-03 03:01:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-03 03:01:57,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2019-10-03 03:01:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:57,755 INFO L225 Difference]: With dead ends: 605 [2019-10-03 03:01:57,755 INFO L226 Difference]: Without dead ends: 597 [2019-10-03 03:01:57,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 224 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:01:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-03 03:01:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 528. [2019-10-03 03:01:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-03 03:01:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 743 transitions. [2019-10-03 03:01:57,767 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 743 transitions. Word has length 112 [2019-10-03 03:01:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:57,768 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 743 transitions. [2019-10-03 03:01:57,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-03 03:01:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 743 transitions. [2019-10-03 03:01:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 03:01:57,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:57,769 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 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, 1, 1, 1, 1, 1] [2019-10-03 03:01:57,769 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2048729936, now seen corresponding path program 2 times [2019-10-03 03:01:57,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:57,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:57,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 03:01:57,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:57,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 58 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 03:01:57,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:57,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:57,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:01:57,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:01:57,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:57,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:01:57,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 03:01:57,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 03:01:58,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-03 03:01:58,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 03:01:58,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-03 03:01:58,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 58 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 03:01:58,209 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 58 proven. 206 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:01:58,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:58,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-10-03 03:01:58,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:58,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:01:58,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:01:58,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:01:58,295 INFO L87 Difference]: Start difference. First operand 528 states and 743 transitions. Second operand 8 states. [2019-10-03 03:01:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:58,408 INFO L93 Difference]: Finished difference Result 586 states and 811 transitions. [2019-10-03 03:01:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:01:58,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-03 03:01:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:58,412 INFO L225 Difference]: With dead ends: 586 [2019-10-03 03:01:58,413 INFO L226 Difference]: Without dead ends: 586 [2019-10-03 03:01:58,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:01:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-03 03:01:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 567. [2019-10-03 03:01:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-03 03:01:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 797 transitions. [2019-10-03 03:01:58,425 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 797 transitions. Word has length 122 [2019-10-03 03:01:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:58,426 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 797 transitions. [2019-10-03 03:01:58,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:01:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 797 transitions. [2019-10-03 03:01:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 03:01:58,427 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:58,428 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 03:01:58,428 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1989472887, now seen corresponding path program 1 times [2019-10-03 03:01:58,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:58,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 03:01:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:58,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 22 proven. 307 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-03 03:01:58,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:58,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:58,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-10-03 03:01:58,817 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [364], [367], [370], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:01:58,819 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:01:58,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:01:58,825 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:11,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:11,970 INFO L272 AbstractInterpreter]: Visited 47 different actions 292 times. Merged at 39 different actions 211 times. Widened at 4 different actions 7 times. Performed 1320 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 33 fixpoints after 14 different actions. Largest state had 50 variables. [2019-10-03 03:02:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:11,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:11,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:11,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:11,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:11,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:12,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 03:02:12,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 03:02:12,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:12,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:12,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 266 proven. 64 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 03:02:12,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 03:02:12,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 21 [2019-10-03 03:02:12,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:12,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:02:12,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:02:12,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:02:12,461 INFO L87 Difference]: Start difference. First operand 567 states and 797 transitions. Second operand 8 states. [2019-10-03 03:02:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:12,579 INFO L93 Difference]: Finished difference Result 706 states and 991 transitions. [2019-10-03 03:02:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:02:12,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-10-03 03:02:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:12,583 INFO L225 Difference]: With dead ends: 706 [2019-10-03 03:02:12,583 INFO L226 Difference]: Without dead ends: 704 [2019-10-03 03:02:12,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:02:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-03 03:02:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 700. [2019-10-03 03:02:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-03 03:02:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 986 transitions. [2019-10-03 03:02:12,595 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 986 transitions. Word has length 134 [2019-10-03 03:02:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:12,596 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 986 transitions. [2019-10-03 03:02:12,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:02:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 986 transitions. [2019-10-03 03:02:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 03:02:12,597 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:12,598 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 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, 1, 1, 1, 1] [2019-10-03 03:02:12,598 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:12,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:12,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1555564814, now seen corresponding path program 2 times [2019-10-03 03:02:12,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:12,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 22 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:13,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:13,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:13,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:02:13,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:02:13,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:13,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:13,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 03:02:13,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 03:02:13,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-03 03:02:13,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 03:02:13,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 03:02:13,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:02:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 330 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 03:02:13,701 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:02:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:02:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:02:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:14,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:02:14,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:14,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:14,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:14,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:14,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:14,277 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 14 [2019-10-03 03:02:14,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 296 proven. 44 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:02:14,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:14,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 31 [2019-10-03 03:02:14,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:14,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-03 03:02:14,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-03 03:02:14,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=642, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:02:14,742 INFO L87 Difference]: Start difference. First operand 700 states and 986 transitions. Second operand 22 states. [2019-10-03 03:02:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:15,399 INFO L93 Difference]: Finished difference Result 709 states and 992 transitions. [2019-10-03 03:02:15,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:02:15,404 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 135 [2019-10-03 03:02:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:15,409 INFO L225 Difference]: With dead ends: 709 [2019-10-03 03:02:15,409 INFO L226 Difference]: Without dead ends: 709 [2019-10-03 03:02:15,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 03:02:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-10-03 03:02:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 700. [2019-10-03 03:02:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-03 03:02:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 985 transitions. [2019-10-03 03:02:15,422 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 985 transitions. Word has length 135 [2019-10-03 03:02:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:15,423 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 985 transitions. [2019-10-03 03:02:15,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-03 03:02:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 985 transitions. [2019-10-03 03:02:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 03:02:15,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:15,425 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:15,425 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1991947744, now seen corresponding path program 1 times [2019-10-03 03:02:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:15,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 03:02:15,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:15,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 79 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 03:02:15,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:15,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:15,634 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-10-03 03:02:15,634 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [19], [23], [26], [29], [34], [41], [44], [47], [50], [55], [137], [232], [235], [250], [253], [256], [261], [328], [331], [346], [361], [376], [379], [382], [387], [424], [427], [442], [457], [472], [487], [490], [493], [496], [502], [505], [508], [513], [525], [531], [532], [533], [534] [2019-10-03 03:02:15,636 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:15,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:15,647 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:27,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:27,305 INFO L272 AbstractInterpreter]: Visited 48 different actions 460 times. Merged at 40 different actions 343 times. Widened at 5 different actions 14 times. Performed 2068 root evaluator evaluations with a maximum evaluation depth of 17. Performed 2068 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 55 fixpoints after 18 different actions. Largest state had 50 variables. [2019-10-03 03:02:27,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:27,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:27,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:27,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:27,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:27,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:27,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 03:02:27,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 79 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 03:02:27,491 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 79 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 03:02:27,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:27,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-10-03 03:02:27,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:27,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:27,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-03 03:02:27,590 INFO L87 Difference]: Start difference. First operand 700 states and 985 transitions. Second operand 9 states. [2019-10-03 03:02:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:27,730 INFO L93 Difference]: Finished difference Result 801 states and 1113 transitions. [2019-10-03 03:02:27,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:27,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-10-03 03:02:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:27,736 INFO L225 Difference]: With dead ends: 801 [2019-10-03 03:02:27,736 INFO L226 Difference]: Without dead ends: 801 [2019-10-03 03:02:27,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-03 03:02:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-10-03 03:02:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 778. [2019-10-03 03:02:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-10-03 03:02:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1097 transitions. [2019-10-03 03:02:27,750 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1097 transitions. Word has length 150 [2019-10-03 03:02:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:27,751 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 1097 transitions. [2019-10-03 03:02:27,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1097 transitions. [2019-10-03 03:02:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-03 03:02:27,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:27,753 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 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, 1, 1, 1, 1] [2019-10-03 03:02:27,753 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash 611220933, now seen corresponding path program 2 times [2019-10-03 03:02:27,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 24 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:28,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:28,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:28,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:02:28,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:02:28,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:28,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:28,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 03:02:28,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 03:02:28,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-03 03:02:28,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 03:02:28,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-03 03:02:28,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:28,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:02:28,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 402 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 03:02:28,554 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:28,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:28,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 368 proven. 57 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:02:29,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:29,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2019-10-03 03:02:29,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:29,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 03:02:29,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 03:02:29,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2019-10-03 03:02:29,205 INFO L87 Difference]: Start difference. First operand 778 states and 1097 transitions. Second operand 23 states. [2019-10-03 03:02:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:29,932 INFO L93 Difference]: Finished difference Result 784 states and 1100 transitions. [2019-10-03 03:02:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 03:02:29,933 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 151 [2019-10-03 03:02:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:29,936 INFO L225 Difference]: With dead ends: 784 [2019-10-03 03:02:29,937 INFO L226 Difference]: Without dead ends: 784 [2019-10-03 03:02:29,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=451, Invalid=1189, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:02:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-10-03 03:02:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 778. [2019-10-03 03:02:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-10-03 03:02:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1095 transitions. [2019-10-03 03:02:29,963 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1095 transitions. Word has length 151 [2019-10-03 03:02:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:29,964 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 1095 transitions. [2019-10-03 03:02:29,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 03:02:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1095 transitions. [2019-10-03 03:02:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-03 03:02:29,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:29,966 INFO L411 BasicCegarLoop]: trace histogram [14, 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, 1, 1, 1, 1] [2019-10-03 03:02:29,966 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1954464991, now seen corresponding path program 3 times [2019-10-03 03:02:29,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:29,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 03:02:29,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:29,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 84 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-03 03:02:30,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:30,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:30,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:02:30,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:02:30,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:30,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:30,309 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 03:02:30,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 03:02:30,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 03:02:30,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 03:02:30,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 03:02:30,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 84 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-03 03:02:30,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 84 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:02:30,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:30,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-10-03 03:02:30,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:30,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:02:30,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:02:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:30,797 INFO L87 Difference]: Start difference. First operand 778 states and 1095 transitions. Second operand 10 states. [2019-10-03 03:02:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:30,954 INFO L93 Difference]: Finished difference Result 882 states and 1221 transitions. [2019-10-03 03:02:30,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:02:30,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 168 [2019-10-03 03:02:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:30,958 INFO L225 Difference]: With dead ends: 882 [2019-10-03 03:02:30,958 INFO L226 Difference]: Without dead ends: 882 [2019-10-03 03:02:30,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-10-03 03:02:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 856. [2019-10-03 03:02:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-03 03:02:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1202 transitions. [2019-10-03 03:02:30,982 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1202 transitions. Word has length 168 [2019-10-03 03:02:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:30,982 INFO L475 AbstractCegarLoop]: Abstraction has 856 states and 1202 transitions. [2019-10-03 03:02:30,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:02:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1202 transitions. [2019-10-03 03:02:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 03:02:30,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:30,985 INFO L411 BasicCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1] [2019-10-03 03:02:30,985 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:30,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1475443439, now seen corresponding path program 2 times [2019-10-03 03:02:30,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:30,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:30,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 03:02:30,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:30,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 109 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 03:02:31,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:31,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:31,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:02:31,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:02:31,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:31,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:31,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 03:02:31,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 03:02:31,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-03 03:02:31,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 03:02:31,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-03 03:02:31,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:02:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 292 proven. 4 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-10-03 03:02:31,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:02:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:31,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 03:02:31,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 292 proven. 4 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-10-03 03:02:31,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:31,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 18 [2019-10-03 03:02:31,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:31,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:02:31,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:02:31,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:31,672 INFO L87 Difference]: Start difference. First operand 856 states and 1202 transitions. Second operand 15 states. [2019-10-03 03:02:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:32,332 INFO L93 Difference]: Finished difference Result 530 states and 714 transitions. [2019-10-03 03:02:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 03:02:32,332 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 196 [2019-10-03 03:02:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:32,334 INFO L225 Difference]: With dead ends: 530 [2019-10-03 03:02:32,334 INFO L226 Difference]: Without dead ends: 530 [2019-10-03 03:02:32,335 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=407, Invalid=853, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 03:02:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-10-03 03:02:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 507. [2019-10-03 03:02:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-10-03 03:02:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 697 transitions. [2019-10-03 03:02:32,343 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 697 transitions. Word has length 196 [2019-10-03 03:02:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:32,343 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 697 transitions. [2019-10-03 03:02:32,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:02:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 697 transitions. [2019-10-03 03:02:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-03 03:02:32,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:32,347 INFO L411 BasicCegarLoop]: trace histogram [22, 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, 1, 1, 1, 1] [2019-10-03 03:02:32,347 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:32,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash -181350083, now seen corresponding path program 4 times [2019-10-03 03:02:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:32,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 03:02:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:32,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 136 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-03 03:02:32,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:32,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:32,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:02:32,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:02:32,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:32,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:32,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:32,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:32,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-03 03:02:32,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 136 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-03 03:02:32,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 136 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-03 03:02:33,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:33,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19 [2019-10-03 03:02:33,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:33,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 03:02:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 03:02:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:33,371 INFO L87 Difference]: Start difference. First operand 507 states and 697 transitions. Second operand 14 states. [2019-10-03 03:02:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:33,562 INFO L93 Difference]: Finished difference Result 628 states and 860 transitions. [2019-10-03 03:02:33,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 03:02:33,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 260 [2019-10-03 03:02:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:33,565 INFO L225 Difference]: With dead ends: 628 [2019-10-03 03:02:33,566 INFO L226 Difference]: Without dead ends: 628 [2019-10-03 03:02:33,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 513 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-03 03:02:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 585. [2019-10-03 03:02:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-03 03:02:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 804 transitions. [2019-10-03 03:02:33,578 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 804 transitions. Word has length 260 [2019-10-03 03:02:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:33,578 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 804 transitions. [2019-10-03 03:02:33,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 03:02:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 804 transitions. [2019-10-03 03:02:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-03 03:02:33,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:33,584 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 19, 19, 12, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:33,584 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash -733930484, now seen corresponding path program 5 times [2019-10-03 03:02:33,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:33,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:33,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:33,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 162 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 03:02:33,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:33,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:33,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:02:33,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:02:33,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:33,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:34,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 03:02:34,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 03:02:34,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-10-03 03:02:34,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 03:02:34,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 1808 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-03 03:02:34,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 162 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 03:02:34,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2132 backedges. 162 proven. 1910 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 03:02:34,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:34,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 19 [2019-10-03 03:02:34,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:34,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 03:02:34,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 03:02:34,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:34,933 INFO L87 Difference]: Start difference. First operand 585 states and 804 transitions. Second operand 16 states. [2019-10-03 03:02:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:35,080 INFO L93 Difference]: Finished difference Result 706 states and 967 transitions. [2019-10-03 03:02:35,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 03:02:35,080 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 306 [2019-10-03 03:02:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:35,083 INFO L225 Difference]: With dead ends: 706 [2019-10-03 03:02:35,083 INFO L226 Difference]: Without dead ends: 706 [2019-10-03 03:02:35,084 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 601 SyntacticMatches, 21 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-10-03 03:02:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 663. [2019-10-03 03:02:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-03 03:02:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 911 transitions. [2019-10-03 03:02:35,093 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 911 transitions. Word has length 306 [2019-10-03 03:02:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:35,093 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 911 transitions. [2019-10-03 03:02:35,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 03:02:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 911 transitions. [2019-10-03 03:02:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-03 03:02:35,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:35,099 INFO L411 BasicCegarLoop]: trace histogram [30, 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, 1, 1, 1, 1] [2019-10-03 03:02:35,100 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 606393499, now seen corresponding path program 6 times [2019-10-03 03:02:35,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:35,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 03:02:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:35,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2864 backedges. 188 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 03:02:35,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:35,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:35,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 03:02:35,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 03:02:35,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:35,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:35,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 03:02:35,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 03:02:36,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 03:02:36,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 03:02:36,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-03 03:02:36,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2864 backedges. 188 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 03:02:36,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2864 backedges. 188 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 03:02:36,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:36,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 19 [2019-10-03 03:02:36,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:36,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:02:36,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:02:36,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:36,717 INFO L87 Difference]: Start difference. First operand 663 states and 911 transitions. Second operand 18 states. [2019-10-03 03:02:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:36,896 INFO L93 Difference]: Finished difference Result 784 states and 1074 transitions. [2019-10-03 03:02:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 03:02:36,896 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2019-10-03 03:02:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:36,901 INFO L225 Difference]: With dead ends: 784 [2019-10-03 03:02:36,901 INFO L226 Difference]: Without dead ends: 784 [2019-10-03 03:02:36,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 689 SyntacticMatches, 29 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-10-03 03:02:36,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 741. [2019-10-03 03:02:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-10-03 03:02:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1018 transitions. [2019-10-03 03:02:36,911 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1018 transitions. Word has length 352 [2019-10-03 03:02:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:36,912 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 1018 transitions. [2019-10-03 03:02:36,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:02:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1018 transitions. [2019-10-03 03:02:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-03 03:02:36,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:36,915 INFO L411 BasicCegarLoop]: trace histogram [34, 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, 1, 1, 1, 1] [2019-10-03 03:02:36,915 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:36,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1987974422, now seen corresponding path program 7 times [2019-10-03 03:02:36,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:36,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 03:02:36,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:36,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 03:02:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 03:02:39,215 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 03:02:39,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:02:39 BoogieIcfgContainer [2019-10-03 03:02:39,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:02:39,503 INFO L168 Benchmark]: Toolchain (without parser) took 197146.43 ms. Allocated memory was 133.7 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 88.9 MB in the beginning and 917.5 MB in the end (delta: -828.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-10-03 03:02:39,503 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 03:02:39,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.81 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 88.7 MB in the beginning and 172.4 MB in the end (delta: -83.8 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2019-10-03 03:02:39,506 INFO L168 Benchmark]: Boogie Preprocessor took 94.21 ms. Allocated memory is still 201.9 MB. Free memory was 172.4 MB in the beginning and 168.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:02:39,507 INFO L168 Benchmark]: RCFGBuilder took 963.85 ms. Allocated memory is still 201.9 MB. Free memory was 168.6 MB in the beginning and 117.9 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:02:39,515 INFO L168 Benchmark]: TraceAbstraction took 195429.36 ms. Allocated memory was 201.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 117.2 MB in the beginning and 917.5 MB in the end (delta: -800.2 MB). Peak memory consumption was 993.9 MB. Max. memory is 7.1 GB. [2019-10-03 03:02:39,523 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 653.81 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 88.7 MB in the beginning and 172.4 MB in the end (delta: -83.8 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.21 ms. Allocated memory is still 201.9 MB. Free memory was 172.4 MB in the beginning and 168.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 963.85 ms. Allocated memory is still 201.9 MB. Free memory was 168.6 MB in the beginning and 117.9 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195429.36 ms. Allocated memory was 201.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 117.2 MB in the beginning and 917.5 MB in the end (delta: -800.2 MB). Peak memory consumption was 993.9 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 [\old(m_msg_1_1)=5, \old(m_msg_1_2)=2, \old(m_msg_2)=3, \old(m_Protocol)=7, \old(m_recv_ack_1_1)=4, \old(m_recv_ack_1_2)=6, \old(m_recv_ack_2)=8, m_msg_1_1=4, m_msg_1_2=5, 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, q=0, this_buffer_empty=0, this_expect=0] [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, P1=-3, P2=-3, P3=0, P4=-3, P5=0, P6=0, P7=0, P8=-3, P9=-3, q=0, this_buffer_empty=0, this_expect=0] [L43] COND TRUE q == 0 [L44] COND TRUE __VERIFIER_nondet_int() [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, method_id=1, P1=-3, P2=-3, P3=0, P4=-3, P5=0, P6=0, P7=0, P8=-3, P9=-3, q=0, this_buffer_empty=0, this_expect=0] [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, method_id=1, P1=-3, P2=-3, P3=0, P4=-3, P5=0, P6=0, P7=0, P8=-3, P9=-3, q=1, this_buffer_empty=1, this_expect=0] [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, method_id=1, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=0] [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, method_id=1, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=0] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=0] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=1] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=1] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=1] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=1] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=1] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=1] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=1] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=1] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=2] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=2] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=2] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=2] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=2] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=2] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=2] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=2] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=2] [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, method_id=7, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=2] [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, method_id=7, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=2] [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, method_id=2, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=2] [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, method_id=2, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=4] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=-1, q=5, this_buffer_empty=0, this_expect=4] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=-1, q=1, this_buffer_empty=1, this_expect=4] [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, method_id=7, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=4] [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, method_id=7, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=4] [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, method_id=2, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=4] [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, method_id=2, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=5] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=5] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=5] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=5] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=5] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=5] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=5] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=5] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=5] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=5] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=5] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=5] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=5] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=6] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=6] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=6] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=6] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=6] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=6] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=6] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=6] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=1, this_buffer_empty=1, this_expect=6] [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, method_id=7, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=6] [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, method_id=7, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=6] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=6] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=7] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=7] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=7] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=7] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=7] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=7] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=7] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=7] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=7] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=7] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=7] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=7] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=7] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=8] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=8] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=8] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=8] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=8] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=8] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=8] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=8] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=1, this_buffer_empty=1, this_expect=8] [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, method_id=7, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=8] [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, method_id=7, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=8] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=8] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=9] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=9] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=9] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=9] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=9] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=9] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=9] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=9] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=9] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=9] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=9] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=9] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=9] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=10] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=10] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=10] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=10] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=10] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=10] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=10] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=10] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=1, this_buffer_empty=1, this_expect=10] [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, method_id=7, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=10] [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, method_id=7, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=10] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=10] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=11] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=11] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=11] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=11] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=11] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=11] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=11] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=11] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=11] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=11] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=11] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=11] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=11] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=1, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=12] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=12] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=12] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=12] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=12] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=12] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=12] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=12] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=1, this_buffer_empty=1, this_expect=12] [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, method_id=7, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=12] [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, method_id=7, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=12] [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, method_id=2, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=12] [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, method_id=2, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=13] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=13] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=13] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=13] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=13] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=13] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=13] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=13] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=13] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=13] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=13] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=13] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=13] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=14] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=14] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=14] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=14] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=14] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=14] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=14] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=14] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=1, this_buffer_empty=1, this_expect=14] [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, method_id=7, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=14] [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, method_id=7, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=14] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=14] [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, method_id=2, P1=-2, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=15] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=15] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=15] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=15] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=15] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=15] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=15] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=15] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=15] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=15] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=15] [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, method_id=3, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=15] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=4, this_buffer_empty=1, this_expect=15] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=-1, P7=-3, P8=-3, P9=0, q=5, this_buffer_empty=0, this_expect=16] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=16] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=16] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=16] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=16] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=16] [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, method_id=5, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=16] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=5, this_buffer_empty=0, this_expect=16] [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, method_id=7, P1=1, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=1, q=1, this_buffer_empty=1, this_expect=16] [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, method_id=7, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=16] [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, method_id=7, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=16] [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, method_id=2, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=1, this_buffer_empty=1, this_expect=16] [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, method_id=2, P1=0, P2=-3, P3=-3, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=17] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=-16] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=-16] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=-16] [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, method_id=2, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=-16] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=-16] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=-16] [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, method_id=3, P1=0, P2=-3, P3=0, P4=0, P5=0, P6=0, P7=-3, P8=-3, P9=0, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 115 locations, 1 error locations. UNSAFE Result, 195.3s OverallTime, 37 OverallIterations, 34 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7137 SDtfs, 11315 SDslu, 29888 SDs, 0 SdLazy, 5369 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6756 GetRequests, 6210 SyntacticMatches, 106 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 1972 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=856occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 159.3s AbstIntTime, 19 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 636 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 6964 NumberOfCodeBlocks, 6780 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 9639 ConstructedInterpolants, 383 QuantifiedInterpolants, 7429040 SizeOfPredicates, 79 NumberOfNonLiveVariables, 18311 ConjunctsInSsa, 465 ConjunctsInUnsatCore, 92 InterpolantComputations, 11 PerfectInterpolantSequences, 8454/33790 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...