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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:38:29,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:38:29,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:38:29,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:38:29,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:38:29,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:38:29,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:38:29,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:38:29,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:38:29,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:38:29,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:38:29,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:38:29,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:38:29,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:38:29,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:38:29,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:38:29,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:38:29,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:38:29,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:38:29,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:38:29,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:38:29,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:38:29,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:38:29,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:38:29,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:38:29,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:38:29,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:38:29,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:38:29,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:38:29,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:38:29,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:38:29,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:38:29,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:38:29,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:38:29,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:38:29,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:38:29,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:38:29,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:38:29,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:38:29,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:38:29,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:38:29,330 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-09-10 06:38:29,345 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:38:29,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:38:29,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:38:29,345 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:38:29,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:38:29,346 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:38:29,347 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:38:29,347 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:38:29,347 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:38:29,347 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:38:29,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:38:29,348 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:38:29,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:38:29,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:38:29,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:38:29,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:38:29,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:38:29,349 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:38:29,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:38:29,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:38:29,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:38:29,350 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:38:29,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:38:29,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:38:29,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:38:29,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:38:29,351 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:38:29,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:38:29,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:38:29,352 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:38:29,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:38:29,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:38:29,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:38:29,399 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:38:29,400 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:38:29,401 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:38:29,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25a953935/33e8a360e7064765bbda22089dadecc3/FLAG16d6cdf47 [2019-09-10 06:38:29,936 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:38:29,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:38:29,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25a953935/33e8a360e7064765bbda22089dadecc3/FLAG16d6cdf47 [2019-09-10 06:38:30,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25a953935/33e8a360e7064765bbda22089dadecc3 [2019-09-10 06:38:30,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:38:30,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:38:30,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:38:30,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:38:30,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:38:30,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:38:30" (1/1) ... [2019-09-10 06:38:30,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666deafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:30, skipping insertion in model container [2019-09-10 06:38:30,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:38:30" (1/1) ... [2019-09-10 06:38:30,304 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:38:30,373 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:38:30,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:38:30,912 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:38:31,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:38:31,032 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:38:31,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31 WrapperNode [2019-09-10 06:38:31,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:38:31,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:38:31,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:38:31,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:38:31,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (1/1) ... [2019-09-10 06:38:31,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (1/1) ... [2019-09-10 06:38:31,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (1/1) ... [2019-09-10 06:38:31,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (1/1) ... [2019-09-10 06:38:31,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (1/1) ... [2019-09-10 06:38:31,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (1/1) ... [2019-09-10 06:38:31,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (1/1) ... [2019-09-10 06:38:31,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:38:31,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:38:31,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:38:31,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:38:31,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:38:31,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:38:31,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:38:31,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:38:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:38:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:38:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:38:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:38:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:38:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:38:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:38:31,148 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:38:31,148 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:38:31,148 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:38:31,148 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:38:31,148 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:38:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:38:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:38:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:38:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:38:31,704 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:38:31,705 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:38:31,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:38:31 BoogieIcfgContainer [2019-09-10 06:38:31,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:38:31,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:38:31,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:38:31,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:38:31,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:38:30" (1/3) ... [2019-09-10 06:38:31,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d62b391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:38:31, skipping insertion in model container [2019-09-10 06:38:31,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:38:31" (2/3) ... [2019-09-10 06:38:31,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d62b391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:38:31, skipping insertion in model container [2019-09-10 06:38:31,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:38:31" (3/3) ... [2019-09-10 06:38:31,720 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:38:31,731 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:38:31,754 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:38:31,772 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:38:31,793 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:38:31,793 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:38:31,793 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:38:31,793 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:38:31,794 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:38:31,794 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:38:31,794 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:38:31,794 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:38:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-09-10 06:38:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 06:38:31,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:31,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:31,824 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1555775493, now seen corresponding path program 1 times [2019-09-10 06:38:31,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:31,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:31,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:31,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:31,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:32,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:32,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:32,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:32,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:32,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:32,231 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-09-10 06:38:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:32,296 INFO L93 Difference]: Finished difference Result 134 states and 207 transitions. [2019-09-10 06:38:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:32,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-10 06:38:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:32,312 INFO L225 Difference]: With dead ends: 134 [2019-09-10 06:38:32,312 INFO L226 Difference]: Without dead ends: 126 [2019-09-10 06:38:32,314 INFO L628 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-09-10 06:38:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-10 06:38:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-09-10 06:38:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-10 06:38:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2019-09-10 06:38:32,367 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 41 [2019-09-10 06:38:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:32,367 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2019-09-10 06:38:32,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2019-09-10 06:38:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 06:38:32,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:32,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:32,370 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash 477079428, now seen corresponding path program 1 times [2019-09-10 06:38:32,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:32,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:32,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:32,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:32,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:32,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:32,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:32,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:32,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:32,530 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand 3 states. [2019-09-10 06:38:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:32,560 INFO L93 Difference]: Finished difference Result 192 states and 286 transitions. [2019-09-10 06:38:32,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:32,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-10 06:38:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:32,564 INFO L225 Difference]: With dead ends: 192 [2019-09-10 06:38:32,565 INFO L226 Difference]: Without dead ends: 192 [2019-09-10 06:38:32,566 INFO L628 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-09-10 06:38:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-10 06:38:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-09-10 06:38:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 06:38:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 285 transitions. [2019-09-10 06:38:32,589 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 285 transitions. Word has length 42 [2019-09-10 06:38:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:32,590 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 285 transitions. [2019-09-10 06:38:32,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 285 transitions. [2019-09-10 06:38:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 06:38:32,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:32,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:32,593 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1738555772, now seen corresponding path program 1 times [2019-09-10 06:38:32,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:32,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:32,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:32,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:32,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:32,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:32,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:32,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:32,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:32,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:32,759 INFO L87 Difference]: Start difference. First operand 190 states and 285 transitions. Second operand 5 states. [2019-09-10 06:38:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:32,923 INFO L93 Difference]: Finished difference Result 688 states and 1060 transitions. [2019-09-10 06:38:32,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:32,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-10 06:38:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:32,937 INFO L225 Difference]: With dead ends: 688 [2019-09-10 06:38:32,937 INFO L226 Difference]: Without dead ends: 688 [2019-09-10 06:38:32,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:38:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-09-10 06:38:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 354. [2019-09-10 06:38:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-10 06:38:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 537 transitions. [2019-09-10 06:38:32,990 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 537 transitions. Word has length 43 [2019-09-10 06:38:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:32,993 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 537 transitions. [2019-09-10 06:38:32,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 537 transitions. [2019-09-10 06:38:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 06:38:32,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:32,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:32,997 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1920813121, now seen corresponding path program 1 times [2019-09-10 06:38:32,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:33,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:33,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:33,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:33,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:33,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:33,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:33,179 INFO L87 Difference]: Start difference. First operand 354 states and 537 transitions. Second operand 5 states. [2019-09-10 06:38:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:33,273 INFO L93 Difference]: Finished difference Result 902 states and 1371 transitions. [2019-09-10 06:38:33,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:33,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-10 06:38:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:33,281 INFO L225 Difference]: With dead ends: 902 [2019-09-10 06:38:33,281 INFO L226 Difference]: Without dead ends: 902 [2019-09-10 06:38:33,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-09-10 06:38:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 898. [2019-09-10 06:38:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-09-10 06:38:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1369 transitions. [2019-09-10 06:38:33,329 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1369 transitions. Word has length 44 [2019-09-10 06:38:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:33,330 INFO L475 AbstractCegarLoop]: Abstraction has 898 states and 1369 transitions. [2019-09-10 06:38:33,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1369 transitions. [2019-09-10 06:38:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 06:38:33,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:33,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:33,342 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1112409250, now seen corresponding path program 1 times [2019-09-10 06:38:33,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:33,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:33,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:33,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:33,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:33,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:33,406 INFO L87 Difference]: Start difference. First operand 898 states and 1369 transitions. Second operand 3 states. [2019-09-10 06:38:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:33,431 INFO L93 Difference]: Finished difference Result 1460 states and 2186 transitions. [2019-09-10 06:38:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:33,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-10 06:38:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:33,442 INFO L225 Difference]: With dead ends: 1460 [2019-09-10 06:38:33,442 INFO L226 Difference]: Without dead ends: 1460 [2019-09-10 06:38:33,443 INFO L628 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-09-10 06:38:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-09-10 06:38:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1458. [2019-09-10 06:38:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-09-10 06:38:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2185 transitions. [2019-09-10 06:38:33,487 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2185 transitions. Word has length 46 [2019-09-10 06:38:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:33,488 INFO L475 AbstractCegarLoop]: Abstraction has 1458 states and 2185 transitions. [2019-09-10 06:38:33,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2185 transitions. [2019-09-10 06:38:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 06:38:33,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:33,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:33,492 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:33,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1926406488, now seen corresponding path program 1 times [2019-09-10 06:38:33,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:33,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:33,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:33,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:33,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:33,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:33,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:38:33,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:33,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:38:33,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:38:33,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:38:33,639 INFO L87 Difference]: Start difference. First operand 1458 states and 2185 transitions. Second operand 6 states. [2019-09-10 06:38:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:33,884 INFO L93 Difference]: Finished difference Result 4214 states and 6283 transitions. [2019-09-10 06:38:33,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:33,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-10 06:38:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:33,905 INFO L225 Difference]: With dead ends: 4214 [2019-09-10 06:38:33,905 INFO L226 Difference]: Without dead ends: 4214 [2019-09-10 06:38:33,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:38:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2019-09-10 06:38:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 4210. [2019-09-10 06:38:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2019-09-10 06:38:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6281 transitions. [2019-09-10 06:38:34,014 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6281 transitions. Word has length 46 [2019-09-10 06:38:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:34,014 INFO L475 AbstractCegarLoop]: Abstraction has 4210 states and 6281 transitions. [2019-09-10 06:38:34,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:38:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6281 transitions. [2019-09-10 06:38:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 06:38:34,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:34,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:34,016 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:34,017 INFO L82 PathProgramCache]: Analyzing trace with hash -742396141, now seen corresponding path program 1 times [2019-09-10 06:38:34,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:34,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:34,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:34,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:34,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:34,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:34,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:34,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:34,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:34,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:34,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:34,100 INFO L87 Difference]: Start difference. First operand 4210 states and 6281 transitions. Second operand 5 states. [2019-09-10 06:38:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:34,198 INFO L93 Difference]: Finished difference Result 8682 states and 12681 transitions. [2019-09-10 06:38:34,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:38:34,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-10 06:38:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:34,242 INFO L225 Difference]: With dead ends: 8682 [2019-09-10 06:38:34,242 INFO L226 Difference]: Without dead ends: 8682 [2019-09-10 06:38:34,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:38:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2019-09-10 06:38:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 4498. [2019-09-10 06:38:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4498 states. [2019-09-10 06:38:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 6569 transitions. [2019-09-10 06:38:34,418 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 6569 transitions. Word has length 46 [2019-09-10 06:38:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:34,418 INFO L475 AbstractCegarLoop]: Abstraction has 4498 states and 6569 transitions. [2019-09-10 06:38:34,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 6569 transitions. [2019-09-10 06:38:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-10 06:38:34,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:34,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:38:34,421 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:34,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1529824191, now seen corresponding path program 1 times [2019-09-10 06:38:34,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:34,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:34,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:34,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:34,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:34,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:34,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:34,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:34,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:34,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:34,516 INFO L87 Difference]: Start difference. First operand 4498 states and 6569 transitions. Second operand 3 states. [2019-09-10 06:38:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:34,610 INFO L93 Difference]: Finished difference Result 6340 states and 9118 transitions. [2019-09-10 06:38:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:34,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-10 06:38:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:34,686 INFO L225 Difference]: With dead ends: 6340 [2019-09-10 06:38:34,686 INFO L226 Difference]: Without dead ends: 6340 [2019-09-10 06:38:34,687 INFO L628 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-09-10 06:38:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2019-09-10 06:38:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 6278. [2019-09-10 06:38:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6278 states. [2019-09-10 06:38:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 9057 transitions. [2019-09-10 06:38:34,885 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 9057 transitions. Word has length 47 [2019-09-10 06:38:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:34,887 INFO L475 AbstractCegarLoop]: Abstraction has 6278 states and 9057 transitions. [2019-09-10 06:38:34,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 9057 transitions. [2019-09-10 06:38:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:38:34,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:34,892 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:34,893 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1418257868, now seen corresponding path program 1 times [2019-09-10 06:38:34,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:34,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:34,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:35,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:35,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:35,021 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2019-09-10 06:38:35,023 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [77], [80], [83], [86], [91], [93], [96], [107], [109], [112], [115], [117], [120], [121], [123], [132], [143], [145], [158], [166], [185], [187], [190], [198], [201], [204], [207], [209], [211], [253], [266], [274], [295], [296], [300], [301], [302] [2019-09-10 06:38:35,075 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:35,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:35,234 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:35,427 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:38:35,430 INFO L272 AbstractInterpreter]: Visited 52 different actions 90 times. Merged at 25 different actions 32 times. Never widened. Performed 377 root evaluator evaluations with a maximum evaluation depth of 5. Performed 377 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 94 variables. [2019-09-10 06:38:35,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:35,435 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:38:35,651 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 83.19% of their original sizes. [2019-09-10 06:38:35,651 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:38:37,083 INFO L420 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2019-09-10 06:38:37,083 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:38:37,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:38:37,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [7] total 41 [2019-09-10 06:38:37,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:37,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 06:38:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 06:38:37,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:38:37,086 INFO L87 Difference]: Start difference. First operand 6278 states and 9057 transitions. Second operand 36 states. [2019-09-10 06:38:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:58,615 INFO L93 Difference]: Finished difference Result 19986 states and 27924 transitions. [2019-09-10 06:38:58,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2019-09-10 06:38:58,615 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2019-09-10 06:38:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:58,665 INFO L225 Difference]: With dead ends: 19986 [2019-09-10 06:38:58,665 INFO L226 Difference]: Without dead ends: 19986 [2019-09-10 06:38:58,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21986 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6908, Invalid=43942, Unknown=0, NotChecked=0, Total=50850 [2019-09-10 06:38:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19986 states. [2019-09-10 06:38:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19986 to 9849. [2019-09-10 06:38:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2019-09-10 06:38:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 13963 transitions. [2019-09-10 06:38:58,978 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 13963 transitions. Word has length 65 [2019-09-10 06:38:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:58,979 INFO L475 AbstractCegarLoop]: Abstraction has 9849 states and 13963 transitions. [2019-09-10 06:38:58,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 06:38:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 13963 transitions. [2019-09-10 06:38:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:38:58,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:58,984 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:58,987 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:58,988 INFO L82 PathProgramCache]: Analyzing trace with hash 929561592, now seen corresponding path program 1 times [2019-09-10 06:38:58,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:58,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:58,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:59,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:59,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:38:59,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:59,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:38:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:38:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:38:59,054 INFO L87 Difference]: Start difference. First operand 9849 states and 13963 transitions. Second operand 3 states. [2019-09-10 06:38:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:59,106 INFO L93 Difference]: Finished difference Result 12267 states and 17017 transitions. [2019-09-10 06:38:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:38:59,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 06:38:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:59,133 INFO L225 Difference]: With dead ends: 12267 [2019-09-10 06:38:59,133 INFO L226 Difference]: Without dead ends: 12267 [2019-09-10 06:38:59,134 INFO L628 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-09-10 06:38:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12267 states. [2019-09-10 06:38:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12267 to 11384. [2019-09-10 06:38:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2019-09-10 06:38:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 15890 transitions. [2019-09-10 06:38:59,340 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 15890 transitions. Word has length 65 [2019-09-10 06:38:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:59,340 INFO L475 AbstractCegarLoop]: Abstraction has 11384 states and 15890 transitions. [2019-09-10 06:38:59,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 15890 transitions. [2019-09-10 06:38:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:38:59,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:59,344 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:59,344 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:59,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash 442725761, now seen corresponding path program 1 times [2019-09-10 06:38:59,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:59,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:59,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:59,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:59,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:59,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:59,431 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2019-09-10 06:38:59,431 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [77], [80], [91], [93], [96], [99], [102], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [145], [148], [151], [154], [156], [158], [196], [198], [211], [219], [238], [253], [266], [274], [295], [296], [300], [301], [302] [2019-09-10 06:38:59,437 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:59,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:59,454 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:59,504 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:38:59,504 INFO L272 AbstractInterpreter]: Visited 52 different actions 108 times. Merged at 25 different actions 48 times. Never widened. Performed 409 root evaluator evaluations with a maximum evaluation depth of 5. Performed 409 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 94 variables. [2019-09-10 06:38:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:59,505 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:38:59,581 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 83.41% of their original sizes. [2019-09-10 06:38:59,581 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:39:00,993 INFO L420 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2019-09-10 06:39:00,993 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:39:00,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:39:00,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [7] total 41 [2019-09-10 06:39:00,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:00,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 06:39:00,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 06:39:00,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1093, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:39:00,995 INFO L87 Difference]: Start difference. First operand 11384 states and 15890 transitions. Second operand 36 states. [2019-09-10 06:39:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:16,958 INFO L93 Difference]: Finished difference Result 27125 states and 37181 transitions. [2019-09-10 06:39:16,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-10 06:39:16,958 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2019-09-10 06:39:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:17,022 INFO L225 Difference]: With dead ends: 27125 [2019-09-10 06:39:17,022 INFO L226 Difference]: Without dead ends: 27125 [2019-09-10 06:39:17,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16581 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5358, Invalid=34044, Unknown=0, NotChecked=0, Total=39402 [2019-09-10 06:39:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27125 states. [2019-09-10 06:39:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27125 to 13606. [2019-09-10 06:39:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13606 states. [2019-09-10 06:39:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13606 states to 13606 states and 18843 transitions. [2019-09-10 06:39:17,329 INFO L78 Accepts]: Start accepts. Automaton has 13606 states and 18843 transitions. Word has length 65 [2019-09-10 06:39:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:17,329 INFO L475 AbstractCegarLoop]: Abstraction has 13606 states and 18843 transitions. [2019-09-10 06:39:17,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 06:39:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 13606 states and 18843 transitions. [2019-09-10 06:39:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:39:17,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:17,336 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:17,337 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1397076685, now seen corresponding path program 1 times [2019-09-10 06:39:17,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:17,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:17,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:17,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:17,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:17,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:17,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:39:17,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:17,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:39:17,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:39:17,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:17,392 INFO L87 Difference]: Start difference. First operand 13606 states and 18843 transitions. Second operand 3 states. [2019-09-10 06:39:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:17,456 INFO L93 Difference]: Finished difference Result 18671 states and 25421 transitions. [2019-09-10 06:39:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:39:17,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:39:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:17,489 INFO L225 Difference]: With dead ends: 18671 [2019-09-10 06:39:17,489 INFO L226 Difference]: Without dead ends: 18671 [2019-09-10 06:39:17,489 INFO L628 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-09-10 06:39:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18671 states. [2019-09-10 06:39:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18671 to 18203. [2019-09-10 06:39:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18203 states. [2019-09-10 06:39:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18203 states to 18203 states and 24855 transitions. [2019-09-10 06:39:17,826 INFO L78 Accepts]: Start accepts. Automaton has 18203 states and 24855 transitions. Word has length 66 [2019-09-10 06:39:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:17,827 INFO L475 AbstractCegarLoop]: Abstraction has 18203 states and 24855 transitions. [2019-09-10 06:39:17,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:39:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 18203 states and 24855 transitions. [2019-09-10 06:39:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:39:17,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:17,838 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:17,838 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2075170094, now seen corresponding path program 1 times [2019-09-10 06:39:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:17,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:17,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:17,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:17,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:18,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:18,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:18,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2019-09-10 06:39:18,187 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [75], [77], [80], [91], [93], [96], [107], [109], [112], [115], [117], [120], [121], [123], [125], [130], [143], [145], [158], [166], [185], [196], [198], [201], [204], [207], [209], [211], [249], [251], [253], [266], [274], [295], [296], [300], [301], [302] [2019-09-10 06:39:18,197 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:18,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:18,211 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:18,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:18,427 INFO L272 AbstractInterpreter]: Visited 60 different actions 309 times. Merged at 36 different actions 219 times. Widened at 13 different actions 28 times. Performed 997 root evaluator evaluations with a maximum evaluation depth of 5. Performed 997 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 12 different actions. Largest state had 94 variables. [2019-09-10 06:39:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:18,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:18,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:18,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:39:18,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:18,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:39:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:18,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:39:18,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:39:18,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:39:18,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:39:18,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 06:39:18,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:39:18,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:39:18,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:39:18,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:39:18,937 INFO L87 Difference]: Start difference. First operand 18203 states and 24855 transitions. Second operand 12 states. [2019-09-10 06:39:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:26,511 INFO L93 Difference]: Finished difference Result 116631 states and 154959 transitions. [2019-09-10 06:39:26,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 06:39:26,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-09-10 06:39:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:26,722 INFO L225 Difference]: With dead ends: 116631 [2019-09-10 06:39:26,722 INFO L226 Difference]: Without dead ends: 116631 [2019-09-10 06:39:26,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7257 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2585, Invalid=14971, Unknown=0, NotChecked=0, Total=17556 [2019-09-10 06:39:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116631 states. [2019-09-10 06:39:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116631 to 37999. [2019-09-10 06:39:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37999 states. [2019-09-10 06:39:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37999 states to 37999 states and 51240 transitions. [2019-09-10 06:39:28,872 INFO L78 Accepts]: Start accepts. Automaton has 37999 states and 51240 transitions. Word has length 66 [2019-09-10 06:39:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:28,872 INFO L475 AbstractCegarLoop]: Abstraction has 37999 states and 51240 transitions. [2019-09-10 06:39:28,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:39:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 37999 states and 51240 transitions. [2019-09-10 06:39:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:39:28,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:28,879 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:28,879 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2028493329, now seen corresponding path program 1 times [2019-09-10 06:39:28,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:28,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:39:28,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:28,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:28,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:28,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:28,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:28,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:28,947 INFO L87 Difference]: Start difference. First operand 37999 states and 51240 transitions. Second operand 5 states. [2019-09-10 06:39:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:29,137 INFO L93 Difference]: Finished difference Result 49859 states and 67421 transitions. [2019-09-10 06:39:29,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:29,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-10 06:39:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:29,208 INFO L225 Difference]: With dead ends: 49859 [2019-09-10 06:39:29,208 INFO L226 Difference]: Without dead ends: 49859 [2019-09-10 06:39:29,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:39:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49859 states. [2019-09-10 06:39:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49859 to 45187. [2019-09-10 06:39:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45187 states. [2019-09-10 06:39:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45187 states to 45187 states and 60900 transitions. [2019-09-10 06:39:29,828 INFO L78 Accepts]: Start accepts. Automaton has 45187 states and 60900 transitions. Word has length 67 [2019-09-10 06:39:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:29,828 INFO L475 AbstractCegarLoop]: Abstraction has 45187 states and 60900 transitions. [2019-09-10 06:39:29,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45187 states and 60900 transitions. [2019-09-10 06:39:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:39:29,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:29,837 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:39:29,837 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 464290294, now seen corresponding path program 1 times [2019-09-10 06:39:29,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:29,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:29,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:29,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:29,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:39:29,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:29,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:39:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:39:29,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:29,890 INFO L87 Difference]: Start difference. First operand 45187 states and 60900 transitions. Second operand 3 states. [2019-09-10 06:39:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:30,011 INFO L93 Difference]: Finished difference Result 42559 states and 56661 transitions. [2019-09-10 06:39:30,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:39:30,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:39:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:30,064 INFO L225 Difference]: With dead ends: 42559 [2019-09-10 06:39:30,065 INFO L226 Difference]: Without dead ends: 42559 [2019-09-10 06:39:30,065 INFO L628 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-09-10 06:39:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42559 states. [2019-09-10 06:39:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42559 to 42557. [2019-09-10 06:39:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42557 states. [2019-09-10 06:39:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42557 states to 42557 states and 56660 transitions. [2019-09-10 06:39:31,386 INFO L78 Accepts]: Start accepts. Automaton has 42557 states and 56660 transitions. Word has length 67 [2019-09-10 06:39:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:31,387 INFO L475 AbstractCegarLoop]: Abstraction has 42557 states and 56660 transitions. [2019-09-10 06:39:31,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:39:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 42557 states and 56660 transitions. [2019-09-10 06:39:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:39:31,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:31,392 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:39:31,393 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:31,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1527473086, now seen corresponding path program 1 times [2019-09-10 06:39:31,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:31,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:31,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:31,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:39:31,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:31,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:39:31,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:31,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:39:31,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:39:31,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:39:31,452 INFO L87 Difference]: Start difference. First operand 42557 states and 56660 transitions. Second operand 5 states. [2019-09-10 06:39:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:31,674 INFO L93 Difference]: Finished difference Result 60411 states and 79621 transitions. [2019-09-10 06:39:31,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:39:31,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 06:39:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:31,747 INFO L225 Difference]: With dead ends: 60411 [2019-09-10 06:39:31,747 INFO L226 Difference]: Without dead ends: 60411 [2019-09-10 06:39:31,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:39:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60411 states. [2019-09-10 06:39:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60411 to 42502. [2019-09-10 06:39:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42502 states. [2019-09-10 06:39:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42502 states to 42502 states and 56149 transitions. [2019-09-10 06:39:32,201 INFO L78 Accepts]: Start accepts. Automaton has 42502 states and 56149 transitions. Word has length 68 [2019-09-10 06:39:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:32,201 INFO L475 AbstractCegarLoop]: Abstraction has 42502 states and 56149 transitions. [2019-09-10 06:39:32,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:39:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 42502 states and 56149 transitions. [2019-09-10 06:39:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:39:32,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:32,207 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:39:32,207 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash -941431235, now seen corresponding path program 1 times [2019-09-10 06:39:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:32,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:32,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:32,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:32,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:32,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:32,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:32,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2019-09-10 06:39:32,289 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [75], [77], [80], [91], [93], [96], [107], [109], [112], [115], [117], [120], [121], [123], [132], [143], [145], [158], [166], [185], [196], [198], [211], [219], [238], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:39:32,293 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:32,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:32,302 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:32,347 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:39:32,347 INFO L272 AbstractInterpreter]: Visited 58 different actions 139 times. Merged at 31 different actions 66 times. Widened at 2 different actions 2 times. Performed 533 root evaluator evaluations with a maximum evaluation depth of 5. Performed 533 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 94 variables. [2019-09-10 06:39:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:32,348 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:39:32,416 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 82% of their original sizes. [2019-09-10 06:39:32,416 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:39:33,956 INFO L420 sIntCurrentIteration]: We unified 67 AI predicates to 67 [2019-09-10 06:39:33,956 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:39:33,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:39:33,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [7] total 43 [2019-09-10 06:39:33,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:33,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 06:39:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 06:39:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1235, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:39:33,958 INFO L87 Difference]: Start difference. First operand 42502 states and 56149 transitions. Second operand 38 states. [2019-09-10 06:40:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:03,493 INFO L93 Difference]: Finished difference Result 83953 states and 109451 transitions. [2019-09-10 06:40:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 315 states. [2019-09-10 06:40:03,493 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 68 [2019-09-10 06:40:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:03,563 INFO L225 Difference]: With dead ends: 83953 [2019-09-10 06:40:03,563 INFO L226 Difference]: Without dead ends: 83953 [2019-09-10 06:40:03,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47488 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=12948, Invalid=93654, Unknown=0, NotChecked=0, Total=106602 [2019-09-10 06:40:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83953 states. [2019-09-10 06:40:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83953 to 49218. [2019-09-10 06:40:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49218 states. [2019-09-10 06:40:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49218 states to 49218 states and 64387 transitions. [2019-09-10 06:40:04,082 INFO L78 Accepts]: Start accepts. Automaton has 49218 states and 64387 transitions. Word has length 68 [2019-09-10 06:40:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:04,082 INFO L475 AbstractCegarLoop]: Abstraction has 49218 states and 64387 transitions. [2019-09-10 06:40:04,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 06:40:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 49218 states and 64387 transitions. [2019-09-10 06:40:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:40:04,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:04,088 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:04,089 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1947444675, now seen corresponding path program 1 times [2019-09-10 06:40:04,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:04,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:04,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:04,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:04,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:04,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:04,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:04,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2019-09-10 06:40:04,166 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [77], [80], [83], [86], [91], [93], [96], [99], [102], [105], [107], [109], [112], [115], [117], [120], [121], [123], [132], [145], [148], [151], [154], [156], [158], [187], [190], [198], [201], [204], [207], [209], [211], [253], [266], [274], [295], [296], [300], [301], [302] [2019-09-10 06:40:04,173 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:04,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:04,182 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:04,208 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:40:04,210 INFO L272 AbstractInterpreter]: Visited 56 different actions 90 times. Merged at 26 different actions 29 times. Never widened. Performed 379 root evaluator evaluations with a maximum evaluation depth of 5. Performed 379 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 95 variables. [2019-09-10 06:40:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:04,210 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:40:04,315 INFO L227 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 82.42% of their original sizes. [2019-09-10 06:40:04,315 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:40:06,038 INFO L420 sIntCurrentIteration]: We unified 68 AI predicates to 68 [2019-09-10 06:40:06,038 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:40:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:40:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [7] total 45 [2019-09-10 06:40:06,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:06,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 06:40:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 06:40:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1354, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:40:06,040 INFO L87 Difference]: Start difference. First operand 49218 states and 64387 transitions. Second operand 40 states. [2019-09-10 06:40:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:25,683 INFO L93 Difference]: Finished difference Result 71398 states and 93655 transitions. [2019-09-10 06:40:25,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 06:40:25,684 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 69 [2019-09-10 06:40:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:25,791 INFO L225 Difference]: With dead ends: 71398 [2019-09-10 06:40:25,792 INFO L226 Difference]: Without dead ends: 71398 [2019-09-10 06:40:25,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7189 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2787, Invalid=16395, Unknown=0, NotChecked=0, Total=19182 [2019-09-10 06:40:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71398 states. [2019-09-10 06:40:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71398 to 41169. [2019-09-10 06:40:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41169 states. [2019-09-10 06:40:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41169 states to 41169 states and 53871 transitions. [2019-09-10 06:40:26,875 INFO L78 Accepts]: Start accepts. Automaton has 41169 states and 53871 transitions. Word has length 69 [2019-09-10 06:40:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:26,875 INFO L475 AbstractCegarLoop]: Abstraction has 41169 states and 53871 transitions. [2019-09-10 06:40:26,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 06:40:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 41169 states and 53871 transitions. [2019-09-10 06:40:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:40:26,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:26,880 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:40:26,880 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash 631708975, now seen corresponding path program 1 times [2019-09-10 06:40:26,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:26,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:26,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:26,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:26,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:40:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:40:26,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:26,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:40:26,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:40:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:40:26,965 INFO L87 Difference]: Start difference. First operand 41169 states and 53871 transitions. Second operand 5 states. [2019-09-10 06:40:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:27,154 INFO L93 Difference]: Finished difference Result 48684 states and 63975 transitions. [2019-09-10 06:40:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:40:27,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 06:40:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:27,223 INFO L225 Difference]: With dead ends: 48684 [2019-09-10 06:40:27,223 INFO L226 Difference]: Without dead ends: 48684 [2019-09-10 06:40:27,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:40:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48684 states. [2019-09-10 06:40:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48684 to 45635. [2019-09-10 06:40:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45635 states. [2019-09-10 06:40:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45635 states to 45635 states and 59813 transitions. [2019-09-10 06:40:27,660 INFO L78 Accepts]: Start accepts. Automaton has 45635 states and 59813 transitions. Word has length 70 [2019-09-10 06:40:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:27,660 INFO L475 AbstractCegarLoop]: Abstraction has 45635 states and 59813 transitions. [2019-09-10 06:40:27,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:40:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 45635 states and 59813 transitions. [2019-09-10 06:40:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:40:27,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:27,665 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:40:27,665 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash -168256361, now seen corresponding path program 1 times [2019-09-10 06:40:27,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:27,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:27,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:40:27,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:27,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:40:27,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:27,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:40:27,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:40:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:40:27,737 INFO L87 Difference]: Start difference. First operand 45635 states and 59813 transitions. Second operand 5 states. [2019-09-10 06:40:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:27,945 INFO L93 Difference]: Finished difference Result 56114 states and 73866 transitions. [2019-09-10 06:40:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:40:27,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:40:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:28,016 INFO L225 Difference]: With dead ends: 56114 [2019-09-10 06:40:28,016 INFO L226 Difference]: Without dead ends: 56114 [2019-09-10 06:40:28,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:40:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56114 states. [2019-09-10 06:40:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56114 to 53065. [2019-09-10 06:40:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53065 states. [2019-09-10 06:40:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53065 states to 53065 states and 69704 transitions. [2019-09-10 06:40:28,478 INFO L78 Accepts]: Start accepts. Automaton has 53065 states and 69704 transitions. Word has length 71 [2019-09-10 06:40:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:28,479 INFO L475 AbstractCegarLoop]: Abstraction has 53065 states and 69704 transitions. [2019-09-10 06:40:28,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:40:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 53065 states and 69704 transitions. [2019-09-10 06:40:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:40:28,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:28,484 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:40:28,484 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1094042354, now seen corresponding path program 1 times [2019-09-10 06:40:28,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:28,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:28,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:28,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:28,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:28,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:40:28,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:28,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:40:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:40:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:40:28,532 INFO L87 Difference]: Start difference. First operand 53065 states and 69704 transitions. Second operand 3 states. [2019-09-10 06:40:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:28,674 INFO L93 Difference]: Finished difference Result 56115 states and 72568 transitions. [2019-09-10 06:40:28,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:40:28,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:40:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:28,794 INFO L225 Difference]: With dead ends: 56115 [2019-09-10 06:40:28,795 INFO L226 Difference]: Without dead ends: 52384 [2019-09-10 06:40:28,796 INFO L628 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-09-10 06:40:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52384 states. [2019-09-10 06:40:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52384 to 51042. [2019-09-10 06:40:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51042 states. [2019-09-10 06:40:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51042 states to 51042 states and 66276 transitions. [2019-09-10 06:40:29,825 INFO L78 Accepts]: Start accepts. Automaton has 51042 states and 66276 transitions. Word has length 73 [2019-09-10 06:40:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:29,825 INFO L475 AbstractCegarLoop]: Abstraction has 51042 states and 66276 transitions. [2019-09-10 06:40:29,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:40:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 51042 states and 66276 transitions. [2019-09-10 06:40:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:40:29,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:29,831 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:40:29,831 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash -333489234, now seen corresponding path program 1 times [2019-09-10 06:40:29,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:29,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:29,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:29,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:29,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:29,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:29,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:29,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2019-09-10 06:40:29,915 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [75], [77], [80], [91], [93], [96], [99], [102], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [145], [148], [151], [154], [156], [158], [196], [198], [211], [219], [238], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:40:29,917 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:29,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:29,925 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:30,039 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:30,040 INFO L272 AbstractInterpreter]: Visited 64 different actions 341 times. Merged at 39 different actions 243 times. Widened at 13 different actions 32 times. Performed 1028 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1028 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 19 fixpoints after 10 different actions. Largest state had 95 variables. [2019-09-10 06:40:30,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:30,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:30,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:30,041 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) [2019-09-10 06:40:30,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:30,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:30,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 06:40:30,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:30,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:30,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:40:30,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 06:40:30,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:40:30,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:40:30,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:40:30,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:40:30,276 INFO L87 Difference]: Start difference. First operand 51042 states and 66276 transitions. Second operand 11 states. [2019-09-10 06:40:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:30,831 INFO L93 Difference]: Finished difference Result 86051 states and 110224 transitions. [2019-09-10 06:40:30,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:40:30,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-10 06:40:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:30,923 INFO L225 Difference]: With dead ends: 86051 [2019-09-10 06:40:30,923 INFO L226 Difference]: Without dead ends: 86051 [2019-09-10 06:40:30,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:40:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86051 states. [2019-09-10 06:40:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86051 to 55811. [2019-09-10 06:40:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55811 states. [2019-09-10 06:40:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55811 states to 55811 states and 72392 transitions. [2019-09-10 06:40:31,507 INFO L78 Accepts]: Start accepts. Automaton has 55811 states and 72392 transitions. Word has length 73 [2019-09-10 06:40:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:31,507 INFO L475 AbstractCegarLoop]: Abstraction has 55811 states and 72392 transitions. [2019-09-10 06:40:31,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:40:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 55811 states and 72392 transitions. [2019-09-10 06:40:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:40:31,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:31,511 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:40:31,511 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:31,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1874328360, now seen corresponding path program 1 times [2019-09-10 06:40:31,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:31,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:31,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:31,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:31,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:31,575 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 75 with the following transitions: [2019-09-10 06:40:31,575 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [75], [77], [80], [83], [86], [91], [93], [96], [99], [107], [109], [112], [115], [117], [120], [121], [123], [132], [141], [145], [158], [166], [185], [187], [190], [198], [201], [204], [207], [209], [211], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:40:31,577 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:31,577 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:31,585 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:31,635 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:40:31,635 INFO L272 AbstractInterpreter]: Visited 64 different actions 143 times. Merged at 37 different actions 70 times. Never widened. Performed 528 root evaluator evaluations with a maximum evaluation depth of 5. Performed 528 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 6 fixpoints after 4 different actions. Largest state had 95 variables. [2019-09-10 06:40:31,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:31,636 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:40:31,735 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 81.59% of their original sizes. [2019-09-10 06:40:31,736 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:40:33,802 INFO L420 sIntCurrentIteration]: We unified 73 AI predicates to 73 [2019-09-10 06:40:33,803 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:40:33,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:40:33,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [7] total 47 [2019-09-10 06:40:33,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:33,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 06:40:33,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 06:40:33,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:40:33,804 INFO L87 Difference]: Start difference. First operand 55811 states and 72392 transitions. Second operand 42 states. [2019-09-10 06:41:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:36,657 INFO L93 Difference]: Finished difference Result 120666 states and 154506 transitions. [2019-09-10 06:41:36,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 428 states. [2019-09-10 06:41:36,657 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 74 [2019-09-10 06:41:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:36,803 INFO L225 Difference]: With dead ends: 120666 [2019-09-10 06:41:36,803 INFO L226 Difference]: Without dead ends: 120657 [2019-09-10 06:41:36,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90554 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=19850, Invalid=177730, Unknown=0, NotChecked=0, Total=197580 [2019-09-10 06:41:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120657 states. [2019-09-10 06:41:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120657 to 67160. [2019-09-10 06:41:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67160 states. [2019-09-10 06:41:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67160 states to 67160 states and 86683 transitions. [2019-09-10 06:41:37,628 INFO L78 Accepts]: Start accepts. Automaton has 67160 states and 86683 transitions. Word has length 74 [2019-09-10 06:41:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:37,628 INFO L475 AbstractCegarLoop]: Abstraction has 67160 states and 86683 transitions. [2019-09-10 06:41:37,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 06:41:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 67160 states and 86683 transitions. [2019-09-10 06:41:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:41:37,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:37,633 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:41:37,633 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:37,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:37,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1264889280, now seen corresponding path program 1 times [2019-09-10 06:41:37,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:37,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:37,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:37,809 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2019-09-10 06:41:37,809 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [75], [77], [80], [91], [93], [96], [99], [102], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [145], [148], [151], [154], [156], [158], [196], [198], [201], [204], [207], [209], [211], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:41:37,811 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:37,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:37,819 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:37,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:37,972 INFO L272 AbstractInterpreter]: Visited 70 different actions 475 times. Merged at 46 different actions 363 times. Widened at 15 different actions 51 times. Performed 1381 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1381 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 96 variables. [2019-09-10 06:41:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:37,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:37,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:37,973 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-09-10 06:41:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:37,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:41:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:38,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:41:38,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:38,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:38,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:38,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:38,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:38,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 06:41:38,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:38,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:41:38,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:41:38,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:41:38,552 INFO L87 Difference]: Start difference. First operand 67160 states and 86683 transitions. Second operand 17 states. [2019-09-10 06:41:41,344 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-09-10 06:41:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:42,524 INFO L93 Difference]: Finished difference Result 227594 states and 292598 transitions. [2019-09-10 06:41:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 06:41:42,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2019-09-10 06:41:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:42,819 INFO L225 Difference]: With dead ends: 227594 [2019-09-10 06:41:42,819 INFO L226 Difference]: Without dead ends: 227594 [2019-09-10 06:41:42,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=874, Invalid=2432, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:41:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227594 states. [2019-09-10 06:41:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227594 to 114550. [2019-09-10 06:41:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114550 states. [2019-09-10 06:41:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114550 states to 114550 states and 148326 transitions. [2019-09-10 06:41:44,375 INFO L78 Accepts]: Start accepts. Automaton has 114550 states and 148326 transitions. Word has length 75 [2019-09-10 06:41:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:44,375 INFO L475 AbstractCegarLoop]: Abstraction has 114550 states and 148326 transitions. [2019-09-10 06:41:44,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:41:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 114550 states and 148326 transitions. [2019-09-10 06:41:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:41:44,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:44,380 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:41:44,380 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash -904511359, now seen corresponding path program 1 times [2019-09-10 06:41:44,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:44,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:44,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:44,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:44,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:44,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2019-09-10 06:41:44,557 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [75], [77], [80], [83], [86], [91], [93], [96], [99], [102], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [145], [148], [151], [154], [156], [158], [187], [190], [198], [201], [204], [207], [209], [211], [249], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:41:44,558 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:44,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:44,565 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:44,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:44,728 INFO L272 AbstractInterpreter]: Visited 70 different actions 518 times. Merged at 46 different actions 400 times. Widened at 16 different actions 65 times. Performed 1484 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1484 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 39 fixpoints after 18 different actions. Largest state had 96 variables. [2019-09-10 06:41:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:44,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:44,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:44,728 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-09-10 06:41:44,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:44,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:41:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:44,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:41:44,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:46,065 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:41:46,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:46,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2019-09-10 06:41:46,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:46,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:41:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:41:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:41:46,827 INFO L87 Difference]: Start difference. First operand 114550 states and 148326 transitions. Second operand 19 states. [2019-09-10 06:41:47,660 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 06:41:48,332 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:41:48,666 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:41:48,843 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:41:49,035 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:41:49,402 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:41:49,692 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:41:50,253 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:41:50,410 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:41:50,563 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:41:50,833 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:41:51,047 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:41:51,283 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:41:51,671 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:41:51,952 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:41:52,215 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:41:52,466 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:41:52,680 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:41:52,873 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:41:53,228 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:41:53,842 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 06:41:54,327 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 06:41:54,576 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 06:41:54,944 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 06:41:55,186 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 06:41:55,579 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:41:55,762 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 06:41:56,036 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:41:56,498 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:41:56,637 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:41:57,009 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 06:41:57,212 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:41:57,432 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:41:57,675 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:41:58,324 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 06:41:58,617 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 06:41:59,168 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 06:41:59,611 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 06:41:59,886 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 06:42:00,171 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 06:42:00,403 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:42:00,704 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:42:00,921 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:42:01,132 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:42:01,281 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:42:01,461 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:42:01,818 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 06:42:02,059 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 06:42:02,264 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 06:42:02,498 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:42:02,713 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:42:02,993 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 06:42:03,434 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 06:42:03,880 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 06:42:04,171 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 06:42:04,472 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-10 06:42:04,681 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 06:42:04,906 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 06:42:05,137 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:42:05,794 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 06:42:06,222 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 06:42:06,594 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:42:07,133 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:42:07,318 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:42:07,636 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 06:42:07,907 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 06:42:08,048 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:42:08,294 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 06:42:08,548 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:42:08,738 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:42:09,113 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 06:42:09,419 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 06:42:09,714 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:42:09,991 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:42:10,254 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:42:10,582 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 06:42:10,896 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:42:11,364 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 06:42:11,783 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:42:11,994 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:42:12,457 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:42:12,832 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:42:13,220 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 06:42:13,577 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 06:42:13,906 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:42:14,115 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:42:14,431 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 06:42:14,672 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:42:14,884 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:42:15,124 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 06:42:15,299 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:42:15,900 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 06:42:16,084 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:42:16,362 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 06:42:16,601 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 06:42:16,793 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:42:17,007 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:42:17,289 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:42:17,479 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 06:42:17,927 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 06:42:18,211 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:42:18,385 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:42:18,648 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 06:42:18,918 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:42:19,536 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:42:19,801 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-10 06:42:20,021 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:42:20,215 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:42:20,551 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 06:42:20,950 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 06:42:21,308 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:42:21,616 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 06:42:21,851 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:42:22,455 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:42:22,961 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 06:42:23,148 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:42:23,353 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:42:23,675 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:42:23,995 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:42:24,554 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 06:42:25,023 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 06:42:25,526 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 06:42:25,827 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-10 06:42:26,157 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 06:42:26,451 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 06:42:27,178 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 06:42:27,683 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:42:27,847 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:42:28,330 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:42:28,547 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:42:28,705 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:42:28,881 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:42:29,249 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 06:42:29,687 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 06:42:29,831 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:42:30,324 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 06:42:30,567 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:42:30,740 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:42:30,927 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:42:31,092 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:42:31,252 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:42:31,436 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 06:42:31,735 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 06:42:31,913 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:42:32,160 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-10 06:42:32,381 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 06:42:32,569 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:42:33,271 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:42:33,579 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:42:33,889 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:42:34,027 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:42:34,342 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:42:35,064 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:42:35,300 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:42:35,502 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:42:35,929 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:42:36,203 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 06:42:36,425 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:42:36,770 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 06:42:37,132 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:42:37,279 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:42:37,465 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 06:42:37,664 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:42:37,977 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:42:38,175 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:42:38,454 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:42:38,702 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 06:42:38,924 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:42:39,083 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 06:42:39,399 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:42:39,577 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:42:39,925 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 06:42:40,374 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 06:42:40,542 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 06:42:40,767 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:42:41,395 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:42:42,051 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:42:42,396 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:42:42,564 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:42:42,803 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 06:42:42,981 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 06:42:43,441 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 06:42:43,707 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 06:42:44,062 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:42:44,329 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:42:44,492 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 06:42:44,716 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:42:44,876 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:42:45,030 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:42:45,184 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:42:45,519 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 06:42:45,709 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:42:46,079 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 06:42:46,586 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:42:47,068 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 06:42:47,758 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:42:48,026 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 06:42:48,231 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 06:42:48,433 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 06:42:48,651 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 06:42:48,839 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 06:42:49,237 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 06:42:49,626 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 06:42:49,805 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:42:49,972 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 06:42:50,204 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 06:42:50,672 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 06:42:51,002 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-10 06:42:51,432 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 06:42:51,694 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:42:52,054 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:42:52,288 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:42:52,790 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-10 06:42:53,155 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 06:42:53,379 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:42:53,617 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:42:54,026 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:42:54,184 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:42:54,483 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:42:54,796 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 06:42:55,166 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:42:55,571 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:42:55,994 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-10 06:42:56,343 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 06:42:56,914 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 06:42:57,079 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 06:42:57,403 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 06:42:57,680 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:42:58,108 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 06:42:58,292 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 06:42:58,578 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 06:42:59,071 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 06:42:59,767 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 06:43:00,130 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 06:43:00,615 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 06:43:00,809 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 06:43:01,163 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 06:43:01,382 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 06:43:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:01,941 INFO L93 Difference]: Finished difference Result 572711 states and 729549 transitions. [2019-09-10 06:43:01,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 345 states. [2019-09-10 06:43:01,942 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-09-10 06:43:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:02,751 INFO L225 Difference]: With dead ends: 572711 [2019-09-10 06:43:02,751 INFO L226 Difference]: Without dead ends: 572711 [2019-09-10 06:43:02,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 119 SyntacticMatches, 15 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60768 ImplicationChecksByTransitivity, 62.8s TimeCoverageRelationStatistics Valid=16357, Invalid=120913, Unknown=0, NotChecked=0, Total=137270 [2019-09-10 06:43:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572711 states. [2019-09-10 06:43:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572711 to 221680. [2019-09-10 06:43:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221680 states. [2019-09-10 06:43:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221680 states to 221680 states and 287963 transitions. [2019-09-10 06:43:11,374 INFO L78 Accepts]: Start accepts. Automaton has 221680 states and 287963 transitions. Word has length 75 [2019-09-10 06:43:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:11,374 INFO L475 AbstractCegarLoop]: Abstraction has 221680 states and 287963 transitions. [2019-09-10 06:43:11,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:43:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 221680 states and 287963 transitions. [2019-09-10 06:43:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:43:11,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:11,379 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:43:11,379 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -206681859, now seen corresponding path program 1 times [2019-09-10 06:43:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:11,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:11,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:11,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:43:11,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:43:11,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:43:11,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:43:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:43:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:43:11,426 INFO L87 Difference]: Start difference. First operand 221680 states and 287963 transitions. Second operand 3 states. [2019-09-10 06:43:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:12,065 INFO L93 Difference]: Finished difference Result 201561 states and 258758 transitions. [2019-09-10 06:43:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:43:12,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:43:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:12,409 INFO L225 Difference]: With dead ends: 201561 [2019-09-10 06:43:12,410 INFO L226 Difference]: Without dead ends: 201561 [2019-09-10 06:43:12,410 INFO L628 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-09-10 06:43:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201561 states. [2019-09-10 06:43:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201561 to 201558. [2019-09-10 06:43:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201558 states. [2019-09-10 06:43:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201558 states to 201558 states and 258756 transitions. [2019-09-10 06:43:18,089 INFO L78 Accepts]: Start accepts. Automaton has 201558 states and 258756 transitions. Word has length 76 [2019-09-10 06:43:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:18,089 INFO L475 AbstractCegarLoop]: Abstraction has 201558 states and 258756 transitions. [2019-09-10 06:43:18,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:43:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 201558 states and 258756 transitions. [2019-09-10 06:43:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:43:18,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:18,093 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-10 06:43:18,094 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1270117650, now seen corresponding path program 1 times [2019-09-10 06:43:18,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:18,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:18,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:18,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:18,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:18,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:18,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:43:18,773 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2019-09-10 06:43:18,774 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [75], [77], [80], [83], [86], [89], [91], [93], [96], [99], [102], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [145], [148], [151], [154], [156], [158], [198], [201], [204], [207], [209], [211], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:43:18,775 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:43:18,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:43:18,781 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:43:18,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:43:18,937 INFO L272 AbstractInterpreter]: Visited 72 different actions 561 times. Merged at 48 different actions 443 times. Widened at 17 different actions 75 times. Performed 1645 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1645 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 44 fixpoints after 15 different actions. Largest state had 96 variables. [2019-09-10 06:43:18,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:18,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:43:18,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:18,938 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-09-10 06:43:18,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:18,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:43:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:19,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 06:43:19,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:43:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:19,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:43:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:20,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:43:20,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2019-09-10 06:43:20,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:43:20,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:43:20,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:43:20,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1359, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:43:20,195 INFO L87 Difference]: Start difference. First operand 201558 states and 258756 transitions. Second operand 28 states. [2019-09-10 06:43:22,575 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 06:43:24,210 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 06:43:24,390 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:43:24,612 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:43:25,419 WARN L188 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:43:25,605 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:43:26,572 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:43:26,822 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:43:27,054 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 06:43:27,298 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 06:43:27,482 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:43:27,633 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 06:43:27,901 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 06:43:28,190 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 06:43:28,387 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:43:28,686 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 06:43:28,908 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:43:29,105 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:43:29,357 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:43:29,533 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 06:43:29,743 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:43:30,087 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:43:30,649 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:43:30,902 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:43:31,073 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:43:31,209 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:43:31,547 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 06:43:31,720 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-09-10 06:43:31,939 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:43:32,102 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-10 06:43:32,403 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:43:32,624 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 06:43:32,804 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:43:33,140 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:43:33,321 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:43:33,562 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:43:34,159 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:43:34,360 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:43:34,669 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 06:43:34,896 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 06:43:35,097 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:43:35,367 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:43:35,661 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:43:35,854 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 06:43:36,062 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:43:36,303 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:43:36,478 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 06:43:36,651 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 06:43:36,832 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 06:43:37,321 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:43:37,925 WARN L188 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:43:38,167 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:43:38,387 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 06:43:38,574 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:43:38,781 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:43:38,963 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 06:43:39,278 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 06:43:39,486 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:43:39,726 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:43:39,980 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:43:40,162 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 06:43:40,468 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 06:43:40,682 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-10 06:43:40,904 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 06:43:41,169 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-10 06:43:41,706 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 06:43:41,910 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 06:43:42,464 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:43:42,748 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 06:43:43,105 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:43:43,354 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 06:43:43,656 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 06:43:44,059 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 06:43:44,427 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 06:43:44,636 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 06:43:45,076 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-09-10 06:43:45,283 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 06:43:45,550 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 06:43:46,116 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 06:43:46,514 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-09-10 06:43:46,832 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 06:43:47,084 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-10 06:43:47,393 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:43:47,640 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 06:43:47,868 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 06:43:48,041 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 06:43:48,300 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-09-10 06:43:48,670 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:43:48,907 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:43:49,228 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:43:49,508 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 06:43:49,770 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:43:50,539 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 06:43:50,798 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:43:51,072 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 06:43:51,328 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 06:43:51,486 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 06:43:51,979 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:43:52,180 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 06:43:52,442 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 06:43:52,751 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 06:43:53,046 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 06:43:53,677 WARN L188 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-09-10 06:43:53,930 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 06:43:54,228 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 06:43:54,426 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:43:54,769 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-09-10 06:43:55,061 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 06:43:55,394 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-09-10 06:43:56,029 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-09-10 06:43:56,213 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-10 06:43:56,430 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 06:43:56,713 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 06:43:57,081 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2019-09-10 06:43:57,409 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 06:43:57,817 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-09-10 06:43:58,012 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:43:58,276 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 06:43:58,556 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 06:43:59,041 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:43:59,313 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 06:43:59,636 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 06:43:59,812 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:44:00,180 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 06:44:00,496 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 06:44:00,676 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:44:01,016 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-10 06:44:01,271 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2019-09-10 06:44:01,628 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-09-10 06:44:01,863 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:44:02,032 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:44:02,303 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:44:02,484 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-09-10 06:44:03,241 WARN L188 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 06:44:03,459 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 06:44:04,086 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:44:04,344 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 06:44:04,799 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-09-10 06:44:05,212 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 06:44:05,382 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 06:44:05,616 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:44:05,885 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 06:44:06,194 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-09-10 06:44:06,574 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 06:44:06,793 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 06:44:07,019 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 06:44:07,241 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 06:44:08,639 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:44:09,391 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:44:09,577 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 06:44:11,845 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 06:44:12,319 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-10 06:44:12,978 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 06:44:13,364 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:44:13,836 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:44:14,483 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:44:14,837 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 06:44:15,584 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:44:15,778 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:44:15,960 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 06:44:16,122 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:44:16,434 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:44:16,935 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 06:44:17,800 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:44:17,982 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:44:18,172 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:44:18,811 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:44:20,762 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 06:44:21,244 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:44:21,721 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:44:21,893 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 06:44:23,141 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 06:44:23,363 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:44:23,546 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 06:44:23,835 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:44:24,488 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:44:24,716 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:44:25,741 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 06:44:25,999 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 06:44:26,172 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 06:44:26,332 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 06:44:26,935 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 06:44:27,435 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:44:27,690 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:44:27,934 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:44:28,134 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 06:44:28,511 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 06:44:28,848 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 06:44:29,183 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:44:29,481 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:44:30,020 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:44:30,186 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:44:30,669 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 06:44:30,821 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 06:44:31,254 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 06:44:31,431 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 06:44:31,591 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 06:44:31,740 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:44:32,459 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 06:44:32,695 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 06:44:32,852 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:44:33,113 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:44:33,412 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:44:33,672 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:44:33,940 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 06:44:34,150 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:44:34,344 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-09-10 06:44:34,536 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 06:44:34,781 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:44:35,000 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:44:35,414 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:44:35,645 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 06:44:35,884 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:44:36,126 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 06:44:36,361 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 06:44:36,559 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:44:36,916 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 06:44:37,184 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:44:37,508 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:44:37,678 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 06:44:38,046 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 06:44:38,196 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:44:38,630 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-09-10 06:44:38,829 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:44:39,033 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 06:44:39,226 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-09-10 06:44:39,401 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 06:44:39,629 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:44:39,848 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:44:40,085 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 06:44:40,428 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 06:44:40,768 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 06:44:41,078 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:44:41,303 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:44:41,521 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-10 06:44:41,864 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 06:44:42,902 WARN L188 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:44:43,170 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-10 06:44:43,514 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 06:44:43,757 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:44:44,195 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 06:44:44,940 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 06:44:45,235 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2019-09-10 06:44:45,703 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:44:46,057 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 06:44:46,255 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:44:46,491 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 06:44:46,707 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 06:44:47,288 WARN L188 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:44:47,540 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 06:44:47,776 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 06:44:48,030 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 06:44:48,399 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 06:44:48,751 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-09-10 06:44:49,291 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 06:44:49,630 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 06:44:49,801 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:44:50,070 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-09-10 06:44:50,355 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 06:44:50,532 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 06:44:50,767 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:44:51,095 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 06:44:51,515 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 06:44:52,092 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 06:44:53,911 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:44:54,182 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:44:54,424 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:44:55,248 WARN L188 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:44:57,438 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:44:57,599 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 06:44:58,213 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 06:45:01,304 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 06:45:01,737 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-09-10 06:45:02,142 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:45:04,246 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:45:04,559 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 06:45:04,758 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:45:05,077 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:45:06,999 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 06:45:07,674 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 06:45:07,850 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 06:45:08,097 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 06:45:08,636 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:45:08,856 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:45:09,551 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 06:45:09,799 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 06:45:10,083 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 06:45:10,311 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:45:10,494 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:45:11,159 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:45:12,020 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-09-10 06:45:12,660 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:45:13,005 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 06:45:13,207 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:45:13,412 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 06:45:14,095 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 06:45:14,690 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:45:14,938 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 06:45:15,153 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:45:15,394 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 06:45:16,395 WARN L188 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:45:16,575 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:45:17,061 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 06:45:17,316 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 06:45:17,483 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:45:18,316 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:45:18,548 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-10 06:45:18,973 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 06:45:19,141 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 06:45:19,912 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:45:20,132 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:45:20,333 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 06:45:21,897 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 06:45:22,216 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:45:23,619 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 06:45:23,885 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 06:45:24,069 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:45:24,262 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 06:45:24,614 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:45:24,846 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 06:45:25,126 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:45:25,296 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-10 06:45:25,537 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 06:45:25,709 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:45:26,436 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:45:26,586 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 06:45:26,746 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:45:27,310 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:45:27,864 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:45:28,681 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:45:28,897 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:45:30,083 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:45:30,450 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 06:45:30,868 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 06:45:31,088 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 06:45:31,428 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-09-10 06:45:31,620 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 06:45:31,849 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 06:45:32,060 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:45:32,297 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:45:32,480 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:45:32,672 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 06:45:32,870 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:45:33,031 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:45:33,239 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:45:33,439 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:45:33,691 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 06:45:33,983 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 06:45:34,210 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 06:45:34,409 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:45:34,817 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:45:35,513 WARN L188 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:45:35,719 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:45:35,955 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:45:36,514 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-09-10 06:45:36,761 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 06:45:36,942 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 06:45:37,579 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:45:37,738 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:45:37,970 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 06:45:38,136 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:45:38,607 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 06:45:38,986 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 06:45:39,190 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:45:39,376 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 06:45:39,593 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 06:45:39,790 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:45:39,992 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 06:45:40,172 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:45:40,387 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:45:40,605 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 06:45:40,930 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 06:45:41,188 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 06:45:41,562 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 06:45:41,956 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:45:42,199 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 06:45:42,357 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 06:45:42,601 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:45:42,967 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 06:45:43,245 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:45:43,512 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 06:45:43,865 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 06:45:44,103 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2019-09-10 06:45:44,467 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-09-10 06:45:44,689 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-10 06:45:44,895 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:45:45,199 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 06:45:45,389 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:45:45,752 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:45:45,964 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:45:46,200 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:45:46,432 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 06:45:46,656 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-09-10 06:45:47,473 WARN L188 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 06:45:47,903 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-09-10 06:45:48,150 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2019-09-10 06:45:48,428 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 06:45:48,607 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 06:45:48,890 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:45:49,146 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:45:50,293 WARN L188 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:45:50,451 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 06:45:50,645 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 06:45:50,860 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:45:51,189 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 06:45:51,685 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:45:52,018 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 06:45:52,226 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-10 06:45:52,543 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:45:52,851 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 06:45:54,503 WARN L188 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 06:45:54,899 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 06:45:55,158 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-09-10 06:45:55,530 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 06:45:56,172 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:45:56,439 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 06:45:56,697 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:45:56,996 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:45:57,245 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:45:57,544 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 06:45:57,768 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:45:57,972 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:45:58,326 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 06:45:58,796 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-09-10 06:45:58,983 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:45:59,199 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:45:59,556 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 06:45:59,741 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:46:00,189 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:46:00,542 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 06:46:01,472 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:46:01,931 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 06:46:02,298 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:46:02,554 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:46:02,940 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:46:03,757 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:46:03,955 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 06:46:04,339 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:46:07,212 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 06:46:07,830 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:46:08,260 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:46:08,763 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:46:09,558 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:46:09,820 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:46:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:09,894 INFO L93 Difference]: Finished difference Result 566909 states and 719986 transitions. [2019-09-10 06:46:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 689 states. [2019-09-10 06:46:09,895 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 77 [2019-09-10 06:46:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:11,657 INFO L225 Difference]: With dead ends: 566909 [2019-09-10 06:46:11,657 INFO L226 Difference]: Without dead ends: 566909 [2019-09-10 06:46:11,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 714 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234705 ImplicationChecksByTransitivity, 146.6s TimeCoverageRelationStatistics Valid=48584, Invalid=463356, Unknown=0, NotChecked=0, Total=511940 [2019-09-10 06:46:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566909 states. [2019-09-10 06:46:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566909 to 220555. [2019-09-10 06:46:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220555 states. [2019-09-10 06:46:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220555 states to 220555 states and 283144 transitions. [2019-09-10 06:46:23,153 INFO L78 Accepts]: Start accepts. Automaton has 220555 states and 283144 transitions. Word has length 77 [2019-09-10 06:46:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:23,153 INFO L475 AbstractCegarLoop]: Abstraction has 220555 states and 283144 transitions. [2019-09-10 06:46:23,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:46:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 220555 states and 283144 transitions. [2019-09-10 06:46:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:46:23,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:23,173 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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-09-10 06:46:23,174 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1210114274, now seen corresponding path program 1 times [2019-09-10 06:46:23,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:23,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:23,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 06:46:23,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:23,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:23,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:23,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:23,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:23,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:23,220 INFO L87 Difference]: Start difference. First operand 220555 states and 283144 transitions. Second operand 3 states. [2019-09-10 06:46:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:23,671 INFO L93 Difference]: Finished difference Result 168280 states and 217087 transitions. [2019-09-10 06:46:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:23,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 06:46:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:23,855 INFO L225 Difference]: With dead ends: 168280 [2019-09-10 06:46:23,855 INFO L226 Difference]: Without dead ends: 168280 [2019-09-10 06:46:23,855 INFO L628 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-09-10 06:46:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168280 states. [2019-09-10 06:46:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168280 to 143025. [2019-09-10 06:46:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143025 states. [2019-09-10 06:46:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143025 states to 143025 states and 184439 transitions. [2019-09-10 06:46:25,819 INFO L78 Accepts]: Start accepts. Automaton has 143025 states and 184439 transitions. Word has length 101 [2019-09-10 06:46:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:25,819 INFO L475 AbstractCegarLoop]: Abstraction has 143025 states and 184439 transitions. [2019-09-10 06:46:25,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 143025 states and 184439 transitions. [2019-09-10 06:46:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:46:25,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:25,826 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:46:25,827 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:25,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:25,827 INFO L82 PathProgramCache]: Analyzing trace with hash -20384812, now seen corresponding path program 1 times [2019-09-10 06:46:25,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:25,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:25,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:25,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:25,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:46:25,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:25,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:25,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:25,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:25,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:25,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:25,874 INFO L87 Difference]: Start difference. First operand 143025 states and 184439 transitions. Second operand 3 states. [2019-09-10 06:46:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:26,161 INFO L93 Difference]: Finished difference Result 129849 states and 166185 transitions. [2019-09-10 06:46:26,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:26,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:46:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:26,293 INFO L225 Difference]: With dead ends: 129849 [2019-09-10 06:46:26,293 INFO L226 Difference]: Without dead ends: 129849 [2019-09-10 06:46:26,293 INFO L628 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-09-10 06:46:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129849 states. [2019-09-10 06:46:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129849 to 128416. [2019-09-10 06:46:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128416 states. [2019-09-10 06:46:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128416 states to 128416 states and 164414 transitions. [2019-09-10 06:46:28,066 INFO L78 Accepts]: Start accepts. Automaton has 128416 states and 164414 transitions. Word has length 102 [2019-09-10 06:46:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:28,066 INFO L475 AbstractCegarLoop]: Abstraction has 128416 states and 164414 transitions. [2019-09-10 06:46:28,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 128416 states and 164414 transitions. [2019-09-10 06:46:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:46:28,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:28,073 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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-09-10 06:46:28,073 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:28,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:28,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1593029107, now seen corresponding path program 1 times [2019-09-10 06:46:28,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:28,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:28,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:28,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:28,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:28,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:28,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:28,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2019-09-10 06:46:28,131 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [75], [77], [80], [83], [86], [91], [93], [96], [99], [102], [105], [107], [109], [112], [115], [117], [120], [121], [123], [132], [145], [148], [151], [154], [156], [158], [162], [164], [187], [190], [198], [201], [204], [207], [209], [211], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:46:28,133 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:28,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:28,141 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:28,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:28,289 INFO L272 AbstractInterpreter]: Visited 74 different actions 457 times. Merged at 50 different actions 338 times. Widened at 15 different actions 39 times. Performed 1363 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1363 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 15 different actions. Largest state had 96 variables. [2019-09-10 06:46:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:28,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:28,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:28,289 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) [2019-09-10 06:46:28,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:28,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:46:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:28,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 06:46:28,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:28,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:28,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:28,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2019-09-10 06:46:28,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:28,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:46:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:46:28,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:46:28,549 INFO L87 Difference]: Start difference. First operand 128416 states and 164414 transitions. Second operand 10 states. [2019-09-10 06:46:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:29,810 INFO L93 Difference]: Finished difference Result 107223 states and 133644 transitions. [2019-09-10 06:46:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:46:29,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 06:46:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:29,911 INFO L225 Difference]: With dead ends: 107223 [2019-09-10 06:46:29,911 INFO L226 Difference]: Without dead ends: 107223 [2019-09-10 06:46:29,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:46:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107223 states. [2019-09-10 06:46:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107223 to 80366. [2019-09-10 06:46:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80366 states. [2019-09-10 06:46:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80366 states to 80366 states and 101012 transitions. [2019-09-10 06:46:30,638 INFO L78 Accepts]: Start accepts. Automaton has 80366 states and 101012 transitions. Word has length 103 [2019-09-10 06:46:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:30,638 INFO L475 AbstractCegarLoop]: Abstraction has 80366 states and 101012 transitions. [2019-09-10 06:46:30,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:46:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 80366 states and 101012 transitions. [2019-09-10 06:46:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 06:46:30,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:30,647 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:30,647 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:30,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:30,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1997196966, now seen corresponding path program 2 times [2019-09-10 06:46:30,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:30,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:30,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:30,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:30,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 06:46:30,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:30,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:30,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:30,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:30,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:30,717 INFO L87 Difference]: Start difference. First operand 80366 states and 101012 transitions. Second operand 3 states. [2019-09-10 06:46:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:30,838 INFO L93 Difference]: Finished difference Result 68969 states and 85923 transitions. [2019-09-10 06:46:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:30,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 06:46:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:30,898 INFO L225 Difference]: With dead ends: 68969 [2019-09-10 06:46:30,898 INFO L226 Difference]: Without dead ends: 68969 [2019-09-10 06:46:30,899 INFO L628 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-09-10 06:46:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68969 states. [2019-09-10 06:46:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68969 to 68225. [2019-09-10 06:46:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68225 states. [2019-09-10 06:46:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68225 states to 68225 states and 85052 transitions. [2019-09-10 06:46:31,877 INFO L78 Accepts]: Start accepts. Automaton has 68225 states and 85052 transitions. Word has length 107 [2019-09-10 06:46:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:31,877 INFO L475 AbstractCegarLoop]: Abstraction has 68225 states and 85052 transitions. [2019-09-10 06:46:31,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 68225 states and 85052 transitions. [2019-09-10 06:46:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:46:31,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:31,881 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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] [2019-09-10 06:46:31,881 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1225997574, now seen corresponding path program 1 times [2019-09-10 06:46:31,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:31,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:31,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 06:46:31,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:31,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:46:32,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:32,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:32,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 06:46:32,009 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [75], [77], [80], [91], [93], [96], [99], [107], [109], [112], [115], [117], [120], [121], [123], [125], [130], [141], [145], [158], [166], [185], [196], [198], [201], [204], [207], [209], [211], [249], [251], [253], [266], [274], [295], [296], [300], [301], [302] [2019-09-10 06:46:32,010 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:32,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:32,018 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:32,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:32,105 INFO L272 AbstractInterpreter]: Visited 61 different actions 307 times. Merged at 37 different actions 215 times. Widened at 13 different actions 27 times. Performed 1003 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1003 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 13 different actions. Largest state had 94 variables. [2019-09-10 06:46:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:32,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:32,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:32,106 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) [2019-09-10 06:46:32,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:32,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:46:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:32,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:46:32,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:46:32,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:46:32,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:32,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2019-09-10 06:46:32,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:32,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:46:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:46:32,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:46:32,610 INFO L87 Difference]: Start difference. First operand 68225 states and 85052 transitions. Second operand 11 states. [2019-09-10 06:46:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:33,061 INFO L93 Difference]: Finished difference Result 110971 states and 135144 transitions. [2019-09-10 06:46:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:46:33,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2019-09-10 06:46:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:33,166 INFO L225 Difference]: With dead ends: 110971 [2019-09-10 06:46:33,166 INFO L226 Difference]: Without dead ends: 110971 [2019-09-10 06:46:33,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:46:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110971 states. [2019-09-10 06:46:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110971 to 109682. [2019-09-10 06:46:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109682 states. [2019-09-10 06:46:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109682 states to 109682 states and 133857 transitions. [2019-09-10 06:46:34,516 INFO L78 Accepts]: Start accepts. Automaton has 109682 states and 133857 transitions. Word has length 108 [2019-09-10 06:46:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:34,516 INFO L475 AbstractCegarLoop]: Abstraction has 109682 states and 133857 transitions. [2019-09-10 06:46:34,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:46:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 109682 states and 133857 transitions. [2019-09-10 06:46:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 06:46:34,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:34,523 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:34,523 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2111438520, now seen corresponding path program 1 times [2019-09-10 06:46:34,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:34,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:34,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:46:34,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:34,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:34,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:34,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:34,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:34,575 INFO L87 Difference]: Start difference. First operand 109682 states and 133857 transitions. Second operand 3 states. [2019-09-10 06:46:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:34,855 INFO L93 Difference]: Finished difference Result 105953 states and 128115 transitions. [2019-09-10 06:46:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:34,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 06:46:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:34,980 INFO L225 Difference]: With dead ends: 105953 [2019-09-10 06:46:34,980 INFO L226 Difference]: Without dead ends: 105953 [2019-09-10 06:46:34,980 INFO L628 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-09-10 06:46:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105953 states. [2019-09-10 06:46:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105953 to 93869. [2019-09-10 06:46:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93869 states. [2019-09-10 06:46:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93869 states to 93869 states and 113788 transitions. [2019-09-10 06:46:36,326 INFO L78 Accepts]: Start accepts. Automaton has 93869 states and 113788 transitions. Word has length 122 [2019-09-10 06:46:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:36,327 INFO L475 AbstractCegarLoop]: Abstraction has 93869 states and 113788 transitions. [2019-09-10 06:46:36,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 93869 states and 113788 transitions. [2019-09-10 06:46:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 06:46:36,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:36,336 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:36,336 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1845441822, now seen corresponding path program 1 times [2019-09-10 06:46:36,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 06:46:36,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:36,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:36,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:36,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:36,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:36,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,407 INFO L87 Difference]: Start difference. First operand 93869 states and 113788 transitions. Second operand 3 states. [2019-09-10 06:46:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:36,489 INFO L93 Difference]: Finished difference Result 33523 states and 39892 transitions. [2019-09-10 06:46:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:36,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 06:46:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:36,523 INFO L225 Difference]: With dead ends: 33523 [2019-09-10 06:46:36,524 INFO L226 Difference]: Without dead ends: 33523 [2019-09-10 06:46:36,524 INFO L628 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-09-10 06:46:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33523 states. [2019-09-10 06:46:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33523 to 33354. [2019-09-10 06:46:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33354 states. [2019-09-10 06:46:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33354 states to 33354 states and 39704 transitions. [2019-09-10 06:46:36,755 INFO L78 Accepts]: Start accepts. Automaton has 33354 states and 39704 transitions. Word has length 122 [2019-09-10 06:46:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:36,755 INFO L475 AbstractCegarLoop]: Abstraction has 33354 states and 39704 transitions. [2019-09-10 06:46:36,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 33354 states and 39704 transitions. [2019-09-10 06:46:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 06:46:36,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:36,761 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:36,761 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:36,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash 944066232, now seen corresponding path program 1 times [2019-09-10 06:46:36,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:36,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:36,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:37,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:37,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:37,047 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2019-09-10 06:46:37,047 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [73], [75], [77], [80], [83], [91], [93], [96], [99], [102], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [143], [145], [148], [151], [154], [156], [158], [194], [196], [198], [211], [219], [222], [225], [228], [230], [238], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:46:37,049 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:37,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:37,054 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:37,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:37,327 INFO L272 AbstractInterpreter]: Visited 76 different actions 820 times. Merged at 52 different actions 620 times. Widened at 19 different actions 115 times. Performed 2321 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2321 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 104 fixpoints after 21 different actions. Largest state had 96 variables. [2019-09-10 06:46:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:37,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:37,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:37,327 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) [2019-09-10 06:46:37,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:37,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:46:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:37,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:46:37,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:37,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:37,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:37,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:37,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:46:37,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:38,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:38,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:38,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:38,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:38,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:38,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:38,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:38,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:46:38,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:38,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 06:46:38,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:38,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:46:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:46:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:46:38,403 INFO L87 Difference]: Start difference. First operand 33354 states and 39704 transitions. Second operand 22 states. [2019-09-10 06:46:40,942 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-09-10 06:46:41,899 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-09-10 06:46:42,299 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2019-09-10 06:46:42,441 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-09-10 06:46:43,741 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-09-10 06:46:43,923 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2019-09-10 06:46:44,381 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 06:46:44,678 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 06:46:44,969 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2019-09-10 06:46:45,315 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 06:46:45,551 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2019-09-10 06:46:45,939 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 06:46:46,817 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 06:46:47,044 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 41 [2019-09-10 06:46:47,872 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-10 06:46:48,735 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 06:46:49,055 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 39 [2019-09-10 06:46:49,521 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2019-09-10 06:46:49,826 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-09-10 06:46:50,011 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 39 [2019-09-10 06:46:50,399 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 06:46:50,559 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2019-09-10 06:46:51,609 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2019-09-10 06:46:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:51,905 INFO L93 Difference]: Finished difference Result 57925 states and 68803 transitions. [2019-09-10 06:46:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 06:46:51,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 06:46:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:51,954 INFO L225 Difference]: With dead ends: 57925 [2019-09-10 06:46:51,954 INFO L226 Difference]: Without dead ends: 57925 [2019-09-10 06:46:51,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=2177, Invalid=8953, Unknown=0, NotChecked=0, Total=11130 [2019-09-10 06:46:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57925 states. [2019-09-10 06:46:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57925 to 31011. [2019-09-10 06:46:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31011 states. [2019-09-10 06:46:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31011 states to 31011 states and 36695 transitions. [2019-09-10 06:46:52,266 INFO L78 Accepts]: Start accepts. Automaton has 31011 states and 36695 transitions. Word has length 122 [2019-09-10 06:46:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:52,266 INFO L475 AbstractCegarLoop]: Abstraction has 31011 states and 36695 transitions. [2019-09-10 06:46:52,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:46:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 31011 states and 36695 transitions. [2019-09-10 06:46:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 06:46:52,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:52,271 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1] [2019-09-10 06:46:52,271 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash -402125727, now seen corresponding path program 1 times [2019-09-10 06:46:52,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:52,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 58 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:46:52,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:52,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:52,649 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 06:46:52,650 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [73], [75], [77], [80], [83], [91], [93], [96], [99], [102], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [143], [145], [148], [151], [154], [156], [158], [194], [198], [211], [219], [222], [225], [228], [230], [238], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:46:52,651 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:52,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:52,656 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:52,923 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:52,924 INFO L272 AbstractInterpreter]: Visited 75 different actions 873 times. Merged at 51 different actions 678 times. Widened at 19 different actions 132 times. Performed 2384 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2384 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 107 fixpoints after 20 different actions. Largest state had 96 variables. [2019-09-10 06:46:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:52,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:52,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:52,924 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-09-10 06:46:52,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:52,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:46:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:53,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:46:53,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:53,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 55 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:46:53,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:53,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 62 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:46:53,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:53,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 31 [2019-09-10 06:46:53,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:53,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:46:53,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:46:53,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:46:53,916 INFO L87 Difference]: Start difference. First operand 31011 states and 36695 transitions. Second operand 25 states. [2019-09-10 06:46:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:57,639 INFO L93 Difference]: Finished difference Result 67999 states and 81641 transitions. [2019-09-10 06:46:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 06:46:57,640 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 123 [2019-09-10 06:46:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:57,699 INFO L225 Difference]: With dead ends: 67999 [2019-09-10 06:46:57,699 INFO L226 Difference]: Without dead ends: 67999 [2019-09-10 06:46:57,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=895, Invalid=4217, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 06:46:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67999 states. [2019-09-10 06:46:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67999 to 38329. [2019-09-10 06:46:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38329 states. [2019-09-10 06:46:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38329 states to 38329 states and 45589 transitions. [2019-09-10 06:46:58,084 INFO L78 Accepts]: Start accepts. Automaton has 38329 states and 45589 transitions. Word has length 123 [2019-09-10 06:46:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:58,085 INFO L475 AbstractCegarLoop]: Abstraction has 38329 states and 45589 transitions. [2019-09-10 06:46:58,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:46:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 38329 states and 45589 transitions. [2019-09-10 06:46:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:46:58,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:58,090 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1] [2019-09-10 06:46:58,090 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash -736383423, now seen corresponding path program 2 times [2019-09-10 06:46:58,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:58,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:58,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 06:46:58,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:58,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:58,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 06:46:58,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 06:46:58,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:58,630 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-09-10 06:46:58,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 06:46:58,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 06:46:58,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 06:46:58,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 06:46:58,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:46:58,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:58,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 06:46:59,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 06:46:59,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:59,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 06:46:59,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:59,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:46:59,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:46:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:46:59,706 INFO L87 Difference]: Start difference. First operand 38329 states and 45589 transitions. Second operand 22 states. [2019-09-10 06:47:00,571 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-09-10 06:47:00,740 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-09-10 06:47:00,915 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-09-10 06:47:01,075 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2019-09-10 06:47:01,434 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2019-09-10 06:47:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:02,066 INFO L93 Difference]: Finished difference Result 43613 states and 51766 transitions. [2019-09-10 06:47:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:47:02,067 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 124 [2019-09-10 06:47:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:02,101 INFO L225 Difference]: With dead ends: 43613 [2019-09-10 06:47:02,101 INFO L226 Difference]: Without dead ends: 43613 [2019-09-10 06:47:02,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=352, Invalid=1370, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:47:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43613 states. [2019-09-10 06:47:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43613 to 35358. [2019-09-10 06:47:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35358 states. [2019-09-10 06:47:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35358 states to 35358 states and 42134 transitions. [2019-09-10 06:47:02,361 INFO L78 Accepts]: Start accepts. Automaton has 35358 states and 42134 transitions. Word has length 124 [2019-09-10 06:47:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:02,361 INFO L475 AbstractCegarLoop]: Abstraction has 35358 states and 42134 transitions. [2019-09-10 06:47:02,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:47:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 35358 states and 42134 transitions. [2019-09-10 06:47:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 06:47:02,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:02,367 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:02,367 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1296463840, now seen corresponding path program 1 times [2019-09-10 06:47:02,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:02,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 06:47:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:02,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:47:02,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:02,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:47:02,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:02,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:47:02,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:47:02,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:47:02,423 INFO L87 Difference]: Start difference. First operand 35358 states and 42134 transitions. Second operand 4 states. [2019-09-10 06:47:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:02,579 INFO L93 Difference]: Finished difference Result 26020 states and 30616 transitions. [2019-09-10 06:47:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:02,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 06:47:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:02,610 INFO L225 Difference]: With dead ends: 26020 [2019-09-10 06:47:02,610 INFO L226 Difference]: Without dead ends: 26020 [2019-09-10 06:47:02,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26020 states. [2019-09-10 06:47:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26020 to 22123. [2019-09-10 06:47:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22123 states. [2019-09-10 06:47:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22123 states to 22123 states and 25958 transitions. [2019-09-10 06:47:02,900 INFO L78 Accepts]: Start accepts. Automaton has 22123 states and 25958 transitions. Word has length 126 [2019-09-10 06:47:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:02,901 INFO L475 AbstractCegarLoop]: Abstraction has 22123 states and 25958 transitions. [2019-09-10 06:47:02,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:47:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 22123 states and 25958 transitions. [2019-09-10 06:47:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 06:47:02,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:02,908 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:02,908 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:02,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1882505691, now seen corresponding path program 1 times [2019-09-10 06:47:02,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:02,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:02,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:02,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:02,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:47:02,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:02,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:47:02,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:02,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:47:02,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:47:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:47:02,981 INFO L87 Difference]: Start difference. First operand 22123 states and 25958 transitions. Second operand 4 states. [2019-09-10 06:47:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:03,133 INFO L93 Difference]: Finished difference Result 23506 states and 26976 transitions. [2019-09-10 06:47:03,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:03,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 06:47:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:03,158 INFO L225 Difference]: With dead ends: 23506 [2019-09-10 06:47:03,158 INFO L226 Difference]: Without dead ends: 23506 [2019-09-10 06:47:03,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23506 states. [2019-09-10 06:47:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23506 to 19404. [2019-09-10 06:47:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19404 states. [2019-09-10 06:47:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19404 states to 19404 states and 22377 transitions. [2019-09-10 06:47:03,338 INFO L78 Accepts]: Start accepts. Automaton has 19404 states and 22377 transitions. Word has length 126 [2019-09-10 06:47:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:03,339 INFO L475 AbstractCegarLoop]: Abstraction has 19404 states and 22377 transitions. [2019-09-10 06:47:03,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:47:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19404 states and 22377 transitions. [2019-09-10 06:47:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 06:47:03,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:03,342 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1] [2019-09-10 06:47:03,342 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1725557824, now seen corresponding path program 1 times [2019-09-10 06:47:03,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:03,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:03,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:03,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:03,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:03,636 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 06:47:03,637 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [73], [75], [77], [80], [83], [86], [89], [91], [93], [96], [99], [102], [105], [107], [109], [112], [115], [117], [120], [121], [123], [132], [143], [145], [148], [151], [154], [156], [158], [187], [190], [198], [201], [204], [207], [209], [211], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:47:03,638 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:03,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:03,645 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:03,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:03,889 INFO L272 AbstractInterpreter]: Visited 75 different actions 1004 times. Merged at 51 different actions 793 times. Widened at 21 different actions 166 times. Performed 2859 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2859 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 129 fixpoints after 21 different actions. Largest state had 96 variables. [2019-09-10 06:47:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:03,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:03,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:03,890 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-09-10 06:47:03,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:03,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:47:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:03,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:47:03,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:04,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,345 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-09-10 06:47:04,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:04,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:04,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:04,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:06,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:06,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:06,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 06:47:06,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:06,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:47:06,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:47:06,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:47:06,427 INFO L87 Difference]: Start difference. First operand 19404 states and 22377 transitions. Second operand 20 states. [2019-09-10 06:47:06,889 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 06:47:07,086 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:47:07,464 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:47:07,724 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:47:08,052 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:47:08,522 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:47:08,884 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:47:09,126 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:47:09,384 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:47:09,687 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:47:10,061 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:47:10,293 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:47:10,562 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:47:10,856 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:47:11,152 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:47:11,382 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:47:11,808 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 06:47:12,055 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:47:12,403 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:47:12,675 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:47:12,975 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:47:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:12,991 INFO L93 Difference]: Finished difference Result 24672 states and 28115 transitions. [2019-09-10 06:47:12,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:47:12,991 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 126 [2019-09-10 06:47:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:13,010 INFO L225 Difference]: With dead ends: 24672 [2019-09-10 06:47:13,010 INFO L226 Difference]: Without dead ends: 24672 [2019-09-10 06:47:13,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 221 SyntacticMatches, 18 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=712, Invalid=1738, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 06:47:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2019-09-10 06:47:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 17432. [2019-09-10 06:47:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17432 states. [2019-09-10 06:47:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17432 states to 17432 states and 19972 transitions. [2019-09-10 06:47:13,147 INFO L78 Accepts]: Start accepts. Automaton has 17432 states and 19972 transitions. Word has length 126 [2019-09-10 06:47:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:13,147 INFO L475 AbstractCegarLoop]: Abstraction has 17432 states and 19972 transitions. [2019-09-10 06:47:13,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:47:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 17432 states and 19972 transitions. [2019-09-10 06:47:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 06:47:13,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:13,151 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1] [2019-09-10 06:47:13,151 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:13,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1599099914, now seen corresponding path program 1 times [2019-09-10 06:47:13,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:13,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:13,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:13,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:13,627 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 06:47:13,628 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [73], [75], [77], [80], [83], [86], [89], [91], [93], [96], [99], [102], [105], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [145], [148], [151], [154], [156], [158], [187], [190], [198], [201], [204], [207], [209], [211], [249], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:47:13,630 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:13,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:13,637 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:13,814 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:13,814 INFO L272 AbstractInterpreter]: Visited 75 different actions 746 times. Merged at 51 different actions 572 times. Widened at 20 different actions 100 times. Performed 2242 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2242 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 86 fixpoints after 21 different actions. Largest state had 96 variables. [2019-09-10 06:47:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:13,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:13,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:13,815 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-09-10 06:47:13,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:13,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:47:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:13,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 06:47:13,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:14,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:14,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:15,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:16,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:16,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:16,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:17,661 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 06:47:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:18,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2019-09-10 06:47:18,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:18,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 06:47:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 06:47:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2150, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:47:18,220 INFO L87 Difference]: Start difference. First operand 17432 states and 19972 transitions. Second operand 34 states. [2019-09-10 06:47:18,383 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 06:47:21,790 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:47:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:21,877 INFO L93 Difference]: Finished difference Result 24681 states and 28484 transitions. [2019-09-10 06:47:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:47:21,877 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 126 [2019-09-10 06:47:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:21,895 INFO L225 Difference]: With dead ends: 24681 [2019-09-10 06:47:21,895 INFO L226 Difference]: Without dead ends: 24681 [2019-09-10 06:47:21,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 198 SyntacticMatches, 24 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=620, Invalid=4636, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 06:47:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24681 states. [2019-09-10 06:47:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24681 to 19227. [2019-09-10 06:47:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19227 states. [2019-09-10 06:47:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19227 states to 19227 states and 22079 transitions. [2019-09-10 06:47:22,032 INFO L78 Accepts]: Start accepts. Automaton has 19227 states and 22079 transitions. Word has length 126 [2019-09-10 06:47:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:22,032 INFO L475 AbstractCegarLoop]: Abstraction has 19227 states and 22079 transitions. [2019-09-10 06:47:22,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 06:47:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 19227 states and 22079 transitions. [2019-09-10 06:47:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:47:22,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:22,036 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1] [2019-09-10 06:47:22,036 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash -481370057, now seen corresponding path program 1 times [2019-09-10 06:47:22,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:22,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:22,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 13 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:22,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:22,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:22,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 06:47:22,687 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [73], [75], [77], [80], [83], [86], [89], [91], [93], [96], [99], [102], [105], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [145], [148], [151], [154], [156], [158], [198], [201], [204], [207], [209], [211], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:47:22,690 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:22,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:22,697 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:22,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:22,900 INFO L272 AbstractInterpreter]: Visited 74 different actions 677 times. Merged at 50 different actions 526 times. Widened at 19 different actions 90 times. Performed 2034 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2034 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 73 fixpoints after 20 different actions. Largest state had 96 variables. [2019-09-10 06:47:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:22,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:22,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:22,900 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-09-10 06:47:22,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:22,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:47:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:23,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 06:47:23,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:23,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 13 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:24,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:25,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:25,606 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 06:47:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 13 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:26,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:26,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 59 [2019-09-10 06:47:26,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:26,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 06:47:26,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 06:47:26,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3172, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 06:47:26,168 INFO L87 Difference]: Start difference. First operand 19227 states and 22079 transitions. Second operand 41 states. [2019-09-10 06:47:32,772 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:47:33,877 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:47:35,191 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:47:37,040 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:47:37,360 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 06:47:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:39,173 INFO L93 Difference]: Finished difference Result 28833 states and 33294 transitions. [2019-09-10 06:47:39,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 06:47:39,174 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 128 [2019-09-10 06:47:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:39,197 INFO L225 Difference]: With dead ends: 28833 [2019-09-10 06:47:39,197 INFO L226 Difference]: Without dead ends: 28833 [2019-09-10 06:47:39,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 217 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1580, Invalid=12462, Unknown=0, NotChecked=0, Total=14042 [2019-09-10 06:47:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28833 states. [2019-09-10 06:47:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28833 to 19660. [2019-09-10 06:47:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19660 states. [2019-09-10 06:47:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19660 states to 19660 states and 22572 transitions. [2019-09-10 06:47:39,445 INFO L78 Accepts]: Start accepts. Automaton has 19660 states and 22572 transitions. Word has length 128 [2019-09-10 06:47:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:39,445 INFO L475 AbstractCegarLoop]: Abstraction has 19660 states and 22572 transitions. [2019-09-10 06:47:39,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 06:47:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 19660 states and 22572 transitions. [2019-09-10 06:47:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:47:39,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:39,448 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:39,449 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1375257117, now seen corresponding path program 1 times [2019-09-10 06:47:39,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:39,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:39,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:39,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:39,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 33 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:40,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:40,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:40,078 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 06:47:40,080 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [75], [77], [80], [83], [86], [89], [91], [93], [96], [99], [102], [105], [107], [109], [112], [115], [117], [120], [121], [123], [132], [134], [137], [145], [148], [151], [154], [156], [158], [198], [201], [204], [207], [209], [211], [240], [243], [245], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:47:40,081 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:40,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:40,086 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:40,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:40,266 INFO L272 AbstractInterpreter]: Visited 74 different actions 673 times. Merged at 50 different actions 525 times. Widened at 19 different actions 78 times. Performed 2052 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2052 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 70 fixpoints after 18 different actions. Largest state had 96 variables. [2019-09-10 06:47:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:40,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:40,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:40,267 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-09-10 06:47:40,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:40,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:47:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:40,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 06:47:40,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:41,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:41,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:41,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:41,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:42,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:42,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:42,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:42,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:44,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:44,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:47:44,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:44,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:44,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:44,927 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 06:47:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:47:48,913 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-09-10 06:47:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:49,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:49,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 54 [2019-09-10 06:47:49,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:49,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 06:47:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 06:47:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2671, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 06:47:49,225 INFO L87 Difference]: Start difference. First operand 19660 states and 22572 transitions. Second operand 38 states. [2019-09-10 06:47:51,142 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-10 06:47:51,610 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:47:52,130 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:47:52,455 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:47:53,402 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-09-10 06:47:53,713 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:47:55,263 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 06:47:57,610 WARN L188 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 06:47:58,521 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-09-10 06:48:04,866 WARN L188 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-10 06:48:06,898 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-09-10 06:48:07,782 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-09-10 06:48:08,904 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-09-10 06:48:09,096 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:48:11,444 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-09-10 06:48:13,894 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-09-10 06:48:16,007 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 06:48:17,051 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-09-10 06:48:17,994 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 06:48:19,045 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-09-10 06:48:20,078 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 06:48:21,656 WARN L188 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-09-10 06:48:21,909 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 06:48:23,650 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 06:48:24,859 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:48:25,512 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-09-10 06:48:27,657 WARN L188 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-09-10 06:48:29,911 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-09-10 06:48:32,381 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-09-10 06:48:35,328 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 06:48:37,020 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 06:48:37,604 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 06:48:38,095 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:48:39,783 WARN L188 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-09-10 06:48:40,515 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-09-10 06:48:43,286 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 06:48:46,427 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-10 06:48:47,553 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-10 06:48:47,965 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:48:48,860 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 06:48:50,046 WARN L188 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-10 06:48:50,755 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 06:48:52,021 WARN L188 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-10 06:48:52,745 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 06:48:54,103 WARN L188 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-10 06:48:54,820 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:48:57,550 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 06:48:58,054 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:48:58,874 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:49:01,258 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:49:02,434 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:49:02,992 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:49:03,555 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:49:07,412 WARN L188 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 06:49:09,226 WARN L188 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 06:49:09,576 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:49:10,570 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 06:49:10,834 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 06:49:11,483 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:49:12,901 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 06:49:14,072 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:49:15,168 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-10 06:49:15,896 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 06:49:17,953 WARN L188 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:49:18,433 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:49:20,021 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:49:23,948 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 06:49:26,453 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:49:26,960 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 06:49:28,624 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:49:28,945 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:49:29,651 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:49:30,158 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:49:30,752 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:49:31,527 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 06:49:32,355 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 06:49:33,776 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-10 06:49:34,854 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 06:49:35,572 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 06:49:36,566 WARN L188 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 06:49:38,827 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:49:39,987 WARN L188 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:49:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:40,011 INFO L93 Difference]: Finished difference Result 34357 states and 39620 transitions. [2019-09-10 06:49:40,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-10 06:49:40,012 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 129 [2019-09-10 06:49:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:40,044 INFO L225 Difference]: With dead ends: 34357 [2019-09-10 06:49:40,044 INFO L226 Difference]: Without dead ends: 34251 [2019-09-10 06:49:40,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 192 SyntacticMatches, 35 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9585 ImplicationChecksByTransitivity, 90.1s TimeCoverageRelationStatistics Valid=3485, Invalid=26965, Unknown=0, NotChecked=0, Total=30450 [2019-09-10 06:49:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34251 states. [2019-09-10 06:49:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34251 to 21264. [2019-09-10 06:49:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21264 states. [2019-09-10 06:49:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21264 states to 21264 states and 24543 transitions. [2019-09-10 06:49:40,252 INFO L78 Accepts]: Start accepts. Automaton has 21264 states and 24543 transitions. Word has length 129 [2019-09-10 06:49:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:40,252 INFO L475 AbstractCegarLoop]: Abstraction has 21264 states and 24543 transitions. [2019-09-10 06:49:40,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 06:49:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21264 states and 24543 transitions. [2019-09-10 06:49:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:49:40,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:40,256 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:40,256 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 758145885, now seen corresponding path program 1 times [2019-09-10 06:49:40,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:40,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 34 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:40,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:40,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:40,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 06:49:40,822 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [56], [59], [64], [67], [70], [73], [75], [77], [80], [83], [86], [91], [93], [96], [99], [102], [105], [107], [109], [112], [115], [117], [120], [121], [123], [132], [145], [148], [151], [154], [156], [158], [187], [190], [192], [198], [201], [204], [207], [209], [211], [240], [243], [251], [253], [256], [259], [262], [264], [266], [295], [296], [300], [301], [302] [2019-09-10 06:49:40,824 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:40,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:40,832 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:41,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:49:41,010 INFO L272 AbstractInterpreter]: Visited 74 different actions 561 times. Merged at 50 different actions 425 times. Widened at 16 different actions 54 times. Performed 1605 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1605 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 56 fixpoints after 18 different actions. Largest state had 96 variables. [2019-09-10 06:49:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:41,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:49:41,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:41,010 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) [2019-09-10 06:49:41,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:41,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:49:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:41,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 06:49:41,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:49:41,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:41,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:41,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:41,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 34 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:42,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:49:42,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:42,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:42,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:43,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:43,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:43,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:43,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:44,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:44,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:49:44,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:49:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:49:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 34 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:46,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:49:46,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 51 [2019-09-10 06:49:46,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:49:46,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 06:49:46,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 06:49:46,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2312, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:49:46,649 INFO L87 Difference]: Start difference. First operand 21264 states and 24543 transitions. Second operand 36 states. [2019-09-10 06:49:50,852 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 06:49:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:51,717 INFO L93 Difference]: Finished difference Result 34215 states and 39734 transitions. [2019-09-10 06:49:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 06:49:51,718 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 129 [2019-09-10 06:49:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:51,745 INFO L225 Difference]: With dead ends: 34215 [2019-09-10 06:49:51,745 INFO L226 Difference]: Without dead ends: 34215 [2019-09-10 06:49:51,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 198 SyntacticMatches, 29 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=794, Invalid=5058, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 06:49:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34215 states. [2019-09-10 06:49:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34215 to 23665. [2019-09-10 06:49:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23665 states. [2019-09-10 06:49:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23665 states to 23665 states and 27386 transitions. [2019-09-10 06:49:52,078 INFO L78 Accepts]: Start accepts. Automaton has 23665 states and 27386 transitions. Word has length 129 [2019-09-10 06:49:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:52,078 INFO L475 AbstractCegarLoop]: Abstraction has 23665 states and 27386 transitions. [2019-09-10 06:49:52,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 06:49:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 23665 states and 27386 transitions. [2019-09-10 06:49:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 06:49:52,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:52,083 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 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-09-10 06:49:52,083 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash 498378029, now seen corresponding path program 2 times [2019-09-10 06:49:52,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:52,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:52,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 132 proven. 32 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-10 06:49:52,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:52,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:52,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 06:49:52,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 06:49:52,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:52,720 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-09-10 06:49:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 06:49:52,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 06:49:52,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 06:49:52,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 06:49:52,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 06:49:52,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:49:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 06:49:53,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:49:53,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 113 proven. 98 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:49:54,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:49:54,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 36 [2019-09-10 06:49:54,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:49:54,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:49:54,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:49:54,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:49:54,148 INFO L87 Difference]: Start difference. First operand 23665 states and 27386 transitions. Second operand 26 states. [2019-09-10 06:49:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:59,121 INFO L93 Difference]: Finished difference Result 39532 states and 45613 transitions. [2019-09-10 06:49:59,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-10 06:49:59,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 149 [2019-09-10 06:49:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:59,157 INFO L225 Difference]: With dead ends: 39532 [2019-09-10 06:49:59,157 INFO L226 Difference]: Without dead ends: 39532 [2019-09-10 06:49:59,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2060 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1932, Invalid=6258, Unknown=0, NotChecked=0, Total=8190 [2019-09-10 06:49:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39532 states. [2019-09-10 06:49:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39532 to 26039. [2019-09-10 06:49:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26039 states. [2019-09-10 06:49:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26039 states to 26039 states and 30106 transitions. [2019-09-10 06:49:59,556 INFO L78 Accepts]: Start accepts. Automaton has 26039 states and 30106 transitions. Word has length 149 [2019-09-10 06:49:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:59,557 INFO L475 AbstractCegarLoop]: Abstraction has 26039 states and 30106 transitions. [2019-09-10 06:49:59,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:49:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 26039 states and 30106 transitions. [2019-09-10 06:49:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 06:49:59,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:59,563 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 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-09-10 06:49:59,563 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash 189699539, now seen corresponding path program 1 times [2019-09-10 06:49:59,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:59,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:59,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 06:49:59,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:59,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 06:49:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 06:49:59,714 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 06:49:59,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 06:49:59 BoogieIcfgContainer [2019-09-10 06:49:59,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 06:49:59,919 INFO L168 Benchmark]: Toolchain (without parser) took 689634.08 ms. Allocated memory was 133.7 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 88.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-09-10 06:49:59,919 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-10 06:49:59,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.06 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 87.9 MB in the beginning and 174.3 MB in the end (delta: -86.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-09-10 06:49:59,920 INFO L168 Benchmark]: Boogie Preprocessor took 47.27 ms. Allocated memory is still 200.3 MB. Free memory was 174.3 MB in the beginning and 171.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-10 06:49:59,920 INFO L168 Benchmark]: RCFGBuilder took 625.55 ms. Allocated memory is still 200.3 MB. Free memory was 171.9 MB in the beginning and 137.9 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-09-10 06:49:59,920 INFO L168 Benchmark]: TraceAbstraction took 688210.65 ms. Allocated memory was 200.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 137.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-09-10 06:49:59,921 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.26 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.06 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 87.9 MB in the beginning and 174.3 MB in the end (delta: -86.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.27 ms. Allocated memory is still 200.3 MB. Free memory was 174.3 MB in the beginning and 171.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 625.55 ms. Allocated memory is still 200.3 MB. Free memory was 171.9 MB in the beginning and 137.9 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 688210.65 ms. Allocated memory was 200.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 137.9 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 200]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] unsigned char r1 = '\x0'; [L14] port_t p1 = 0; [L15] char p1_old = '\x0'; [L16] char p1_new = '\x0'; [L17] char id1 = '\x0'; [L18] char st1 = '\x0'; [L19] msg_t send1 = '\x0'; [L20] _Bool mode1 = 0; [L21] _Bool alive1 = 0; [L22] port_t p2 = 0; [L23] char p2_old = '\x0'; [L24] char p2_new = '\x0'; [L25] char id2 = '\x0'; [L26] char st2 = '\x0'; [L27] msg_t send2 = '\x0'; [L28] _Bool mode2 = 0; [L29] _Bool alive2 = 0; [L30] port_t p3 = 0; [L31] char p3_old = '\x0'; [L32] char p3_new = '\x0'; [L33] char id3 = '\x0'; [L34] char st3 = '\x0'; [L35] msg_t send3 = '\x0'; [L36] _Bool mode3 = 0; [L37] _Bool alive3 = 0; [L41] void (*nodes[3])() = { &node1, &node2, &node3 }; [L45] int __return_5979; [L46] int __return_6075; VAL [\old(__return_5979)=263, \old(__return_6075)=284, \old(__return_main)=278, \old(alive1)=10, \old(alive2)=23, \old(alive3)=24, \old(id1)=259, \old(id2)=283, \old(id3)=274, \old(mode1)=19, \old(mode2)=25, \old(mode3)=13, \old(nomsg)=265, \old(p1)=286, \old(p1_new)=270, \old(p1_old)=285, \old(p2)=260, \old(p2_new)=268, \old(p2_old)=273, \old(p3)=264, \old(p3_new)=276, \old(p3_old)=272, \old(r1)=11, \old(send1)=277, \old(send2)=261, \old(send3)=258, \old(st1)=262, \old(st2)=282, \old(st3)=271, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L49] int main__c1; [L50] int main__i2; [L51] main__c1 = 0 [L52] r1 = __VERIFIER_nondet_uchar() [L53] id1 = __VERIFIER_nondet_char() [L54] st1 = __VERIFIER_nondet_char() [L55] send1 = __VERIFIER_nondet_char() [L56] mode1 = __VERIFIER_nondet_bool() [L57] alive1 = __VERIFIER_nondet_bool() [L58] id2 = __VERIFIER_nondet_char() [L59] st2 = __VERIFIER_nondet_char() [L60] send2 = __VERIFIER_nondet_char() [L61] mode2 = __VERIFIER_nondet_bool() [L62] alive2 = __VERIFIER_nondet_bool() [L63] id3 = __VERIFIER_nondet_char() [L64] st3 = __VERIFIER_nondet_char() [L65] send3 = __VERIFIER_nondet_char() [L66] mode3 = __VERIFIER_nondet_bool() [L67] alive3 = __VERIFIER_nondet_bool() [L69] int init__tmp; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L70] COND TRUE ((int)r1) == 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L72] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L74] COND TRUE ((int)id1) >= 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L76] COND TRUE ((int)st1) == 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L78] COND TRUE ((int)send1) == ((int)id1) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L80] COND TRUE ((int)mode1) == 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L82] COND TRUE ((int)id2) >= 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L84] COND TRUE ((int)st2) == 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L86] COND TRUE ((int)send2) == ((int)id2) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L88] COND TRUE ((int)mode2) == 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L90] COND TRUE ((int)id3) >= 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L92] COND TRUE ((int)st3) == 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L94] COND TRUE ((int)send3) == ((int)id3) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L96] COND TRUE ((int)mode3) == 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L98] COND TRUE ((int)id1) != ((int)id2) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L100] COND TRUE ((int)id1) != ((int)id3) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=0, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE ((int)id2) != ((int)id3) [L104] init__tmp = 1 [L105] __return_5979 = init__tmp [L106] main__i2 = __return_5979 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L107] COND TRUE main__i2 != 0 [L109] p1_old = nomsg [L110] p1_new = nomsg [L111] p2_old = nomsg [L112] p2_new = nomsg [L113] p3_old = nomsg [L114] p3_new = nomsg [L115] main__i2 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L118] msg_t node1__m1; [L119] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L433] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L444] mode1 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L141] msg_t node2__m2; [L142] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L342] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L370] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L353] mode2 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L161] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L256] COND TRUE !(alive3 == 0) [L258] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L259] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L261] COND TRUE p3_new == nomsg [L263] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L265] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L267] mode3 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L176] p1_old = p1_new [L177] p1_new = nomsg [L178] p2_old = p2_new [L179] p2_new = nomsg [L180] p3_old = p3_new [L181] p3_new = nomsg [L183] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L184] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L191] __return_6075 = check__tmp [L192] main__c1 = __return_6075 [L194] _Bool __tmp_1; [L195] __tmp_1 = main__c1 [L196] _Bool assert__arg; [L197] assert__arg = __tmp_1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L198] COND FALSE !(assert__arg == 0) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L118] msg_t node1__m1; [L119] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L120] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L122] COND FALSE !(r1 == 255) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L126] r1 = r1 + 1 [L127] node1__m1 = p3_old [L128] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L129] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L131] COND FALSE !(!(alive1 == 0)) [L417] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L138] mode1 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L141] msg_t node2__m2; [L142] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L143] COND TRUE !(mode2 == 0) [L145] node2__m2 = p1_old [L146] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L147] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L156] mode2 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L165] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L174] mode3 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L176] p1_old = p1_new [L177] p1_new = nomsg [L178] p2_old = p2_new [L179] p2_new = nomsg [L180] p3_old = p3_new [L181] p3_new = nomsg [L183] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L184] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L191] __return_6075 = check__tmp [L192] main__c1 = __return_6075 [L194] _Bool __tmp_1; [L195] __tmp_1 = main__c1 [L196] _Bool assert__arg; [L197] assert__arg = __tmp_1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L198] COND FALSE !(assert__arg == 0) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L118] msg_t node1__m1; [L119] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L433] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L444] mode1 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L141] msg_t node2__m2; [L142] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L342] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L370] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L353] mode2 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L161] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L256] COND TRUE !(alive3 == 0) [L258] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L259] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L261] COND TRUE p3_new == nomsg [L263] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L265] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L267] mode3 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L176] p1_old = p1_new [L177] p1_new = nomsg [L178] p2_old = p2_new [L179] p2_new = nomsg [L180] p3_old = p3_new [L181] p3_new = nomsg [L183] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L184] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L191] __return_6075 = check__tmp [L192] main__c1 = __return_6075 [L194] _Bool __tmp_1; [L195] __tmp_1 = main__c1 [L196] _Bool assert__arg; [L197] assert__arg = __tmp_1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L198] COND FALSE !(assert__arg == 0) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L118] msg_t node1__m1; [L119] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L120] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L122] COND FALSE !(r1 == 255) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L126] r1 = r1 + 1 [L127] node1__m1 = p3_old [L128] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L129] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L131] COND FALSE !(!(alive1 == 0)) [L417] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L138] mode1 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L141] msg_t node2__m2; [L142] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L143] COND TRUE !(mode2 == 0) [L145] node2__m2 = p1_old [L146] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L147] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L156] mode2 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L165] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L174] mode3 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L176] p1_old = p1_new [L177] p1_new = nomsg [L178] p2_old = p2_new [L179] p2_new = nomsg [L180] p3_old = p3_new [L181] p3_new = nomsg [L183] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L184] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L191] __return_6075 = check__tmp [L192] main__c1 = __return_6075 [L194] _Bool __tmp_1; [L195] __tmp_1 = main__c1 [L196] _Bool assert__arg; [L197] assert__arg = __tmp_1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L198] COND FALSE !(assert__arg == 0) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L118] msg_t node1__m1; [L119] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L433] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L444] mode1 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L141] msg_t node2__m2; [L142] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L342] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L370] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L353] mode2 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L161] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L256] COND TRUE !(alive3 == 0) [L258] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L259] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L261] COND TRUE p3_new == nomsg [L263] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L265] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L267] mode3 = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L176] p1_old = p1_new [L177] p1_new = nomsg [L178] p2_old = p2_new [L179] p2_new = nomsg [L180] p3_old = p3_new [L181] p3_new = nomsg [L183] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L184] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L191] __return_6075 = check__tmp [L192] main__c1 = __return_6075 [L194] _Bool __tmp_1; [L195] __tmp_1 = main__c1 [L196] _Bool assert__arg; [L197] assert__arg = __tmp_1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L198] COND FALSE !(assert__arg == 0) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L118] msg_t node1__m1; [L119] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L120] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L122] COND FALSE !(r1 == 255) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L126] r1 = r1 + 1 [L127] node1__m1 = p3_old [L128] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L129] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L131] COND FALSE !(!(alive1 == 0)) [L417] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L138] mode1 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L141] msg_t node2__m2; [L142] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L143] COND TRUE !(mode2 == 0) [L145] node2__m2 = p1_old [L146] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L147] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=1, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L156] mode2 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L165] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=1, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L174] mode3 = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L176] p1_old = p1_new [L177] p1_new = nomsg [L178] p2_old = p2_new [L179] p2_new = nomsg [L180] p3_old = p3_new [L181] p3_new = nomsg [L183] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L184] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L186] COND FALSE !(((int)r1) < 3) VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L211] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L218] check__tmp = 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=1, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=0, id1=0, id2=3, id3=127, init__tmp=1, main__c1=1, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L191] __return_6075 = check__tmp [L192] main__c1 = __return_6075 [L194] _Bool __tmp_1; [L195] __tmp_1 = main__c1 [L196] _Bool assert__arg; [L197] assert__arg = __tmp_1 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, __tmp_1=0, alive1=0, alive2=0, alive3=1, assert__arg=0, check__tmp=0, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L198] COND TRUE assert__arg == 0 VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, __tmp_1=0, alive1=0, alive2=0, alive3=1, assert__arg=0, check__tmp=0, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L200] __VERIFIER_error() VAL [\old(__return_5979)=0, \old(__return_6075)=0, \old(alive1)=0, \old(alive2)=0, \old(alive3)=0, \old(id1)=0, \old(id2)=0, \old(id3)=0, \old(mode1)=0, \old(mode2)=0, \old(mode3)=0, \old(p1_new)=0, \old(p1_old)=0, \old(p2_new)=0, \old(p2_old)=0, \old(p3_new)=0, \old(p3_old)=0, \old(r1)=0, \old(send1)=0, \old(send2)=0, \old(send3)=0, \old(st1)=0, \old(st2)=0, \old(st3)=0, __return_5979=1, __return_6075=0, __return_main=0, __tmp_1=0, alive1=0, alive2=0, alive3=1, assert__arg=0, check__tmp=0, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 1 error locations. UNSAFE Result, 688.1s OverallTime, 46 OverallIterations, 6 TraceHistogramMax, 581.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9804 SDtfs, 72632 SDslu, 90466 SDs, 0 SdLazy, 57946 SolverSat, 5138 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 95.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6894 GetRequests, 3260 SyntacticMatches, 141 SemanticMatches, 3493 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511782 ImplicationChecksByTransitivity, 414.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221680occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.3s AbstIntTime, 19 AbstIntIterations, 5 AbstIntStrong, 0.9836392440982037 AbsIntWeakeningRatio, 1.4166666666666667 AbsIntAvgWeakeningVarsNumRemoved, 36.970238095238095 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 49.8s AutomataMinimizationTime, 45 MinimizatonAttempts, 1296955 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 5740 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 7247 ConstructedInterpolants, 774 QuantifiedInterpolants, 11933291 SizeOfPredicates, 142 NumberOfNonLiveVariables, 9620 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 77 InterpolantComputations, 24 PerfectInterpolantSequences, 2226/4049 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...