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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:41:16,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:41:16,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:41:16,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:41:16,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:41:16,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:41:16,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:41:16,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:41:16,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:41:16,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:41:16,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:41:16,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:41:16,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:41:16,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:41:16,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:41:16,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:41:16,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:41:16,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:41:16,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:41:16,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:41:16,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:41:16,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:41:16,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:41:16,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:41:16,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:41:16,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:41:16,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:41:16,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:41:16,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:41:16,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:41:16,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:41:16,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:41:16,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:41:16,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:41:16,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:41:16,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:41:16,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:41:16,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:41:16,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:41:16,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:41:16,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:41:16,317 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:41:16,334 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:41:16,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:41:16,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:41:16,335 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:41:16,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:41:16,336 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:41:16,336 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:41:16,337 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:41:16,337 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:41:16,337 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:41:16,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:41:16,338 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:41:16,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:41:16,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:41:16,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:41:16,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:41:16,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:41:16,339 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:41:16,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:41:16,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:41:16,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:41:16,340 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:41:16,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:41:16,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:41:16,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:41:16,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:41:16,341 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:41:16,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:41:16,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:41:16,341 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:41:16,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:41:16,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:41:16,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:41:16,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:41:16,404 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:41:16,404 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+nlh-reducer.c [2019-09-10 06:41:16,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6215a619a/a185149824f941d2b2b81a1657cae6f8/FLAGbc6581393 [2019-09-10 06:41:16,968 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:41:16,968 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+nlh-reducer.c [2019-09-10 06:41:16,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6215a619a/a185149824f941d2b2b81a1657cae6f8/FLAGbc6581393 [2019-09-10 06:41:17,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6215a619a/a185149824f941d2b2b81a1657cae6f8 [2019-09-10 06:41:17,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:41:17,293 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:41:17,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:41:17,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:41:17,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:41:17,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5edfb8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17, skipping insertion in model container [2019-09-10 06:41:17,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,310 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:41:17,380 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:41:17,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:41:17,807 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:41:17,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:41:17,905 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:41:17,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17 WrapperNode [2019-09-10 06:41:17,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:41:17,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:41:17,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:41:17,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:41:17,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (1/1) ... [2019-09-10 06:41:17,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:41:17,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:41:17,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:41:17,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:41:17,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (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:41:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:41:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:41:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:41:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:41:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:41:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:41:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:41:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:41:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:41:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:41:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:41:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:41:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:41:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:41:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:41:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:41:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:41:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:41:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:41:18,845 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:41:18,845 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:41:18,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:41:18 BoogieIcfgContainer [2019-09-10 06:41:18,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:41:18,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:41:18,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:41:18,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:41:18,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:41:17" (1/3) ... [2019-09-10 06:41:18,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462fa11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:41:18, skipping insertion in model container [2019-09-10 06:41:18,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:41:17" (2/3) ... [2019-09-10 06:41:18,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462fa11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:41:18, skipping insertion in model container [2019-09-10 06:41:18,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:41:18" (3/3) ... [2019-09-10 06:41:18,859 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:41:18,872 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:41:18,894 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:41:18,911 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:41:18,939 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:41:18,939 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:41:18,939 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:41:18,939 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:41:18,940 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:41:18,940 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:41:18,940 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:41:18,940 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:41:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-09-10 06:41:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 06:41:18,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:18,973 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, 1, 1, 1, 1, 1] [2019-09-10 06:41:18,975 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash -276696918, now seen corresponding path program 1 times [2019-09-10 06:41:18,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:19,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:19,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:19,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:19,457 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:41:19,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:19,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:41:19,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:19,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:41:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:41:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:41:19,485 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 6 states. [2019-09-10 06:41:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:19,875 INFO L93 Difference]: Finished difference Result 658 states and 1025 transitions. [2019-09-10 06:41:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:41:19,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-09-10 06:41:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:19,905 INFO L225 Difference]: With dead ends: 658 [2019-09-10 06:41:19,906 INFO L226 Difference]: Without dead ends: 630 [2019-09-10 06:41:19,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:41:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-10 06:41:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 423. [2019-09-10 06:41:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-10 06:41:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2019-09-10 06:41:19,998 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 52 [2019-09-10 06:41:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:19,999 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2019-09-10 06:41:19,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:41:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2019-09-10 06:41:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:41:20,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:20,002 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:20,002 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1087729035, now seen corresponding path program 1 times [2019-09-10 06:41:20,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:20,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:20,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:20,130 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:41:20,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:20,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:20,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:20,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:20,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:20,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:20,133 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 3 states. [2019-09-10 06:41:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:20,169 INFO L93 Difference]: Finished difference Result 748 states and 1139 transitions. [2019-09-10 06:41:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:20,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:41:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:20,175 INFO L225 Difference]: With dead ends: 748 [2019-09-10 06:41:20,175 INFO L226 Difference]: Without dead ends: 748 [2019-09-10 06:41:20,176 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:41:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-10 06:41:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-09-10 06:41:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-10 06:41:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1138 transitions. [2019-09-10 06:41:20,224 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1138 transitions. Word has length 55 [2019-09-10 06:41:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:20,225 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1138 transitions. [2019-09-10 06:41:20,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1138 transitions. [2019-09-10 06:41:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:41:20,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:20,237 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:20,237 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash 917757431, now seen corresponding path program 1 times [2019-09-10 06:41:20,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:20,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:20,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:20,353 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:41:20,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:20,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:20,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:20,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:20,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:20,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:20,355 INFO L87 Difference]: Start difference. First operand 746 states and 1138 transitions. Second operand 3 states. [2019-09-10 06:41:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:20,398 INFO L93 Difference]: Finished difference Result 1335 states and 2002 transitions. [2019-09-10 06:41:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:20,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:41:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:20,406 INFO L225 Difference]: With dead ends: 1335 [2019-09-10 06:41:20,406 INFO L226 Difference]: Without dead ends: 1335 [2019-09-10 06:41:20,407 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:41:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-10 06:41:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-09-10 06:41:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-10 06:41:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2001 transitions. [2019-09-10 06:41:20,445 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2001 transitions. Word has length 55 [2019-09-10 06:41:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:20,445 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 2001 transitions. [2019-09-10 06:41:20,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2001 transitions. [2019-09-10 06:41:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:41:20,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:20,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:20,447 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash -41555275, now seen corresponding path program 1 times [2019-09-10 06:41:20,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:20,555 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:41:20,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:20,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:41:20,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:20,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:41:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:41:20,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:41:20,557 INFO L87 Difference]: Start difference. First operand 1333 states and 2001 transitions. Second operand 6 states. [2019-09-10 06:41:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:20,859 INFO L93 Difference]: Finished difference Result 2913 states and 4369 transitions. [2019-09-10 06:41:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:20,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:41:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:20,874 INFO L225 Difference]: With dead ends: 2913 [2019-09-10 06:41:20,875 INFO L226 Difference]: Without dead ends: 2913 [2019-09-10 06:41:20,875 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:41:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-09-10 06:41:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2889. [2019-09-10 06:41:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2019-09-10 06:41:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4347 transitions. [2019-09-10 06:41:20,949 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4347 transitions. Word has length 56 [2019-09-10 06:41:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:20,950 INFO L475 AbstractCegarLoop]: Abstraction has 2889 states and 4347 transitions. [2019-09-10 06:41:20,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:41:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4347 transitions. [2019-09-10 06:41:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:41:20,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:20,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:20,953 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash -742667424, now seen corresponding path program 1 times [2019-09-10 06:41:20,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:20,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:21,122 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:41:21,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:21,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:41:21,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:21,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:41:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:41:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:41:21,125 INFO L87 Difference]: Start difference. First operand 2889 states and 4347 transitions. Second operand 7 states. [2019-09-10 06:41:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:21,760 INFO L93 Difference]: Finished difference Result 11884 states and 18058 transitions. [2019-09-10 06:41:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:41:21,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-10 06:41:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:21,823 INFO L225 Difference]: With dead ends: 11884 [2019-09-10 06:41:21,824 INFO L226 Difference]: Without dead ends: 11884 [2019-09-10 06:41:21,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:41:21,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2019-09-10 06:41:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 2895. [2019-09-10 06:41:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-09-10 06:41:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4355 transitions. [2019-09-10 06:41:22,050 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4355 transitions. Word has length 57 [2019-09-10 06:41:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:22,053 INFO L475 AbstractCegarLoop]: Abstraction has 2895 states and 4355 transitions. [2019-09-10 06:41:22,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:41:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4355 transitions. [2019-09-10 06:41:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:41:22,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:22,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:22,056 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1896016447, now seen corresponding path program 1 times [2019-09-10 06:41:22,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:22,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:22,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:22,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:22,175 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:41:22,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:22,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:41:22,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:22,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:41:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:41:22,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:41:22,177 INFO L87 Difference]: Start difference. First operand 2895 states and 4355 transitions. Second operand 5 states. [2019-09-10 06:41:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:22,404 INFO L93 Difference]: Finished difference Result 4085 states and 6074 transitions. [2019-09-10 06:41:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:22,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-10 06:41:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:22,423 INFO L225 Difference]: With dead ends: 4085 [2019-09-10 06:41:22,424 INFO L226 Difference]: Without dead ends: 4085 [2019-09-10 06:41:22,424 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:41:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-09-10 06:41:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 2895. [2019-09-10 06:41:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-09-10 06:41:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4317 transitions. [2019-09-10 06:41:22,534 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4317 transitions. Word has length 57 [2019-09-10 06:41:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:22,534 INFO L475 AbstractCegarLoop]: Abstraction has 2895 states and 4317 transitions. [2019-09-10 06:41:22,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:41:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4317 transitions. [2019-09-10 06:41:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:41:22,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:22,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:22,539 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:22,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1439125625, now seen corresponding path program 1 times [2019-09-10 06:41:22,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:22,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:22,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:22,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:22,639 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:41:22,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:22,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:41:22,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:22,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:41:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:41:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:41:22,641 INFO L87 Difference]: Start difference. First operand 2895 states and 4317 transitions. Second operand 7 states. [2019-09-10 06:41:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:23,147 INFO L93 Difference]: Finished difference Result 10257 states and 15170 transitions. [2019-09-10 06:41:23,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:41:23,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:41:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:23,193 INFO L225 Difference]: With dead ends: 10257 [2019-09-10 06:41:23,193 INFO L226 Difference]: Without dead ends: 10257 [2019-09-10 06:41:23,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:41:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10257 states. [2019-09-10 06:41:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10257 to 2915. [2019-09-10 06:41:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2019-09-10 06:41:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4341 transitions. [2019-09-10 06:41:23,312 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4341 transitions. Word has length 58 [2019-09-10 06:41:23,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:23,313 INFO L475 AbstractCegarLoop]: Abstraction has 2915 states and 4341 transitions. [2019-09-10 06:41:23,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:41:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4341 transitions. [2019-09-10 06:41:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:41:23,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:23,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:23,315 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1177047496, now seen corresponding path program 1 times [2019-09-10 06:41:23,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:23,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:23,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:23,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:23,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:23,396 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:41:23,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:23,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:41:23,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:23,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:41:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:41:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:41:23,399 INFO L87 Difference]: Start difference. First operand 2915 states and 4341 transitions. Second operand 6 states. [2019-09-10 06:41:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:23,681 INFO L93 Difference]: Finished difference Result 7637 states and 11261 transitions. [2019-09-10 06:41:23,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:23,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-10 06:41:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:23,697 INFO L225 Difference]: With dead ends: 7637 [2019-09-10 06:41:23,697 INFO L226 Difference]: Without dead ends: 7637 [2019-09-10 06:41:23,698 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:41:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7637 states. [2019-09-10 06:41:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7637 to 7633. [2019-09-10 06:41:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-09-10 06:41:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11259 transitions. [2019-09-10 06:41:23,816 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11259 transitions. Word has length 59 [2019-09-10 06:41:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:23,816 INFO L475 AbstractCegarLoop]: Abstraction has 7633 states and 11259 transitions. [2019-09-10 06:41:23,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:41:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11259 transitions. [2019-09-10 06:41:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:41:23,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:23,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:23,819 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 758768658, now seen corresponding path program 1 times [2019-09-10 06:41:23,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:23,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:23,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:23,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:23,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:23,887 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:41:23,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:23,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:41:23,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:23,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:41:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:41:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:41:23,889 INFO L87 Difference]: Start difference. First operand 7633 states and 11259 transitions. Second operand 5 states. [2019-09-10 06:41:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:24,032 INFO L93 Difference]: Finished difference Result 16178 states and 23931 transitions. [2019-09-10 06:41:24,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:24,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-10 06:41:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:24,067 INFO L225 Difference]: With dead ends: 16178 [2019-09-10 06:41:24,068 INFO L226 Difference]: Without dead ends: 16178 [2019-09-10 06:41:24,068 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:41:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16178 states. [2019-09-10 06:41:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16178 to 9877. [2019-09-10 06:41:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-09-10 06:41:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 14629 transitions. [2019-09-10 06:41:24,364 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 14629 transitions. Word has length 60 [2019-09-10 06:41:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:24,364 INFO L475 AbstractCegarLoop]: Abstraction has 9877 states and 14629 transitions. [2019-09-10 06:41:24,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:41:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 14629 transitions. [2019-09-10 06:41:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:41:24,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:24,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:24,368 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2035448048, now seen corresponding path program 1 times [2019-09-10 06:41:24,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:24,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:24,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:24,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:24,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:24,472 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:41:24,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:24,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:41:24,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:24,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:41:24,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:41:24,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:41:24,477 INFO L87 Difference]: Start difference. First operand 9877 states and 14629 transitions. Second operand 5 states. [2019-09-10 06:41:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:24,632 INFO L93 Difference]: Finished difference Result 17435 states and 25841 transitions. [2019-09-10 06:41:24,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:24,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-10 06:41:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:24,679 INFO L225 Difference]: With dead ends: 17435 [2019-09-10 06:41:24,680 INFO L226 Difference]: Without dead ends: 17435 [2019-09-10 06:41:24,680 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:41:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17435 states. [2019-09-10 06:41:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17435 to 11320. [2019-09-10 06:41:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11320 states. [2019-09-10 06:41:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11320 states to 11320 states and 16793 transitions. [2019-09-10 06:41:24,884 INFO L78 Accepts]: Start accepts. Automaton has 11320 states and 16793 transitions. Word has length 60 [2019-09-10 06:41:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:24,885 INFO L475 AbstractCegarLoop]: Abstraction has 11320 states and 16793 transitions. [2019-09-10 06:41:24,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:41:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 11320 states and 16793 transitions. [2019-09-10 06:41:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:41:24,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:24,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:24,889 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2033763663, now seen corresponding path program 1 times [2019-09-10 06:41:24,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:24,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:24,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:24,967 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:41:24,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:24,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:41:24,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:24,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:41:24,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:41:24,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:41:24,969 INFO L87 Difference]: Start difference. First operand 11320 states and 16793 transitions. Second operand 7 states. [2019-09-10 06:41:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:25,761 INFO L93 Difference]: Finished difference Result 48732 states and 71649 transitions. [2019-09-10 06:41:25,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:41:25,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-10 06:41:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:25,843 INFO L225 Difference]: With dead ends: 48732 [2019-09-10 06:41:25,844 INFO L226 Difference]: Without dead ends: 48732 [2019-09-10 06:41:25,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:41:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48732 states. [2019-09-10 06:41:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48732 to 11416. [2019-09-10 06:41:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-09-10 06:41:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 16915 transitions. [2019-09-10 06:41:26,975 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 16915 transitions. Word has length 63 [2019-09-10 06:41:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:26,975 INFO L475 AbstractCegarLoop]: Abstraction has 11416 states and 16915 transitions. [2019-09-10 06:41:26,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:41:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 16915 transitions. [2019-09-10 06:41:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:41:26,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:26,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:26,980 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash -640902223, now seen corresponding path program 1 times [2019-09-10 06:41:26,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:26,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:26,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:26,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:26,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:27,037 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:41:27,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:27,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:27,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:27,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:27,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:27,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:27,039 INFO L87 Difference]: Start difference. First operand 11416 states and 16915 transitions. Second operand 3 states. [2019-09-10 06:41:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:27,125 INFO L93 Difference]: Finished difference Result 16920 states and 24533 transitions. [2019-09-10 06:41:27,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:27,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:41:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:27,158 INFO L225 Difference]: With dead ends: 16920 [2019-09-10 06:41:27,158 INFO L226 Difference]: Without dead ends: 16920 [2019-09-10 06:41:27,158 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:41:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16920 states. [2019-09-10 06:41:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16920 to 13802. [2019-09-10 06:41:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2019-09-10 06:41:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 20148 transitions. [2019-09-10 06:41:27,358 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 20148 transitions. Word has length 63 [2019-09-10 06:41:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:27,359 INFO L475 AbstractCegarLoop]: Abstraction has 13802 states and 20148 transitions. [2019-09-10 06:41:27,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 20148 transitions. [2019-09-10 06:41:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:41:27,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:27,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:27,366 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:27,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash 3874310, now seen corresponding path program 1 times [2019-09-10 06:41:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:27,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:27,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:27,608 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:41:27,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:27,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:41:27,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:27,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:41:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:41:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:41:27,609 INFO L87 Difference]: Start difference. First operand 13802 states and 20148 transitions. Second operand 10 states. [2019-09-10 06:41:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:29,897 INFO L93 Difference]: Finished difference Result 60047 states and 87110 transitions. [2019-09-10 06:41:29,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:41:29,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:41:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:29,999 INFO L225 Difference]: With dead ends: 60047 [2019-09-10 06:41:30,000 INFO L226 Difference]: Without dead ends: 60047 [2019-09-10 06:41:30,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:41:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60047 states. [2019-09-10 06:41:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60047 to 13802. [2019-09-10 06:41:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2019-09-10 06:41:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 20142 transitions. [2019-09-10 06:41:30,519 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 20142 transitions. Word has length 65 [2019-09-10 06:41:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:30,519 INFO L475 AbstractCegarLoop]: Abstraction has 13802 states and 20142 transitions. [2019-09-10 06:41:30,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:41:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 20142 transitions. [2019-09-10 06:41:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:41:30,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:30,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:30,524 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1838871740, now seen corresponding path program 1 times [2019-09-10 06:41:30,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:30,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:30,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:30,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:30,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:30,694 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:41:30,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:30,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:41:30,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:30,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:41:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:41:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:41:30,696 INFO L87 Difference]: Start difference. First operand 13802 states and 20142 transitions. Second operand 10 states. [2019-09-10 06:41:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:32,217 INFO L93 Difference]: Finished difference Result 37871 states and 54803 transitions. [2019-09-10 06:41:32,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:41:32,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:41:32,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:32,277 INFO L225 Difference]: With dead ends: 37871 [2019-09-10 06:41:32,277 INFO L226 Difference]: Without dead ends: 37871 [2019-09-10 06:41:32,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:41:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37871 states. [2019-09-10 06:41:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37871 to 13590. [2019-09-10 06:41:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13590 states. [2019-09-10 06:41:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13590 states to 13590 states and 19823 transitions. [2019-09-10 06:41:32,704 INFO L78 Accepts]: Start accepts. Automaton has 13590 states and 19823 transitions. Word has length 65 [2019-09-10 06:41:32,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:32,704 INFO L475 AbstractCegarLoop]: Abstraction has 13590 states and 19823 transitions. [2019-09-10 06:41:32,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:41:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 13590 states and 19823 transitions. [2019-09-10 06:41:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:41:32,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:32,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:32,707 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:32,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 434457602, now seen corresponding path program 1 times [2019-09-10 06:41:32,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:32,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:32,874 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:41:32,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:32,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:41:32,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:32,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:41:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:41:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:41:32,876 INFO L87 Difference]: Start difference. First operand 13590 states and 19823 transitions. Second operand 10 states. [2019-09-10 06:41:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:35,243 INFO L93 Difference]: Finished difference Result 59406 states and 86184 transitions. [2019-09-10 06:41:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:41:35,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:41:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:35,355 INFO L225 Difference]: With dead ends: 59406 [2019-09-10 06:41:35,355 INFO L226 Difference]: Without dead ends: 59406 [2019-09-10 06:41:35,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:41:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59406 states. [2019-09-10 06:41:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59406 to 13459. [2019-09-10 06:41:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13459 states. [2019-09-10 06:41:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 19616 transitions. [2019-09-10 06:41:35,805 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 19616 transitions. Word has length 65 [2019-09-10 06:41:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:35,805 INFO L475 AbstractCegarLoop]: Abstraction has 13459 states and 19616 transitions. [2019-09-10 06:41:35,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:41:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 19616 transitions. [2019-09-10 06:41:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:41:35,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:35,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:35,810 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash 451101849, now seen corresponding path program 1 times [2019-09-10 06:41:35,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:35,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:35,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:35,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:35,858 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:41:35,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:35,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:35,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:35,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:35,861 INFO L87 Difference]: Start difference. First operand 13459 states and 19616 transitions. Second operand 3 states. [2019-09-10 06:41:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:35,908 INFO L93 Difference]: Finished difference Result 13443 states and 19291 transitions. [2019-09-10 06:41:35,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:35,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:41:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:35,931 INFO L225 Difference]: With dead ends: 13443 [2019-09-10 06:41:35,931 INFO L226 Difference]: Without dead ends: 13443 [2019-09-10 06:41:35,931 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:41:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13443 states. [2019-09-10 06:41:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13443 to 13441. [2019-09-10 06:41:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13441 states. [2019-09-10 06:41:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13441 states to 13441 states and 19290 transitions. [2019-09-10 06:41:36,074 INFO L78 Accepts]: Start accepts. Automaton has 13441 states and 19290 transitions. Word has length 66 [2019-09-10 06:41:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:36,075 INFO L475 AbstractCegarLoop]: Abstraction has 13441 states and 19290 transitions. [2019-09-10 06:41:36,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13441 states and 19290 transitions. [2019-09-10 06:41:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:41:36,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:36,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:36,079 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1791143987, now seen corresponding path program 1 times [2019-09-10 06:41:36,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:36,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:36,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:36,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:36,122 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:41:36,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:36,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:36,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:36,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:36,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:36,124 INFO L87 Difference]: Start difference. First operand 13441 states and 19290 transitions. Second operand 3 states. [2019-09-10 06:41:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:36,166 INFO L93 Difference]: Finished difference Result 12081 states and 17024 transitions. [2019-09-10 06:41:36,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:36,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:41:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:36,185 INFO L225 Difference]: With dead ends: 12081 [2019-09-10 06:41:36,186 INFO L226 Difference]: Without dead ends: 12081 [2019-09-10 06:41:36,187 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:41:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12081 states. [2019-09-10 06:41:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12081 to 12079. [2019-09-10 06:41:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12079 states. [2019-09-10 06:41:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12079 states to 12079 states and 17023 transitions. [2019-09-10 06:41:36,515 INFO L78 Accepts]: Start accepts. Automaton has 12079 states and 17023 transitions. Word has length 66 [2019-09-10 06:41:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:36,515 INFO L475 AbstractCegarLoop]: Abstraction has 12079 states and 17023 transitions. [2019-09-10 06:41:36,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 12079 states and 17023 transitions. [2019-09-10 06:41:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:41:36,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:36,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:36,522 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1997471743, now seen corresponding path program 1 times [2019-09-10 06:41:36,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:36,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:36,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:36,568 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:41:36,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:36,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:36,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:36,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:36,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:36,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:36,570 INFO L87 Difference]: Start difference. First operand 12079 states and 17023 transitions. Second operand 3 states. [2019-09-10 06:41:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:36,616 INFO L93 Difference]: Finished difference Result 10303 states and 14212 transitions. [2019-09-10 06:41:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:36,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:41:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:36,629 INFO L225 Difference]: With dead ends: 10303 [2019-09-10 06:41:36,630 INFO L226 Difference]: Without dead ends: 10303 [2019-09-10 06:41:36,630 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:41:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2019-09-10 06:41:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 10301. [2019-09-10 06:41:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-09-10 06:41:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 14211 transitions. [2019-09-10 06:41:36,752 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 14211 transitions. Word has length 66 [2019-09-10 06:41:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:36,752 INFO L475 AbstractCegarLoop]: Abstraction has 10301 states and 14211 transitions. [2019-09-10 06:41:36,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 14211 transitions. [2019-09-10 06:41:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:41:36,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:36,756 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, 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:36,756 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:36,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1675019531, now seen corresponding path program 1 times [2019-09-10 06:41:36,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:36,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:36,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:36,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:36,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:36,790 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:41:36,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:36,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:36,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:36,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:36,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:36,792 INFO L87 Difference]: Start difference. First operand 10301 states and 14211 transitions. Second operand 3 states. [2019-09-10 06:41:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:36,864 INFO L93 Difference]: Finished difference Result 15154 states and 20941 transitions. [2019-09-10 06:41:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:36,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:41:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:36,890 INFO L225 Difference]: With dead ends: 15154 [2019-09-10 06:41:36,890 INFO L226 Difference]: Without dead ends: 15154 [2019-09-10 06:41:36,891 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:41:36,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15154 states. [2019-09-10 06:41:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15154 to 10108. [2019-09-10 06:41:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10108 states. [2019-09-10 06:41:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 13933 transitions. [2019-09-10 06:41:37,019 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 13933 transitions. Word has length 67 [2019-09-10 06:41:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:37,020 INFO L475 AbstractCegarLoop]: Abstraction has 10108 states and 13933 transitions. [2019-09-10 06:41:37,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 13933 transitions. [2019-09-10 06:41:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:41:37,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:37,022 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, 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,023 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:37,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash 641499340, now seen corresponding path program 1 times [2019-09-10 06:41:37,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:37,056 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:41:37,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:37,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:37,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:37,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:37,058 INFO L87 Difference]: Start difference. First operand 10108 states and 13933 transitions. Second operand 3 states. [2019-09-10 06:41:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:37,134 INFO L93 Difference]: Finished difference Result 15010 states and 20708 transitions. [2019-09-10 06:41:37,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:37,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:41:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:37,161 INFO L225 Difference]: With dead ends: 15010 [2019-09-10 06:41:37,161 INFO L226 Difference]: Without dead ends: 15010 [2019-09-10 06:41:37,161 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:41:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15010 states. [2019-09-10 06:41:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15010 to 9964. [2019-09-10 06:41:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9964 states. [2019-09-10 06:41:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9964 states to 9964 states and 13716 transitions. [2019-09-10 06:41:37,298 INFO L78 Accepts]: Start accepts. Automaton has 9964 states and 13716 transitions. Word has length 67 [2019-09-10 06:41:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:37,298 INFO L475 AbstractCegarLoop]: Abstraction has 9964 states and 13716 transitions. [2019-09-10 06:41:37,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9964 states and 13716 transitions. [2019-09-10 06:41:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:41:37,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:37,302 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, 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,303 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1770759349, now seen corresponding path program 1 times [2019-09-10 06:41:37,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:37,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:38,504 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:41:38,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:38,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:41:38,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:38,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:41:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:41:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:41:38,505 INFO L87 Difference]: Start difference. First operand 9964 states and 13716 transitions. Second operand 19 states. [2019-09-10 06:41:38,855 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 06:41:39,216 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:41:39,714 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:41:39,972 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:41:40,369 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 06:41:40,732 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-09-10 06:41:40,959 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:41:41,209 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:41:41,576 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:41:41,746 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:41:41,933 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:41:42,223 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 06:41:42,412 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:41:42,632 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 06:41:42,798 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:41:43,053 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:41:43,312 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:41:45,650 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:41:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:46,144 INFO L93 Difference]: Finished difference Result 40242 states and 55786 transitions. [2019-09-10 06:41:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:41:46,145 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-09-10 06:41:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:46,186 INFO L225 Difference]: With dead ends: 40242 [2019-09-10 06:41:46,186 INFO L226 Difference]: Without dead ends: 40242 [2019-09-10 06:41:46,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:41:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40242 states. [2019-09-10 06:41:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40242 to 9970. [2019-09-10 06:41:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9970 states. [2019-09-10 06:41:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9970 states to 9970 states and 13717 transitions. [2019-09-10 06:41:46,414 INFO L78 Accepts]: Start accepts. Automaton has 9970 states and 13717 transitions. Word has length 67 [2019-09-10 06:41:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:46,414 INFO L475 AbstractCegarLoop]: Abstraction has 9970 states and 13717 transitions. [2019-09-10 06:41:46,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:41:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9970 states and 13717 transitions. [2019-09-10 06:41:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:41:46,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:46,417 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, 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:46,417 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1042489363, now seen corresponding path program 1 times [2019-09-10 06:41:46,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:46,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:46,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:47,375 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:41:47,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:47,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:41:47,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:47,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:41:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:41:47,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:41:47,377 INFO L87 Difference]: Start difference. First operand 9970 states and 13717 transitions. Second operand 19 states. [2019-09-10 06:41:47,981 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 06:41:48,217 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:41:48,575 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-10 06:41:48,976 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 06:41:49,179 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:41:49,445 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 06:41:49,882 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:41:50,063 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:41:50,301 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:41:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:51,547 INFO L93 Difference]: Finished difference Result 18746 states and 25892 transitions. [2019-09-10 06:41:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:41:51,549 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-09-10 06:41:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:51,566 INFO L225 Difference]: With dead ends: 18746 [2019-09-10 06:41:51,566 INFO L226 Difference]: Without dead ends: 18746 [2019-09-10 06:41:51,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:41:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18746 states. [2019-09-10 06:41:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18746 to 9927. [2019-09-10 06:41:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-09-10 06:41:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 13657 transitions. [2019-09-10 06:41:51,671 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 13657 transitions. Word has length 67 [2019-09-10 06:41:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:51,671 INFO L475 AbstractCegarLoop]: Abstraction has 9927 states and 13657 transitions. [2019-09-10 06:41:51,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:41:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 13657 transitions. [2019-09-10 06:41:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:41:51,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:51,674 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, 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:51,674 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash -78198627, now seen corresponding path program 1 times [2019-09-10 06:41:51,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:51,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:51,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:51,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:52,162 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:41:52,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:52,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:41:52,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:52,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:41:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:41:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:41:52,164 INFO L87 Difference]: Start difference. First operand 9927 states and 13657 transitions. Second operand 11 states. [2019-09-10 06:41:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:53,114 INFO L93 Difference]: Finished difference Result 21197 states and 29281 transitions. [2019-09-10 06:41:53,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:41:53,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-10 06:41:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:53,133 INFO L225 Difference]: With dead ends: 21197 [2019-09-10 06:41:53,133 INFO L226 Difference]: Without dead ends: 21197 [2019-09-10 06:41:53,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:41:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21197 states. [2019-09-10 06:41:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21197 to 9790. [2019-09-10 06:41:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9790 states. [2019-09-10 06:41:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9790 states to 9790 states and 13476 transitions. [2019-09-10 06:41:53,250 INFO L78 Accepts]: Start accepts. Automaton has 9790 states and 13476 transitions. Word has length 68 [2019-09-10 06:41:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:53,250 INFO L475 AbstractCegarLoop]: Abstraction has 9790 states and 13476 transitions. [2019-09-10 06:41:53,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:41:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 9790 states and 13476 transitions. [2019-09-10 06:41:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:41:53,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:53,252 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, 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:53,253 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:53,253 INFO L82 PathProgramCache]: Analyzing trace with hash 780074214, now seen corresponding path program 1 times [2019-09-10 06:41:53,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:53,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:53,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:53,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:53,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:53,331 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:41:53,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:53,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:41:53,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:53,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:41:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:41:53,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:41:53,335 INFO L87 Difference]: Start difference. First operand 9790 states and 13476 transitions. Second operand 5 states. [2019-09-10 06:41:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:53,433 INFO L93 Difference]: Finished difference Result 9416 states and 12978 transitions. [2019-09-10 06:41:53,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:53,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-10 06:41:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:53,441 INFO L225 Difference]: With dead ends: 9416 [2019-09-10 06:41:53,442 INFO L226 Difference]: Without dead ends: 9416 [2019-09-10 06:41:53,442 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:41:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2019-09-10 06:41:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 9412. [2019-09-10 06:41:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9412 states. [2019-09-10 06:41:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9412 states to 9412 states and 12976 transitions. [2019-09-10 06:41:53,582 INFO L78 Accepts]: Start accepts. Automaton has 9412 states and 12976 transitions. Word has length 69 [2019-09-10 06:41:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:53,583 INFO L475 AbstractCegarLoop]: Abstraction has 9412 states and 12976 transitions. [2019-09-10 06:41:53,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:41:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9412 states and 12976 transitions. [2019-09-10 06:41:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:41:53,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:53,585 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, 1, 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:53,585 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:53,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash 210202670, now seen corresponding path program 1 times [2019-09-10 06:41:53,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:53,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:53,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:53,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:53,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:53,647 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:41:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:41:53,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:53,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:41:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:41:53,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:41:53,648 INFO L87 Difference]: Start difference. First operand 9412 states and 12976 transitions. Second operand 6 states. [2019-09-10 06:41:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:53,748 INFO L93 Difference]: Finished difference Result 17952 states and 24255 transitions. [2019-09-10 06:41:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:41:53,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-10 06:41:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:53,770 INFO L225 Difference]: With dead ends: 17952 [2019-09-10 06:41:53,770 INFO L226 Difference]: Without dead ends: 17952 [2019-09-10 06:41:53,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:41:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2019-09-10 06:41:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 9727. [2019-09-10 06:41:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9727 states. [2019-09-10 06:41:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 13206 transitions. [2019-09-10 06:41:53,954 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 13206 transitions. Word has length 72 [2019-09-10 06:41:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:53,955 INFO L475 AbstractCegarLoop]: Abstraction has 9727 states and 13206 transitions. [2019-09-10 06:41:53,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:41:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 13206 transitions. [2019-09-10 06:41:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:41:53,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:53,959 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, 1, 1, 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:53,959 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash -61361821, now seen corresponding path program 1 times [2019-09-10 06:41:53,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:53,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:53,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:53,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:54,050 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:41:54,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:54,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:54,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:54,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:54,053 INFO L87 Difference]: Start difference. First operand 9727 states and 13206 transitions. Second operand 3 states. [2019-09-10 06:41:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:54,116 INFO L93 Difference]: Finished difference Result 17128 states and 22831 transitions. [2019-09-10 06:41:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:54,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:41:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:54,135 INFO L225 Difference]: With dead ends: 17128 [2019-09-10 06:41:54,135 INFO L226 Difference]: Without dead ends: 17128 [2019-09-10 06:41:54,135 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:41:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2019-09-10 06:41:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 16916. [2019-09-10 06:41:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2019-09-10 06:41:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 22620 transitions. [2019-09-10 06:41:54,310 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 22620 transitions. Word has length 73 [2019-09-10 06:41:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:54,310 INFO L475 AbstractCegarLoop]: Abstraction has 16916 states and 22620 transitions. [2019-09-10 06:41:54,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 22620 transitions. [2019-09-10 06:41:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:41:54,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:54,314 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, 1, 1, 1, 1, 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:54,315 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1062164750, now seen corresponding path program 1 times [2019-09-10 06:41:54,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:54,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:54,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:54,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:54,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:54,369 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:41:54,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:54,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:54,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:54,371 INFO L87 Difference]: Start difference. First operand 16916 states and 22620 transitions. Second operand 3 states. [2019-09-10 06:41:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:54,457 INFO L93 Difference]: Finished difference Result 31580 states and 41511 transitions. [2019-09-10 06:41:54,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:54,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:41:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:54,494 INFO L225 Difference]: With dead ends: 31580 [2019-09-10 06:41:54,495 INFO L226 Difference]: Without dead ends: 31580 [2019-09-10 06:41:54,495 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:41:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31580 states. [2019-09-10 06:41:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31580 to 29294. [2019-09-10 06:41:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29294 states. [2019-09-10 06:41:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29294 states to 29294 states and 38754 transitions. [2019-09-10 06:41:54,781 INFO L78 Accepts]: Start accepts. Automaton has 29294 states and 38754 transitions. Word has length 75 [2019-09-10 06:41:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:54,782 INFO L475 AbstractCegarLoop]: Abstraction has 29294 states and 38754 transitions. [2019-09-10 06:41:54,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 29294 states and 38754 transitions. [2019-09-10 06:41:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:41:54,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:54,785 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, 1, 1, 1, 1, 1, 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:54,785 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:54,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1917451455, now seen corresponding path program 1 times [2019-09-10 06:41:54,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:54,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:54,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:54,822 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:41:54,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:54,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:54,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:54,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:54,824 INFO L87 Difference]: Start difference. First operand 29294 states and 38754 transitions. Second operand 3 states. [2019-09-10 06:41:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:54,956 INFO L93 Difference]: Finished difference Result 45531 states and 59110 transitions. [2019-09-10 06:41:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:54,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:41:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:55,022 INFO L225 Difference]: With dead ends: 45531 [2019-09-10 06:41:55,022 INFO L226 Difference]: Without dead ends: 45531 [2019-09-10 06:41:55,023 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:41:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45531 states. [2019-09-10 06:41:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45531 to 41593. [2019-09-10 06:41:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41593 states. [2019-09-10 06:41:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41593 states to 41593 states and 54589 transitions. [2019-09-10 06:41:55,711 INFO L78 Accepts]: Start accepts. Automaton has 41593 states and 54589 transitions. Word has length 76 [2019-09-10 06:41:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:55,712 INFO L475 AbstractCegarLoop]: Abstraction has 41593 states and 54589 transitions. [2019-09-10 06:41:55,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 41593 states and 54589 transitions. [2019-09-10 06:41:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:41:55,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:55,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,715 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:55,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2051052788, now seen corresponding path program 1 times [2019-09-10 06:41:55,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:55,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:55,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:55,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:55,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:55,764 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:41:55,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:55,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:41:55,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:55,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:41:55,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:41:55,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:41:55,765 INFO L87 Difference]: Start difference. First operand 41593 states and 54589 transitions. Second operand 5 states. [2019-09-10 06:41:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:56,126 INFO L93 Difference]: Finished difference Result 66958 states and 83842 transitions. [2019-09-10 06:41:56,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:41:56,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 06:41:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:56,192 INFO L225 Difference]: With dead ends: 66958 [2019-09-10 06:41:56,192 INFO L226 Difference]: Without dead ends: 66958 [2019-09-10 06:41:56,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:41:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66958 states. [2019-09-10 06:41:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66958 to 38533. [2019-09-10 06:41:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38533 states. [2019-09-10 06:41:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38533 states to 38533 states and 49058 transitions. [2019-09-10 06:41:56,604 INFO L78 Accepts]: Start accepts. Automaton has 38533 states and 49058 transitions. Word has length 82 [2019-09-10 06:41:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:56,604 INFO L475 AbstractCegarLoop]: Abstraction has 38533 states and 49058 transitions. [2019-09-10 06:41:56,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:41:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 38533 states and 49058 transitions. [2019-09-10 06:41:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:41:56,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:56,608 INFO L399 BasicCegarLoop]: trace histogram [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, 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:56,608 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1781698448, now seen corresponding path program 1 times [2019-09-10 06:41:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:56,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:56,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:41:56,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:56,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:41:56,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:56,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:41:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:41:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:41:56,660 INFO L87 Difference]: Start difference. First operand 38533 states and 49058 transitions. Second operand 3 states. [2019-09-10 06:41:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:56,819 INFO L93 Difference]: Finished difference Result 72268 states and 89684 transitions. [2019-09-10 06:41:56,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:41:56,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 06:41:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:56,888 INFO L225 Difference]: With dead ends: 72268 [2019-09-10 06:41:56,888 INFO L226 Difference]: Without dead ends: 72268 [2019-09-10 06:41:56,888 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:41:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72268 states. [2019-09-10 06:41:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72268 to 62526. [2019-09-10 06:41:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62526 states. [2019-09-10 06:41:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62526 states to 62526 states and 78749 transitions. [2019-09-10 06:41:57,714 INFO L78 Accepts]: Start accepts. Automaton has 62526 states and 78749 transitions. Word has length 93 [2019-09-10 06:41:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:57,715 INFO L475 AbstractCegarLoop]: Abstraction has 62526 states and 78749 transitions. [2019-09-10 06:41:57,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:41:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 62526 states and 78749 transitions. [2019-09-10 06:41:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:41:57,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:57,719 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, 1, 1, 1, 1, 1, 1, 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:57,719 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1356554498, now seen corresponding path program 1 times [2019-09-10 06:41:57,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:57,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:57,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:57,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:57,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:57,901 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:41:57,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:57,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:41:57,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:57,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:41:57,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:41:57,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:41:57,903 INFO L87 Difference]: Start difference. First operand 62526 states and 78749 transitions. Second operand 10 states. [2019-09-10 06:41:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:59,860 INFO L93 Difference]: Finished difference Result 217112 states and 271258 transitions. [2019-09-10 06:41:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:41:59,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-09-10 06:41:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:00,170 INFO L225 Difference]: With dead ends: 217112 [2019-09-10 06:42:00,170 INFO L226 Difference]: Without dead ends: 217112 [2019-09-10 06:42:00,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:42:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217112 states. [2019-09-10 06:42:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217112 to 83792. [2019-09-10 06:42:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83792 states. [2019-09-10 06:42:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83792 states to 83792 states and 105525 transitions. [2019-09-10 06:42:03,449 INFO L78 Accepts]: Start accepts. Automaton has 83792 states and 105525 transitions. Word has length 96 [2019-09-10 06:42:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:03,449 INFO L475 AbstractCegarLoop]: Abstraction has 83792 states and 105525 transitions. [2019-09-10 06:42:03,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:42:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 83792 states and 105525 transitions. [2019-09-10 06:42:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:42:03,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:03,454 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, 1, 1, 1, 1, 1, 1, 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:42:03,455 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1244823914, now seen corresponding path program 1 times [2019-09-10 06:42:03,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:03,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:03,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:03,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:03,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:03,643 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:42:03,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:03,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:03,645 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2019-09-10 06:42:03,646 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [147], [150], [153], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [298], [303], [316], [318], [331], [339], [358], [369], [371], [374], [377], [380], [382], [384], [426], [439], [447], [459], [473], [485], [493], [509], [535], [556], [557], [561], [562], [563] [2019-09-10 06:42:03,691 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:03,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:03,793 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:04,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:04,212 INFO L272 AbstractInterpreter]: Visited 90 different actions 325 times. Merged at 33 different actions 211 times. Widened at 12 different actions 30 times. Performed 1131 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 114 variables. [2019-09-10 06:42:04,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:04,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:04,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:04,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:04,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:04,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:04,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:42:04,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:04,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:04,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,309 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:42:05,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:05,683 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:42:05,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:05,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2019-09-10 06:42:05,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:05,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:42:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:42:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:42:05,691 INFO L87 Difference]: Start difference. First operand 83792 states and 105525 transitions. Second operand 20 states. [2019-09-10 06:42:06,106 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:42:06,260 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 06:42:08,343 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-10 06:42:08,553 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-10 06:42:09,346 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 06:42:10,129 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:42:10,610 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-10 06:42:10,845 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:42:12,520 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 06:42:12,976 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:42:13,528 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 06:42:13,859 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 06:42:14,706 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:42:14,904 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 06:42:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:15,288 INFO L93 Difference]: Finished difference Result 216931 states and 269187 transitions. [2019-09-10 06:42:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 06:42:15,289 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-09-10 06:42:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:15,862 INFO L225 Difference]: With dead ends: 216931 [2019-09-10 06:42:15,862 INFO L226 Difference]: Without dead ends: 216931 [2019-09-10 06:42:15,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 170 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1194, Invalid=3776, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 06:42:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216931 states. [2019-09-10 06:42:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216931 to 115674. [2019-09-10 06:42:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115674 states. [2019-09-10 06:42:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115674 states to 115674 states and 145709 transitions. [2019-09-10 06:42:20,416 INFO L78 Accepts]: Start accepts. Automaton has 115674 states and 145709 transitions. Word has length 96 [2019-09-10 06:42:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:20,416 INFO L475 AbstractCegarLoop]: Abstraction has 115674 states and 145709 transitions. [2019-09-10 06:42:20,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:42:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 115674 states and 145709 transitions. [2019-09-10 06:42:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:42:20,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:20,435 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, 1, 1, 1, 1, 1, 1, 1, 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:42:20,435 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:20,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash 942692355, now seen corresponding path program 1 times [2019-09-10 06:42:20,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:20,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:20,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:20,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:20,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:20,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:20,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:20,576 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 06:42:20,576 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [298], [303], [316], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [426], [439], [447], [461], [473], [483], [514], [530], [535], [556], [557], [561], [562], [563] [2019-09-10 06:42:20,580 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:20,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:20,601 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:20,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:20,849 INFO L272 AbstractInterpreter]: Visited 91 different actions 362 times. Merged at 34 different actions 244 times. Widened at 10 different actions 32 times. Performed 1230 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1230 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 8 different actions. Largest state had 114 variables. [2019-09-10 06:42:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:20,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:20,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:20,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:20,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:20,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:20,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 06:42:20,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:21,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:21,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:21,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2019-09-10 06:42:21,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:21,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:42:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:42:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:42:21,367 INFO L87 Difference]: Start difference. First operand 115674 states and 145709 transitions. Second operand 11 states. [2019-09-10 06:42:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:21,940 INFO L93 Difference]: Finished difference Result 179824 states and 223729 transitions. [2019-09-10 06:42:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:42:21,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-09-10 06:42:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:22,185 INFO L225 Difference]: With dead ends: 179824 [2019-09-10 06:42:22,185 INFO L226 Difference]: Without dead ends: 179824 [2019-09-10 06:42:22,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:42:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179824 states. [2019-09-10 06:42:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179824 to 146756. [2019-09-10 06:42:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146756 states. [2019-09-10 06:42:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146756 states to 146756 states and 184589 transitions. [2019-09-10 06:42:24,285 INFO L78 Accepts]: Start accepts. Automaton has 146756 states and 184589 transitions. Word has length 97 [2019-09-10 06:42:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:24,285 INFO L475 AbstractCegarLoop]: Abstraction has 146756 states and 184589 transitions. [2019-09-10 06:42:24,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:42:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 146756 states and 184589 transitions. [2019-09-10 06:42:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 06:42:24,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:24,303 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, 1, 1, 1, 1, 1, 1, 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:42:24,303 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1947843037, now seen corresponding path program 1 times [2019-09-10 06:42:24,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:24,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:24,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:42:24,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:24,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:42:24,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:24,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:42:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:42:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:42:24,359 INFO L87 Difference]: Start difference. First operand 146756 states and 184589 transitions. Second operand 3 states. [2019-09-10 06:42:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:24,678 INFO L93 Difference]: Finished difference Result 132564 states and 165554 transitions. [2019-09-10 06:42:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:42:24,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 06:42:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:24,817 INFO L225 Difference]: With dead ends: 132564 [2019-09-10 06:42:24,817 INFO L226 Difference]: Without dead ends: 132564 [2019-09-10 06:42:24,818 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:42:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132564 states. [2019-09-10 06:42:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132564 to 132564. [2019-09-10 06:42:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132564 states. [2019-09-10 06:42:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132564 states to 132564 states and 165554 transitions. [2019-09-10 06:42:28,633 INFO L78 Accepts]: Start accepts. Automaton has 132564 states and 165554 transitions. Word has length 107 [2019-09-10 06:42:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:28,633 INFO L475 AbstractCegarLoop]: Abstraction has 132564 states and 165554 transitions. [2019-09-10 06:42:28,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:42:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 132564 states and 165554 transitions. [2019-09-10 06:42:28,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 06:42:28,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:28,647 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, 1, 1, 1, 1, 1, 1, 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:42:28,647 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1403781913, now seen corresponding path program 1 times [2019-09-10 06:42:28,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:28,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:28,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:28,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:28,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:42:28,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:28,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:42:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:42:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:42:28,707 INFO L87 Difference]: Start difference. First operand 132564 states and 165554 transitions. Second operand 5 states. [2019-09-10 06:42:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:29,443 INFO L93 Difference]: Finished difference Result 154753 states and 188848 transitions. [2019-09-10 06:42:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:42:29,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-10 06:42:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:29,656 INFO L225 Difference]: With dead ends: 154753 [2019-09-10 06:42:29,657 INFO L226 Difference]: Without dead ends: 154753 [2019-09-10 06:42:29,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:42:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154753 states. [2019-09-10 06:42:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154753 to 124120. [2019-09-10 06:42:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124120 states. [2019-09-10 06:42:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124120 states to 124120 states and 152340 transitions. [2019-09-10 06:42:31,735 INFO L78 Accepts]: Start accepts. Automaton has 124120 states and 152340 transitions. Word has length 107 [2019-09-10 06:42:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:31,735 INFO L475 AbstractCegarLoop]: Abstraction has 124120 states and 152340 transitions. [2019-09-10 06:42:31,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:42:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 124120 states and 152340 transitions. [2019-09-10 06:42:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:42:31,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:31,744 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, 1, 1, 1, 1, 1, 1, 1, 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:42:31,744 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1309307435, now seen corresponding path program 1 times [2019-09-10 06:42:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:31,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:31,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:31,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:31,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 06:42:31,801 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [426], [429], [432], [435], [437], [439], [461], [471], [514], [530], [556], [557], [561], [562], [563] [2019-09-10 06:42:31,804 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:31,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:31,818 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:31,899 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:42:31,900 INFO L272 AbstractInterpreter]: Visited 98 different actions 189 times. Merged at 30 different actions 80 times. Never widened. Performed 684 root evaluator evaluations with a maximum evaluation depth of 5. Performed 684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 116 variables. [2019-09-10 06:42:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:31,900 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:42:32,195 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 82.34% of their original sizes. [2019-09-10 06:42:32,196 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:42:36,161 INFO L420 sIntCurrentIteration]: We unified 107 AI predicates to 107 [2019-09-10 06:42:36,162 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:42:36,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:42:36,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [5] total 69 [2019-09-10 06:42:36,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:36,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 06:42:36,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 06:42:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3952, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 06:42:36,165 INFO L87 Difference]: Start difference. First operand 124120 states and 152340 transitions. Second operand 66 states. [2019-09-10 06:44:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:18,752 INFO L93 Difference]: Finished difference Result 176445 states and 215246 transitions. [2019-09-10 06:44:18,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 349 states. [2019-09-10 06:44:18,752 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 108 [2019-09-10 06:44:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:18,917 INFO L225 Difference]: With dead ends: 176445 [2019-09-10 06:44:18,917 INFO L226 Difference]: Without dead ends: 176445 [2019-09-10 06:44:18,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61985 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=13172, Invalid=138538, Unknown=0, NotChecked=0, Total=151710 [2019-09-10 06:44:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176445 states. [2019-09-10 06:44:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176445 to 127124. [2019-09-10 06:44:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127124 states. [2019-09-10 06:44:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127124 states to 127124 states and 155802 transitions. [2019-09-10 06:44:20,162 INFO L78 Accepts]: Start accepts. Automaton has 127124 states and 155802 transitions. Word has length 108 [2019-09-10 06:44:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:20,162 INFO L475 AbstractCegarLoop]: Abstraction has 127124 states and 155802 transitions. [2019-09-10 06:44:20,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 06:44:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 127124 states and 155802 transitions. [2019-09-10 06:44:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:44:20,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:20,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:20,173 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:20,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1295314631, now seen corresponding path program 1 times [2019-09-10 06:44:20,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:20,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:20,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:20,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:20,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:44:20,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:44:20,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:44:20,235 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [426], [429], [432], [435], [437], [439], [461], [471], [476], [481], [514], [530], [556], [557], [561], [562], [563] [2019-09-10 06:44:20,238 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:44:20,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:44:20,249 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:44:20,307 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:44:20,307 INFO L272 AbstractInterpreter]: Visited 99 different actions 190 times. Merged at 30 different actions 80 times. Never widened. Performed 684 root evaluator evaluations with a maximum evaluation depth of 5. Performed 684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 116 variables. [2019-09-10 06:44:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:20,308 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:44:20,468 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 81.9% of their original sizes. [2019-09-10 06:44:20,468 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:44:24,845 INFO L420 sIntCurrentIteration]: We unified 108 AI predicates to 108 [2019-09-10 06:44:24,846 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:44:24,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:44:24,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [5] total 69 [2019-09-10 06:44:24,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:24,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 06:44:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 06:44:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=3939, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 06:44:24,847 INFO L87 Difference]: Start difference. First operand 127124 states and 155802 transitions. Second operand 66 states. [2019-09-10 06:45:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:24,507 INFO L93 Difference]: Finished difference Result 164337 states and 200479 transitions. [2019-09-10 06:45:24,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-09-10 06:45:24,507 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 109 [2019-09-10 06:45:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:24,666 INFO L225 Difference]: With dead ends: 164337 [2019-09-10 06:45:24,666 INFO L226 Difference]: Without dead ends: 164337 [2019-09-10 06:45:24,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31656 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=7558, Invalid=73382, Unknown=0, NotChecked=0, Total=80940 [2019-09-10 06:45:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164337 states. [2019-09-10 06:45:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164337 to 127756. [2019-09-10 06:45:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127756 states. [2019-09-10 06:45:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127756 states to 127756 states and 156482 transitions. [2019-09-10 06:45:25,749 INFO L78 Accepts]: Start accepts. Automaton has 127756 states and 156482 transitions. Word has length 109 [2019-09-10 06:45:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:25,749 INFO L475 AbstractCegarLoop]: Abstraction has 127756 states and 156482 transitions. [2019-09-10 06:45:25,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 06:45:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 127756 states and 156482 transitions. [2019-09-10 06:45:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:45:25,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:25,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:25,759 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:25,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:25,759 INFO L82 PathProgramCache]: Analyzing trace with hash 382852877, now seen corresponding path program 1 times [2019-09-10 06:45:25,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:25,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:25,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:25,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:25,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:45:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:25,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:45:25,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:25,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:45:25,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:45:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:45:25,804 INFO L87 Difference]: Start difference. First operand 127756 states and 156482 transitions. Second operand 4 states. [2019-09-10 06:45:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:26,238 INFO L93 Difference]: Finished difference Result 148629 states and 181521 transitions. [2019-09-10 06:45:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:26,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 06:45:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:26,375 INFO L225 Difference]: With dead ends: 148629 [2019-09-10 06:45:26,375 INFO L226 Difference]: Without dead ends: 148629 [2019-09-10 06:45:26,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:45:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148629 states. [2019-09-10 06:45:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148629 to 127762. [2019-09-10 06:45:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127762 states. [2019-09-10 06:45:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127762 states to 127762 states and 156488 transitions. [2019-09-10 06:45:28,041 INFO L78 Accepts]: Start accepts. Automaton has 127762 states and 156488 transitions. Word has length 110 [2019-09-10 06:45:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:28,042 INFO L475 AbstractCegarLoop]: Abstraction has 127762 states and 156488 transitions. [2019-09-10 06:45:28,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:45:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 127762 states and 156488 transitions. [2019-09-10 06:45:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:45:28,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:28,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:28,051 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2104183752, now seen corresponding path program 1 times [2019-09-10 06:45:28,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:28,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:28,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:28,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:28,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:28,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:45:28,240 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [147], [150], [153], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [314], [318], [331], [339], [342], [345], [348], [350], [369], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [459], [464], [467], [485], [493], [509], [556], [557], [561], [562], [563] [2019-09-10 06:45:28,242 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:28,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:28,252 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:28,452 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:28,452 INFO L272 AbstractInterpreter]: Visited 105 different actions 441 times. Merged at 39 different actions 308 times. Widened at 15 different actions 48 times. Performed 1405 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 117 variables. [2019-09-10 06:45:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:28,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:28,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:28,453 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:45:28,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:28,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:45:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:28,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:45:28,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:28,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:29,882 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:30,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:30,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:30,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:30,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:30,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:30,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:34,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:34,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 14] total 30 [2019-09-10 06:45:34,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:34,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:45:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:45:34,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:45:34,086 INFO L87 Difference]: Start difference. First operand 127762 states and 156488 transitions. Second operand 22 states. [2019-09-10 06:45:34,812 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:45:38,650 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 06:45:40,494 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 06:45:41,511 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:45:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:48,096 INFO L93 Difference]: Finished difference Result 455888 states and 556958 transitions. [2019-09-10 06:45:48,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 06:45:48,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 110 [2019-09-10 06:45:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:48,634 INFO L225 Difference]: With dead ends: 455888 [2019-09-10 06:45:48,635 INFO L226 Difference]: Without dead ends: 455888 [2019-09-10 06:45:48,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 170 SyntacticMatches, 31 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1168, Invalid=4838, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 06:45:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455888 states. [2019-09-10 06:45:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455888 to 128692. [2019-09-10 06:45:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128692 states. [2019-09-10 06:45:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128692 states to 128692 states and 157560 transitions. [2019-09-10 06:45:52,006 INFO L78 Accepts]: Start accepts. Automaton has 128692 states and 157560 transitions. Word has length 110 [2019-09-10 06:45:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:52,007 INFO L475 AbstractCegarLoop]: Abstraction has 128692 states and 157560 transitions. [2019-09-10 06:45:52,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:45:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 128692 states and 157560 transitions. [2019-09-10 06:45:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:45:52,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:52,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:52,017 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash -544180276, now seen corresponding path program 1 times [2019-09-10 06:45:52,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:52,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:52,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:45:52,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:52,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:45:52,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:52,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:45:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:45:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:45:52,067 INFO L87 Difference]: Start difference. First operand 128692 states and 157560 transitions. Second operand 4 states. [2019-09-10 06:45:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:53,120 INFO L93 Difference]: Finished difference Result 144180 states and 175969 transitions. [2019-09-10 06:45:53,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:45:53,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 06:45:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:53,259 INFO L225 Difference]: With dead ends: 144180 [2019-09-10 06:45:53,259 INFO L226 Difference]: Without dead ends: 144180 [2019-09-10 06:45:53,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:45:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144180 states. [2019-09-10 06:45:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144180 to 125616. [2019-09-10 06:45:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125616 states. [2019-09-10 06:45:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125616 states to 125616 states and 153791 transitions. [2019-09-10 06:45:54,314 INFO L78 Accepts]: Start accepts. Automaton has 125616 states and 153791 transitions. Word has length 111 [2019-09-10 06:45:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:54,315 INFO L475 AbstractCegarLoop]: Abstraction has 125616 states and 153791 transitions. [2019-09-10 06:45:54,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:45:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 125616 states and 153791 transitions. [2019-09-10 06:45:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:45:54,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:54,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:54,325 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1115041137, now seen corresponding path program 1 times [2019-09-10 06:45:54,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:54,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:54,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:54,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:54,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:54,587 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 06:45:54,587 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [395], [398], [401], [403], [426], [429], [432], [435], [437], [439], [461], [471], [514], [530], [556], [557], [561], [562], [563] [2019-09-10 06:45:54,590 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:54,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:54,602 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:55,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:55,421 INFO L272 AbstractInterpreter]: Visited 106 different actions 410 times. Merged at 41 different actions 276 times. Widened at 14 different actions 36 times. Performed 1340 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1340 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 11 different actions. Largest state had 117 variables. [2019-09-10 06:45:55,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:55,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:55,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:55,422 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:45:55,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:55,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:45:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:55,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:45:55,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:55,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:55,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:55,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:55,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:55,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:56,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:56,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:56,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:56,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:56,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:56,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:56,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:56,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 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): Stream closed [2019-09-10 06:45:56,359 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:45:56,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [12] total 32 [2019-09-10 06:45:56,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:56,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:45:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:45:56,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:45:56,369 INFO L87 Difference]: Start difference. First operand 125616 states and 153791 transitions. Second operand 12 states. [2019-09-10 06:45:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:58,038 INFO L93 Difference]: Finished difference Result 151822 states and 184822 transitions. [2019-09-10 06:45:58,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:45:58,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-09-10 06:45:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:58,185 INFO L225 Difference]: With dead ends: 151822 [2019-09-10 06:45:58,185 INFO L226 Difference]: Without dead ends: 151822 [2019-09-10 06:45:58,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=321, Invalid=1935, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:45:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151822 states. [2019-09-10 06:45:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151822 to 142365. [2019-09-10 06:45:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142365 states. [2019-09-10 06:45:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142365 states to 142365 states and 174063 transitions. [2019-09-10 06:45:59,796 INFO L78 Accepts]: Start accepts. Automaton has 142365 states and 174063 transitions. Word has length 111 [2019-09-10 06:45:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:59,797 INFO L475 AbstractCegarLoop]: Abstraction has 142365 states and 174063 transitions. [2019-09-10 06:45:59,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:45:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 142365 states and 174063 transitions. [2019-09-10 06:45:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:45:59,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:59,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:59,804 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -516669873, now seen corresponding path program 1 times [2019-09-10 06:45:59,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:59,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:00,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:00,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:00,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 06:46:00,135 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [145], [147], [150], [153], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [316], [318], [331], [339], [342], [345], [348], [350], [360], [363], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [459], [485], [493], [509], [556], [557], [561], [562], [563] [2019-09-10 06:46:00,137 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:00,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:00,143 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:00,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:00,290 INFO L272 AbstractInterpreter]: Visited 106 different actions 369 times. Merged at 41 different actions 239 times. Widened at 12 different actions 27 times. Performed 1251 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1251 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 9 different actions. Largest state had 117 variables. [2019-09-10 06:46:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:00,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:00,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:00,290 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:46:00,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:00,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:46:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:00,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:46:00,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:00,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:00,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:00,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:00,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:00,885 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:01,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:01,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2019-09-10 06:46:01,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:01,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:46:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:46:01,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:46:01,425 INFO L87 Difference]: Start difference. First operand 142365 states and 174063 transitions. Second operand 26 states. [2019-09-10 06:46:05,050 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 06:46:05,250 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 06:46:05,965 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 06:46:07,041 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 06:46:07,403 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 06:46:07,839 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 06:46:08,970 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 06:46:09,383 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 06:46:09,721 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 06:46:09,995 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 06:46:10,183 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 06:46:10,440 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 06:46:10,990 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 06:46:11,536 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 06:46:11,721 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 06:46:11,908 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 06:46:12,099 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 06:46:12,802 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-10 06:46:12,973 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 06:46:15,469 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 06:46:15,829 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-10 06:46:16,007 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 06:46:16,235 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 06:46:16,408 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 06:46:16,746 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 06:46:16,926 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 06:46:17,122 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 06:46:17,294 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 06:46:17,467 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 06:46:17,656 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:46:18,400 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:46:18,606 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 06:46:21,117 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-10 06:46:21,274 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 06:46:21,494 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-10 06:46:21,649 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 06:46:21,842 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 06:46:22,058 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-10 06:46:22,358 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 06:46:22,543 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-10 06:46:22,703 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 06:46:22,865 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:46:23,078 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 06:46:23,489 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 06:46:23,662 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 06:46:23,837 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-10 06:46:23,998 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 06:46:24,525 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 06:46:24,721 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 06:46:25,196 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-10 06:46:25,564 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 06:46:26,139 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-09-10 06:46:26,835 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-10 06:46:27,212 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-09-10 06:46:27,382 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 06:46:28,521 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-09-10 06:46:28,972 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 06:46:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:32,694 INFO L93 Difference]: Finished difference Result 580184 states and 699869 transitions. [2019-09-10 06:46:32,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-10 06:46:32,694 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-09-10 06:46:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:33,481 INFO L225 Difference]: With dead ends: 580184 [2019-09-10 06:46:33,481 INFO L226 Difference]: Without dead ends: 580184 [2019-09-10 06:46:33,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10636 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=6243, Invalid=27063, Unknown=0, NotChecked=0, Total=33306 [2019-09-10 06:46:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580184 states. [2019-09-10 06:46:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580184 to 142521. [2019-09-10 06:46:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142521 states. [2019-09-10 06:46:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142521 states to 142521 states and 174247 transitions. [2019-09-10 06:46:37,629 INFO L78 Accepts]: Start accepts. Automaton has 142521 states and 174247 transitions. Word has length 111 [2019-09-10 06:46:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:37,630 INFO L475 AbstractCegarLoop]: Abstraction has 142521 states and 174247 transitions. [2019-09-10 06:46:37,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:46:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 142521 states and 174247 transitions. [2019-09-10 06:46:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:46:37,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:37,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,636 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1813391424, now seen corresponding path program 1 times [2019-09-10 06:46:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:37,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:37,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:37,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:38,509 WARN L188 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-10 06:46:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:39,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:39,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:39,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:46:39,126 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [147], [150], [153], [161], [164], [167], [171], [192], [195], [198], [201], [204], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [314], [318], [331], [339], [342], [345], [348], [350], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [459], [464], [467], [485], [493], [509], [556], [557], [561], [562], [563] [2019-09-10 06:46:39,129 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:39,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:39,137 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:39,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:39,230 INFO L272 AbstractInterpreter]: Visited 107 different actions 245 times. Merged at 41 different actions 124 times. Widened at 1 different actions 1 times. Performed 910 root evaluator evaluations with a maximum evaluation depth of 5. Performed 910 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 14 fixpoints after 6 different actions. Largest state had 117 variables. [2019-09-10 06:46:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:39,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:39,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:39,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:46:39,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:39,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:46:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:39,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:46:39,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:39,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:39,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:39,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:39,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:40,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:40,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:40,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:40,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:40,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:40,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:40,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:40,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 11] total 38 [2019-09-10 06:46:40,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:40,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 06:46:40,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 06:46:40,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:46:40,512 INFO L87 Difference]: Start difference. First operand 142521 states and 174247 transitions. Second operand 31 states. [2019-09-10 06:46:41,045 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 107 [2019-09-10 06:46:41,987 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:46:42,407 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 06:46:42,932 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 06:46:43,374 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:46:43,717 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 06:46:44,060 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 06:46:44,366 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-10 06:46:44,581 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:46:44,871 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:46:45,098 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-10 06:46:45,398 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 06:46:45,685 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-09-10 06:46:46,416 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 06:46:46,855 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-09-10 06:46:47,224 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-09-10 06:46:48,112 WARN L188 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2019-09-10 06:46:48,594 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 06:46:48,852 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-09-10 06:46:49,462 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-09-10 06:46:50,261 WARN L188 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2019-09-10 06:46:50,653 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-09-10 06:46:51,135 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 120 [2019-09-10 06:46:51,957 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 126 [2019-09-10 06:46:52,342 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 06:46:52,782 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2019-09-10 06:46:53,435 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-09-10 06:46:53,833 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 06:46:54,336 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2019-09-10 06:46:54,933 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-09-10 06:46:55,448 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-09-10 06:46:56,067 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-09-10 06:46:56,481 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-09-10 06:46:57,278 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-09-10 06:46:58,076 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 06:46:58,362 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-09-10 06:46:58,797 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 06:46:59,194 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 06:46:59,498 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 06:47:00,108 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 06:47:00,745 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 06:47:01,002 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 06:47:02,271 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 06:47:02,546 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-09-10 06:47:02,791 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 06:47:03,188 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-09-10 06:47:03,570 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 06:47:07,273 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 06:47:07,692 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 06:47:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:08,806 INFO L93 Difference]: Finished difference Result 659122 states and 804274 transitions. [2019-09-10 06:47:08,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 06:47:08,807 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 112 [2019-09-10 06:47:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:14,289 INFO L225 Difference]: With dead ends: 659122 [2019-09-10 06:47:14,290 INFO L226 Difference]: Without dead ends: 659119 [2019-09-10 06:47:14,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2641 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=1820, Invalid=10170, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 06:47:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659119 states. [2019-09-10 06:47:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659119 to 142562. [2019-09-10 06:47:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142562 states. [2019-09-10 06:47:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142562 states to 142562 states and 174287 transitions. [2019-09-10 06:47:17,876 INFO L78 Accepts]: Start accepts. Automaton has 142562 states and 174287 transitions. Word has length 112 [2019-09-10 06:47:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:17,876 INFO L475 AbstractCegarLoop]: Abstraction has 142562 states and 174287 transitions. [2019-09-10 06:47:17,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 06:47:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 142562 states and 174287 transitions. [2019-09-10 06:47:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:47:17,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:17,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,883 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1853537379, now seen corresponding path program 1 times [2019-09-10 06:47:17,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:17,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:17,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:17,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:17,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:18,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:18,444 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:47:18,444 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [198], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [367], [371], [384], [392], [395], [398], [401], [403], [426], [429], [432], [435], [437], [439], [461], [471], [476], [481], [514], [530], [556], [557], [561], [562], [563] [2019-09-10 06:47:18,445 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:18,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:18,453 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:18,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:18,524 INFO L272 AbstractInterpreter]: Visited 108 different actions 198 times. Merged at 40 different actions 80 times. Never widened. Performed 780 root evaluator evaluations with a maximum evaluation depth of 5. Performed 780 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 10 fixpoints after 5 different actions. Largest state had 117 variables. [2019-09-10 06:47:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:18,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:18,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:18,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:47:18,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:18,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:47:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:19,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 06:47:19,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:19,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:19,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:19,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:19,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:20,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:20,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:20,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:20,054 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:47:20,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [20] total 41 [2019-09-10 06:47:20,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:20,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:47:20,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:47:20,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:47:20,057 INFO L87 Difference]: Start difference. First operand 142562 states and 174287 transitions. Second operand 13 states. [2019-09-10 06:47:21,550 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:47:21,786 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:47:21,958 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 06:47:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:22,230 INFO L93 Difference]: Finished difference Result 142933 states and 173720 transitions. [2019-09-10 06:47:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:47:22,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2019-09-10 06:47:22,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:22,373 INFO L225 Difference]: With dead ends: 142933 [2019-09-10 06:47:22,373 INFO L226 Difference]: Without dead ends: 142933 [2019-09-10 06:47:22,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=421, Invalid=2885, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:47:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142933 states. [2019-09-10 06:47:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142933 to 133431. [2019-09-10 06:47:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133431 states. [2019-09-10 06:47:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133431 states to 133431 states and 162912 transitions. [2019-09-10 06:47:25,955 INFO L78 Accepts]: Start accepts. Automaton has 133431 states and 162912 transitions. Word has length 113 [2019-09-10 06:47:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:25,955 INFO L475 AbstractCegarLoop]: Abstraction has 133431 states and 162912 transitions. [2019-09-10 06:47:25,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:47:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 133431 states and 162912 transitions. [2019-09-10 06:47:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:47:25,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:25,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,961 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash -814577943, now seen corresponding path program 1 times [2019-09-10 06:47:25,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:25,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:25,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:25,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:25,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:27,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:27,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 06:47:27,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:27,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 06:47:27,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 06:47:27,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:47:27,307 INFO L87 Difference]: Start difference. First operand 133431 states and 162912 transitions. Second operand 23 states. [2019-09-10 06:47:27,722 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-09-10 06:47:28,039 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-10 06:47:28,216 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 06:47:28,569 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:47:28,879 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 06:47:29,126 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 06:47:29,418 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 06:47:29,623 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 06:47:29,971 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:47:30,195 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 06:47:30,485 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 06:47:30,641 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-09-10 06:47:30,919 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:47:31,095 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-09-10 06:47:31,381 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:47:31,535 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2019-09-10 06:47:32,542 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 46 [2019-09-10 06:47:32,780 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-09-10 06:47:32,999 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-09-10 06:47:33,442 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-09-10 06:47:33,742 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-09-10 06:47:33,927 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-09-10 06:47:34,811 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2019-09-10 06:47:34,993 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2019-09-10 06:47:35,323 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2019-09-10 06:47:35,498 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2019-09-10 06:47:35,693 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 06:47:35,866 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 06:47:36,086 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-09-10 06:47:36,249 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:47:36,480 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-09-10 06:47:36,645 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2019-09-10 06:47:36,824 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 06:47:36,992 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 06:47:37,216 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-09-10 06:47:37,432 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-09-10 06:47:37,678 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-09-10 06:47:37,896 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-09-10 06:47:38,098 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-10 06:47:38,321 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-09-10 06:47:38,591 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 06:47:38,782 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 06:47:39,296 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 06:47:39,596 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 06:47:39,788 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 06:47:40,011 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 06:47:40,184 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 06:47:40,339 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:47:40,493 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 06:47:40,639 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 06:47:40,809 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 06:47:40,944 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-10 06:47:41,182 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-10 06:47:41,317 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:47:41,639 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 06:47:41,847 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 06:47:42,067 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 06:47:42,249 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 06:47:42,464 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 06:47:42,996 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 06:47:43,621 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 06:47:43,800 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 06:47:43,961 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-10 06:47:44,155 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 06:47:44,462 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-10 06:47:44,853 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 06:47:45,151 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 06:47:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:48,766 INFO L93 Difference]: Finished difference Result 391729 states and 478697 transitions. [2019-09-10 06:47:48,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-10 06:47:48,766 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 113 [2019-09-10 06:47:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:49,198 INFO L225 Difference]: With dead ends: 391729 [2019-09-10 06:47:49,198 INFO L226 Difference]: Without dead ends: 391729 [2019-09-10 06:47:49,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5315 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=2348, Invalid=12414, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 06:47:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391729 states. [2019-09-10 06:47:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391729 to 136100. [2019-09-10 06:47:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136100 states. [2019-09-10 06:47:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136100 states to 136100 states and 166164 transitions. [2019-09-10 06:47:51,609 INFO L78 Accepts]: Start accepts. Automaton has 136100 states and 166164 transitions. Word has length 113 [2019-09-10 06:47:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:51,609 INFO L475 AbstractCegarLoop]: Abstraction has 136100 states and 166164 transitions. [2019-09-10 06:47:51,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 06:47:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 136100 states and 166164 transitions. [2019-09-10 06:47:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:47:51,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:51,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,615 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:51,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash -135305689, now seen corresponding path program 1 times [2019-09-10 06:47:51,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:51,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:51,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:51,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:51,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:53,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:53,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:53,275 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:47:53,275 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [147], [150], [153], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [314], [318], [331], [339], [342], [345], [348], [350], [360], [363], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [459], [464], [469], [485], [493], [509], [556], [557], [561], [562], [563] [2019-09-10 06:47:53,276 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:53,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:53,282 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:53,350 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:53,350 INFO L272 AbstractInterpreter]: Visited 108 different actions 204 times. Merged at 40 different actions 86 times. Never widened. Performed 780 root evaluator evaluations with a maximum evaluation depth of 5. Performed 780 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 5 different actions. Largest state had 117 variables. [2019-09-10 06:47:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:53,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:53,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:53,351 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:47:53,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:53,370 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:47:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:53,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:47:53,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:53,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:53,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:53,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:55,707 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:55,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:55,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:55,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:55,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 37 [2019-09-10 06:47:55,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:55,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 06:47:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 06:47:55,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:47:55,981 INFO L87 Difference]: Start difference. First operand 136100 states and 166164 transitions. Second operand 35 states. [2019-09-10 06:47:57,478 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 06:47:57,873 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 06:47:58,102 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-10 06:47:58,346 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 06:47:58,763 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 06:47:59,118 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 06:47:59,510 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 06:47:59,784 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 06:48:00,055 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:48:00,458 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 06:48:00,803 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 06:48:01,236 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 06:48:01,904 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 06:48:02,140 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 06:48:02,583 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 06:48:03,122 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-09-10 06:48:03,514 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 06:48:03,967 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-09-10 06:48:04,408 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-10 06:48:05,709 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-09-10 06:48:06,265 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2019-09-10 06:48:06,448 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-09-10 06:48:06,693 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-09-10 06:48:07,073 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:48:07,710 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 06:48:08,661 WARN L188 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2019-09-10 06:48:10,040 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 06:48:10,540 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-10 06:48:11,215 WARN L188 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2019-09-10 06:48:11,654 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 06:48:12,015 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 06:48:12,575 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-10 06:48:13,867 WARN L188 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-10 06:48:14,885 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-09-10 06:48:15,207 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:48:16,073 WARN L188 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 116 [2019-09-10 06:48:16,937 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 103 [2019-09-10 06:48:17,866 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2019-09-10 06:48:18,832 WARN L188 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 121 [2019-09-10 06:48:19,973 WARN L188 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2019-09-10 06:48:20,615 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 06:48:21,268 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 06:48:21,570 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 06:48:22,054 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 06:48:22,454 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-09-10 06:48:25,115 WARN L188 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2019-09-10 06:48:25,414 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-09-10 06:48:25,586 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 06:48:26,520 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 103 [2019-09-10 06:48:27,019 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:48:27,750 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-09-10 06:48:28,325 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 06:48:29,099 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-09-10 06:48:29,426 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 06:48:30,377 WARN L188 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2019-09-10 06:48:32,013 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 134 DAG size of output: 117 [2019-09-10 06:48:32,689 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2019-09-10 06:48:33,307 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:48:33,985 WARN L188 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-09-10 06:48:34,280 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-10 06:48:34,682 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-09-10 06:48:35,013 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 06:48:35,647 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 06:48:36,117 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 06:48:36,327 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-10 06:48:36,628 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 06:48:37,239 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-10 06:48:38,048 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-09-10 06:48:38,413 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:48:38,827 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 06:48:39,451 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 06:48:39,754 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-09-10 06:48:40,133 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-09-10 06:48:40,960 WARN L188 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 98 [2019-09-10 06:48:41,804 WARN L188 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 115 [2019-09-10 06:48:42,171 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-09-10 06:48:42,818 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-10 06:48:43,485 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 06:48:43,949 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 06:48:44,502 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-10 06:48:45,422 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-09-10 06:48:46,192 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-10 06:48:46,428 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-10 06:48:46,910 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-09-10 06:48:48,087 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:48:48,698 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-09-10 06:48:49,388 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-09-10 06:48:49,970 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-09-10 06:48:50,823 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 06:48:51,078 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:48:51,858 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 06:48:52,067 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 06:48:53,442 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:48:54,228 WARN L188 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2019-09-10 06:48:54,785 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-09-10 06:48:56,193 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-10 06:48:56,515 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:48:57,370 WARN L188 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-09-10 06:48:58,309 WARN L188 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2019-09-10 06:48:58,656 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 06:48:59,125 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 06:48:59,346 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:48:59,656 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 06:49:00,088 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-09-10 06:49:01,544 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-10 06:49:02,361 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 06:49:02,918 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-10 06:49:03,343 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 06:49:03,680 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 06:49:04,125 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 06:49:06,006 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 06:49:06,600 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2019-09-10 06:49:06,872 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 06:49:08,187 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 06:49:08,446 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 06:49:09,017 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 06:49:09,610 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-10 06:49:09,829 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 06:49:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:12,089 INFO L93 Difference]: Finished difference Result 641592 states and 779631 transitions. [2019-09-10 06:49:12,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2019-09-10 06:49:12,089 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 113 [2019-09-10 06:49:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:12,932 INFO L225 Difference]: With dead ends: 641592 [2019-09-10 06:49:12,933 INFO L226 Difference]: Without dead ends: 641592 [2019-09-10 06:49:12,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 196 SyntacticMatches, 20 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17010 ImplicationChecksByTransitivity, 58.4s TimeCoverageRelationStatistics Valid=5428, Invalid=39728, Unknown=0, NotChecked=0, Total=45156 [2019-09-10 06:49:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641592 states. [2019-09-10 06:49:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641592 to 136112. [2019-09-10 06:49:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136112 states. [2019-09-10 06:49:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136112 states to 136112 states and 166176 transitions. [2019-09-10 06:49:21,059 INFO L78 Accepts]: Start accepts. Automaton has 136112 states and 166176 transitions. Word has length 113 [2019-09-10 06:49:21,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:21,060 INFO L475 AbstractCegarLoop]: Abstraction has 136112 states and 166176 transitions. [2019-09-10 06:49:21,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 06:49:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 136112 states and 166176 transitions. [2019-09-10 06:49:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:49:21,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:21,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,067 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1184137270, now seen corresponding path program 1 times [2019-09-10 06:49:21,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:21,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:21,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:21,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:21,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:21,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:21,123 INFO L87 Difference]: Start difference. First operand 136112 states and 166176 transitions. Second operand 3 states. [2019-09-10 06:49:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:21,839 INFO L93 Difference]: Finished difference Result 94669 states and 112427 transitions. [2019-09-10 06:49:21,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:21,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:49:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:21,925 INFO L225 Difference]: With dead ends: 94669 [2019-09-10 06:49:21,925 INFO L226 Difference]: Without dead ends: 94669 [2019-09-10 06:49:21,926 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:49:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94669 states. [2019-09-10 06:49:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94669 to 94256. [2019-09-10 06:49:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94256 states. [2019-09-10 06:49:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94256 states to 94256 states and 111953 transitions. [2019-09-10 06:49:22,600 INFO L78 Accepts]: Start accepts. Automaton has 94256 states and 111953 transitions. Word has length 115 [2019-09-10 06:49:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:22,600 INFO L475 AbstractCegarLoop]: Abstraction has 94256 states and 111953 transitions. [2019-09-10 06:49:22,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 94256 states and 111953 transitions. [2019-09-10 06:49:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:49:22,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:22,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,604 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1807639009, now seen corresponding path program 1 times [2019-09-10 06:49:22,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:22,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:22,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:22,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:22,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:22,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:22,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:49:22,881 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [145], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [556], [557], [561], [562], [563] [2019-09-10 06:49:22,883 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:22,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:22,893 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:23,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:49:23,007 INFO L272 AbstractInterpreter]: Visited 110 different actions 407 times. Merged at 40 different actions 269 times. Widened at 13 different actions 37 times. Performed 1356 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1356 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 11 different actions. Largest state had 118 variables. [2019-09-10 06:49:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:23,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:49:23,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:23,008 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:49:23,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:23,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:49:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:23,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:49:23,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:49:23,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:23,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:49:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:24,770 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-10 06:49:26,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:26,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:49:26,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 06:49:26,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:49:26,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:49:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:49:26,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:49:26,990 INFO L87 Difference]: Start difference. First operand 94256 states and 111953 transitions. Second operand 20 states. [2019-09-10 06:49:27,122 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:49:27,706 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:49:27,983 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:49:28,908 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:49:29,137 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:49:29,490 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:49:29,696 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:49:29,970 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:49:30,323 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:49:30,681 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:49:31,167 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:49:31,768 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:49:32,047 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:49:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:32,499 INFO L93 Difference]: Finished difference Result 170083 states and 201637 transitions. [2019-09-10 06:49:32,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:49:32,500 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 115 [2019-09-10 06:49:32,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:32,709 INFO L225 Difference]: With dead ends: 170083 [2019-09-10 06:49:32,709 INFO L226 Difference]: Without dead ends: 170083 [2019-09-10 06:49:32,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 183 SyntacticMatches, 34 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=414, Invalid=1308, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:49:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170083 states. [2019-09-10 06:49:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170083 to 94221. [2019-09-10 06:49:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94221 states. [2019-09-10 06:49:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94221 states to 94221 states and 111908 transitions. [2019-09-10 06:49:33,750 INFO L78 Accepts]: Start accepts. Automaton has 94221 states and 111908 transitions. Word has length 115 [2019-09-10 06:49:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:33,750 INFO L475 AbstractCegarLoop]: Abstraction has 94221 states and 111908 transitions. [2019-09-10 06:49:33,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:49:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 94221 states and 111908 transitions. [2019-09-10 06:49:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:49:33,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:33,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,754 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash -513025811, now seen corresponding path program 1 times [2019-09-10 06:49:33,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:33,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:33,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:35,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:35,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:35,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:49:35,251 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [145], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [360], [363], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [556], [557], [561], [562], [563] [2019-09-10 06:49:35,254 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:35,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:35,263 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:35,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:49:35,332 INFO L272 AbstractInterpreter]: Visited 110 different actions 193 times. Merged at 38 different actions 74 times. Never widened. Performed 776 root evaluator evaluations with a maximum evaluation depth of 5. Performed 776 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 4 different actions. Largest state had 118 variables. [2019-09-10 06:49:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:35,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:49:35,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:35,332 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:49:35,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:35,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:49:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:35,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 06:49:35,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:49:35,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:36,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:37,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:49:38,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:38,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:38,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:38,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:38,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:38,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:38,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:39,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:39,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:39,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:40,185 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:49:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:40,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:49:40,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 53 [2019-09-10 06:49:40,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:49:40,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 06:49:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 06:49:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:49:40,702 INFO L87 Difference]: Start difference. First operand 94221 states and 111908 transitions. Second operand 37 states. [2019-09-10 06:49:41,032 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 06:49:42,792 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 06:49:43,088 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-10 06:49:43,321 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 06:49:43,627 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 06:49:44,126 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 06:49:44,487 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:49:45,843 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 06:49:46,363 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 06:49:47,912 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 06:49:48,440 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 06:49:49,016 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 06:49:51,497 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-10 06:49:53,892 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 06:49:55,466 WARN L188 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-10 06:49:56,676 WARN L188 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-10 06:49:59,410 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 06:50:03,398 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-10 06:50:04,383 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 06:50:06,003 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 06:50:07,470 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 06:50:11,089 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-10 06:50:12,363 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 06:50:12,708 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-10 06:50:13,470 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 06:50:13,724 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:50:14,590 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-09-10 06:50:15,494 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 06:50:16,403 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 06:50:17,077 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 06:50:18,129 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 06:50:19,046 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 06:50:20,456 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-09-10 06:50:21,127 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 06:50:22,201 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 06:50:22,676 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-10 06:50:25,553 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 06:50:25,910 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-09-10 06:50:31,228 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-10 06:50:32,743 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-10 06:50:33,702 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-09-10 06:50:35,275 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:50:35,741 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 06:50:36,744 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 06:50:37,509 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-10 06:50:37,998 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:50:43,204 WARN L188 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 06:50:43,755 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-09-10 06:50:44,637 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-10 06:50:47,551 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-09-10 06:50:48,388 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-10 06:50:48,826 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 06:50:49,168 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:50:50,131 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:50:50,372 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:50:51,069 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 06:50:51,410 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:50:56,569 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 06:50:57,194 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:50:57,577 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 06:50:57,946 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:50:58,291 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-10 06:50:59,189 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 06:50:59,477 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 06:51:00,346 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 06:51:00,630 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:51:01,070 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:51:01,808 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 06:51:02,357 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:51:02,992 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 06:51:04,960 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-09-10 06:51:05,213 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:51:05,431 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 06:51:05,751 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:51:06,988 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-09-10 06:51:07,555 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-10 06:51:08,066 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-09-10 06:51:08,470 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 06:51:13,370 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 06:51:13,802 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 06:51:14,422 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 06:51:14,708 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:51:15,043 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 06:51:15,480 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:51:15,970 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 06:51:16,480 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-09-10 06:51:17,247 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:51:17,457 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 06:51:17,928 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 06:51:18,251 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 06:51:18,548 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-10 06:51:19,248 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-09-10 06:51:19,566 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 06:51:20,032 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 06:51:20,325 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 06:51:20,631 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 06:51:21,557 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 06:51:22,238 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:51:22,701 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 06:51:22,960 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:51:23,201 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:51:26,286 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-10 06:51:27,138 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:51:27,388 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:51:28,599 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 06:51:30,157 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-10 06:51:34,431 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 06:51:35,008 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 06:51:35,317 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:51:36,481 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 06:51:36,824 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 06:51:37,579 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:51:39,906 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 06:51:40,378 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 06:51:40,822 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:51:41,134 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 06:51:41,509 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 06:51:41,801 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-09-10 06:51:42,213 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:51:42,470 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:51:42,724 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 06:51:43,068 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 06:51:43,554 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 06:51:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:43,845 INFO L93 Difference]: Finished difference Result 392652 states and 467852 transitions. [2019-09-10 06:51:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-10 06:51:43,845 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2019-09-10 06:51:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:44,257 INFO L225 Difference]: With dead ends: 392652 [2019-09-10 06:51:44,257 INFO L226 Difference]: Without dead ends: 392652 [2019-09-10 06:51:44,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 182 SyntacticMatches, 17 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14365 ImplicationChecksByTransitivity, 70.8s TimeCoverageRelationStatistics Valid=5489, Invalid=39667, Unknown=0, NotChecked=0, Total=45156 [2019-09-10 06:51:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392652 states. [2019-09-10 06:51:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392652 to 104349. [2019-09-10 06:51:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104349 states. [2019-09-10 06:51:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104349 states to 104349 states and 123833 transitions. [2019-09-10 06:51:46,807 INFO L78 Accepts]: Start accepts. Automaton has 104349 states and 123833 transitions. Word has length 115 [2019-09-10 06:51:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:46,807 INFO L475 AbstractCegarLoop]: Abstraction has 104349 states and 123833 transitions. [2019-09-10 06:51:46,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 06:51:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 104349 states and 123833 transitions. [2019-09-10 06:51:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:51:46,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:46,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:46,811 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2100716967, now seen corresponding path program 1 times [2019-09-10 06:51:46,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:46,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:46,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:46,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:47,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:47,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:51:47,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:47,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:51:47,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:51:47,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:51:47,045 INFO L87 Difference]: Start difference. First operand 104349 states and 123833 transitions. Second operand 12 states. [2019-09-10 06:51:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:49,646 INFO L93 Difference]: Finished difference Result 146080 states and 173660 transitions. [2019-09-10 06:51:49,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:51:49,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-09-10 06:51:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:49,792 INFO L225 Difference]: With dead ends: 146080 [2019-09-10 06:51:49,792 INFO L226 Difference]: Without dead ends: 146080 [2019-09-10 06:51:49,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:51:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146080 states. [2019-09-10 06:51:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146080 to 117654. [2019-09-10 06:51:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117654 states. [2019-09-10 06:51:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117654 states to 117654 states and 139590 transitions. [2019-09-10 06:51:51,539 INFO L78 Accepts]: Start accepts. Automaton has 117654 states and 139590 transitions. Word has length 116 [2019-09-10 06:51:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:51,539 INFO L475 AbstractCegarLoop]: Abstraction has 117654 states and 139590 transitions. [2019-09-10 06:51:51,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:51:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 117654 states and 139590 transitions. [2019-09-10 06:51:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:51:51,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:51,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:51,544 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:51,544 INFO L82 PathProgramCache]: Analyzing trace with hash -921197043, now seen corresponding path program 1 times [2019-09-10 06:51:51,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:51,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:51,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:52,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:52,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:52,593 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:51:52,593 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [147], [150], [153], [156], [161], [164], [167], [171], [192], [195], [198], [201], [204], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [257], [259], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [452], [457], [464], [467], [556], [557], [561], [562], [563] [2019-09-10 06:51:52,595 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:52,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:52,602 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:52,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:51:52,686 INFO L272 AbstractInterpreter]: Visited 113 different actions 249 times. Merged at 41 different actions 123 times. Never widened. Performed 939 root evaluator evaluations with a maximum evaluation depth of 5. Performed 939 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 9 different actions. Largest state had 118 variables. [2019-09-10 06:51:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:52,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:51:52,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:52,687 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:51:52,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:52,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:51:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:52,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 06:51:52,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:51:52,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:52,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:53,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:53,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:53,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:53,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:51:53,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:54,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:54,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:54,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:54,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:51:55,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:51:55,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 12] total 40 [2019-09-10 06:51:55,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:51:55,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 06:51:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 06:51:55,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:51:55,321 INFO L87 Difference]: Start difference. First operand 117654 states and 139590 transitions. Second operand 31 states. [2019-09-10 06:51:57,218 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 06:51:57,444 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 06:51:57,897 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-09-10 06:51:58,511 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-09-10 06:51:58,735 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 06:51:59,164 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 06:51:59,544 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 06:52:00,088 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 06:52:00,298 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 06:52:00,682 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 06:52:00,915 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 06:52:01,376 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 06:52:01,598 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-10 06:52:02,202 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 06:52:02,806 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 06:52:03,469 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 06:52:03,760 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-09-10 06:52:04,054 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-09-10 06:52:04,353 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-09-10 06:52:04,750 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-09-10 06:52:05,001 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 06:52:05,522 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-09-10 06:52:05,884 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-10 06:52:06,330 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-10 06:52:07,543 WARN L188 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-09-10 06:52:07,865 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-09-10 06:52:08,464 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 06:52:08,992 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-09-10 06:52:09,996 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 06:52:10,260 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-10 06:52:10,679 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 06:52:11,489 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 06:52:11,949 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81 [2019-09-10 06:52:12,220 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:52:12,815 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 06:52:13,187 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 06:52:13,680 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-10 06:52:14,148 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81 [2019-09-10 06:52:15,183 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-10 06:52:15,657 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-10 06:52:15,963 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-10 06:52:16,768 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-10 06:52:17,333 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-10 06:52:17,770 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 06:52:18,306 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-09-10 06:52:19,086 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2019-09-10 06:52:19,462 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-09-10 06:52:19,837 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-09-10 06:52:21,306 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-09-10 06:52:21,587 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-09-10 06:52:21,890 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 06:52:22,222 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 06:52:22,589 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 06:52:22,906 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-09-10 06:52:23,186 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-10 06:52:23,546 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-09-10 06:52:24,360 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-09-10 06:52:25,237 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 06:52:26,255 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 85 [2019-09-10 06:52:26,692 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 06:52:26,984 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-10 06:52:27,249 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-10 06:52:28,387 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2019-09-10 06:52:28,917 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-10 06:52:29,321 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-09-10 06:52:29,784 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-09-10 06:52:30,150 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2019-09-10 06:52:30,560 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 06:52:30,965 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-09-10 06:52:31,321 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 06:52:31,836 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-09-10 06:52:32,351 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-09-10 06:52:32,745 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2019-09-10 06:52:33,418 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 06:52:33,962 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 89 [2019-09-10 06:52:34,175 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 06:52:34,911 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 87 [2019-09-10 06:52:35,486 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 83 [2019-09-10 06:52:35,962 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-09-10 06:52:36,246 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 06:52:36,637 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-10 06:52:36,938 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-09-10 06:52:37,484 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-09-10 06:52:37,861 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-09-10 06:52:38,124 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 06:52:38,475 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2019-09-10 06:52:38,764 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-09-10 06:52:39,019 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-09-10 06:52:39,884 WARN L188 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2019-09-10 06:52:40,238 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-10 06:52:40,703 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 83 [2019-09-10 06:52:41,286 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-09-10 06:52:43,822 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 82 [2019-09-10 06:52:44,337 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-09-10 06:52:44,858 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2019-09-10 06:52:45,729 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2019-09-10 06:52:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:45,944 INFO L93 Difference]: Finished difference Result 303376 states and 354367 transitions. [2019-09-10 06:52:45,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-10 06:52:45,944 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2019-09-10 06:52:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:46,309 INFO L225 Difference]: With dead ends: 303376 [2019-09-10 06:52:46,309 INFO L226 Difference]: Without dead ends: 303376 [2019-09-10 06:52:46,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 207 SyntacticMatches, 10 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9640 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=5801, Invalid=25351, Unknown=0, NotChecked=0, Total=31152 [2019-09-10 06:52:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303376 states. [2019-09-10 06:52:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303376 to 129605. [2019-09-10 06:52:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129605 states. [2019-09-10 06:52:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129605 states to 129605 states and 153320 transitions. [2019-09-10 06:52:48,230 INFO L78 Accepts]: Start accepts. Automaton has 129605 states and 153320 transitions. Word has length 118 [2019-09-10 06:52:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:48,231 INFO L475 AbstractCegarLoop]: Abstraction has 129605 states and 153320 transitions. [2019-09-10 06:52:48,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 06:52:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 129605 states and 153320 transitions. [2019-09-10 06:52:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:52:48,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:48,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,236 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:48,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1781998477, now seen corresponding path program 1 times [2019-09-10 06:52:48,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:48,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:48,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:48,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:48,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:49,078 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-09-10 06:52:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:49,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:49,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:52:49,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:49,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:52:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:52:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:52:49,129 INFO L87 Difference]: Start difference. First operand 129605 states and 153320 transitions. Second operand 18 states. [2019-09-10 06:52:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:52,717 INFO L93 Difference]: Finished difference Result 175781 states and 207411 transitions. [2019-09-10 06:52:52,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:52:52,717 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2019-09-10 06:52:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:52,887 INFO L225 Difference]: With dead ends: 175781 [2019-09-10 06:52:52,887 INFO L226 Difference]: Without dead ends: 175781 [2019-09-10 06:52:52,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 06:52:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175781 states. [2019-09-10 06:52:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175781 to 133708. [2019-09-10 06:52:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133708 states. [2019-09-10 06:52:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133708 states to 133708 states and 158214 transitions. [2019-09-10 06:52:56,415 INFO L78 Accepts]: Start accepts. Automaton has 133708 states and 158214 transitions. Word has length 118 [2019-09-10 06:52:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:56,416 INFO L475 AbstractCegarLoop]: Abstraction has 133708 states and 158214 transitions. [2019-09-10 06:52:56,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:52:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 133708 states and 158214 transitions. [2019-09-10 06:52:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:52:56,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:56,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:56,420 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1839164779, now seen corresponding path program 1 times [2019-09-10 06:52:56,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:56,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:56,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:56,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:56,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:56,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:56,793 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 06:52:56,793 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [142], [145], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [198], [201], [204], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [305], [307], [310], [318], [321], [324], [327], [329], [331], [371], [374], [377], [380], [382], [384], [426], [429], [432], [435], [437], [439], [476], [481], [556], [557], [561], [562], [563] [2019-09-10 06:52:56,795 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:56,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:56,801 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:56,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:52:56,937 INFO L272 AbstractInterpreter]: Visited 113 different actions 475 times. Merged at 42 different actions 332 times. Widened at 14 different actions 47 times. Performed 1516 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1516 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 13 different actions. Largest state had 118 variables. [2019-09-10 06:52:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:56,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:52:56,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:56,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 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:52:56,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:56,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:52:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:57,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 06:52:57,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:52:57,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:57,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:57,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:58,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:58,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:52:58,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:58,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:58,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:59,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:00,006 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 06:53:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:00,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:53:00,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:53:00,506 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 06:53:01,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 06:53:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:01,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:53:01,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2019-09-10 06:53:01,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:53:01,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 06:53:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 06:53:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2141, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:53:01,867 INFO L87 Difference]: Start difference. First operand 133708 states and 158214 transitions. Second operand 34 states. [2019-09-10 06:53:06,642 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 06:53:07,412 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 06:53:08,360 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-10 06:53:10,593 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 06:53:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:13,747 INFO L93 Difference]: Finished difference Result 199463 states and 235037 transitions. [2019-09-10 06:53:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:53:13,748 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 118 [2019-09-10 06:53:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:13,975 INFO L225 Difference]: With dead ends: 199463 [2019-09-10 06:53:13,975 INFO L226 Difference]: Without dead ends: 199463 [2019-09-10 06:53:13,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 177 SyntacticMatches, 30 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2103 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=672, Invalid=4584, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 06:53:14,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199463 states. [2019-09-10 06:53:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199463 to 146461. [2019-09-10 06:53:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146461 states. [2019-09-10 06:53:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146461 states to 146461 states and 173201 transitions. [2019-09-10 06:53:16,046 INFO L78 Accepts]: Start accepts. Automaton has 146461 states and 173201 transitions. Word has length 118 [2019-09-10 06:53:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:16,046 INFO L475 AbstractCegarLoop]: Abstraction has 146461 states and 173201 transitions. [2019-09-10 06:53:16,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 06:53:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 146461 states and 173201 transitions. [2019-09-10 06:53:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:53:16,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:16,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:16,051 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1445279866, now seen corresponding path program 1 times [2019-09-10 06:53:16,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:16,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:16,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:16,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:16,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:17,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:17,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 06:53:17,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:17,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:53:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:53:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:53:17,357 INFO L87 Difference]: Start difference. First operand 146461 states and 173201 transitions. Second operand 25 states. [2019-09-10 06:53:17,529 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 06:53:18,441 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:53:18,654 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 06:53:18,934 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:53:19,159 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 06:53:19,563 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:53:19,949 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:53:20,277 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:53:20,783 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 06:53:20,977 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 06:53:22,837 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 06:53:23,042 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 06:53:23,283 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 06:53:24,141 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 06:53:24,580 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 06:53:26,503 WARN L188 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 06:53:27,035 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:53:27,497 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 06:53:29,359 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:53:29,511 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-10 06:53:29,842 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:53:30,045 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 06:53:30,336 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:53:30,556 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:53:30,905 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:53:31,100 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:53:31,345 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:53:31,508 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:53:31,820 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 06:53:32,031 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:53:33,612 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 06:53:34,020 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 06:53:34,355 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:53:34,640 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 06:53:34,798 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 06:53:34,965 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 06:53:36,550 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:53:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:38,231 INFO L93 Difference]: Finished difference Result 567980 states and 674390 transitions. [2019-09-10 06:53:38,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 06:53:38,232 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 120 [2019-09-10 06:53:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:38,924 INFO L225 Difference]: With dead ends: 567980 [2019-09-10 06:53:38,924 INFO L226 Difference]: Without dead ends: 567980 [2019-09-10 06:53:38,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3328 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1450, Invalid=9262, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 06:53:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567980 states. [2019-09-10 06:53:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567980 to 149097. [2019-09-10 06:53:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149097 states. [2019-09-10 06:53:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149097 states to 149097 states and 176286 transitions. [2019-09-10 06:53:42,673 INFO L78 Accepts]: Start accepts. Automaton has 149097 states and 176286 transitions. Word has length 120 [2019-09-10 06:53:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:42,674 INFO L475 AbstractCegarLoop]: Abstraction has 149097 states and 176286 transitions. [2019-09-10 06:53:42,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:53:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 149097 states and 176286 transitions. [2019-09-10 06:53:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 06:53:42,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:42,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:42,683 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash 906273071, now seen corresponding path program 1 times [2019-09-10 06:53:42,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:42,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:42,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:42,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:42,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 06:53:42,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:42,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:53:42,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:42,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:53:42,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:53:42,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:42,730 INFO L87 Difference]: Start difference. First operand 149097 states and 176286 transitions. Second operand 3 states. [2019-09-10 06:53:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:42,926 INFO L93 Difference]: Finished difference Result 67546 states and 78203 transitions. [2019-09-10 06:53:42,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:53:42,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-10 06:53:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:43,010 INFO L225 Difference]: With dead ends: 67546 [2019-09-10 06:53:43,010 INFO L226 Difference]: Without dead ends: 67546 [2019-09-10 06:53:43,011 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:53:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67546 states. [2019-09-10 06:53:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67546 to 66467. [2019-09-10 06:53:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66467 states. [2019-09-10 06:53:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66467 states to 66467 states and 76902 transitions. [2019-09-10 06:53:43,569 INFO L78 Accepts]: Start accepts. Automaton has 66467 states and 76902 transitions. Word has length 137 [2019-09-10 06:53:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:43,569 INFO L475 AbstractCegarLoop]: Abstraction has 66467 states and 76902 transitions. [2019-09-10 06:53:43,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:53:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 66467 states and 76902 transitions. [2019-09-10 06:53:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 06:53:43,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:43,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:43,575 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash 766030200, now seen corresponding path program 1 times [2019-09-10 06:53:43,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:43,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 06:53:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 06:53:43,716 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 06:53:43,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 06:53:43 BoogieIcfgContainer [2019-09-10 06:53:43,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 06:53:43,883 INFO L168 Benchmark]: Toolchain (without parser) took 746591.07 ms. Allocated memory was 133.7 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 89.5 MB in the beginning and 994.9 MB in the end (delta: -905.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-09-10 06:53:43,884 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 107.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 06:53:43,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.23 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 172.8 MB in the end (delta: -83.7 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-09-10 06:53:43,884 INFO L168 Benchmark]: Boogie Preprocessor took 84.30 ms. Allocated memory is still 200.8 MB. Free memory was 172.8 MB in the beginning and 169.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-09-10 06:53:43,884 INFO L168 Benchmark]: RCFGBuilder took 855.96 ms. Allocated memory is still 200.8 MB. Free memory was 169.6 MB in the beginning and 115.1 MB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2019-09-10 06:53:43,884 INFO L168 Benchmark]: TraceAbstraction took 745034.46 ms. Allocated memory was 200.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 114.2 MB in the beginning and 994.9 MB in the end (delta: -880.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-09-10 06:53:43,885 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.21 ms. Allocated memory is still 133.7 MB. Free memory is still 107.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 612.23 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 89.1 MB in the beginning and 172.8 MB in the end (delta: -83.7 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.30 ms. Allocated memory is still 200.8 MB. Free memory was 172.8 MB in the beginning and 169.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 855.96 ms. Allocated memory is still 200.8 MB. Free memory was 169.6 MB in the beginning and 115.1 MB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 745034.46 ms. Allocated memory was 200.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 114.2 MB in the beginning and 994.9 MB in the end (delta: -880.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 377]: 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_6056; [L47] int __return_6117; [L48] int __return_6183; [L49] int __return_6353; VAL [\old(__return_5979)=264, \old(__return_6056)=265, \old(__return_6117)=275, \old(__return_6183)=266, \old(__return_6353)=263, \old(__return_main)=282, \old(alive1)=13, \old(alive2)=27, \old(alive3)=28, \old(id1)=259, \old(id2)=287, \old(id3)=278, \old(mode1)=23, \old(mode2)=29, \old(mode3)=16, \old(nomsg)=268, \old(p1)=289, \old(p1_new)=273, \old(p1_old)=288, \old(p2)=260, \old(p2_new)=271, \old(p2_old)=277, \old(p3)=267, \old(p3_new)=280, \old(p3_old)=276, \old(r1)=14, \old(send1)=281, \old(send2)=261, \old(send3)=258, \old(st1)=262, \old(st2)=286, \old(st3)=274, __return_5979=0, __return_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L52] int main__c1; [L53] int main__i2; [L54] main__c1 = 0 [L55] r1 = __VERIFIER_nondet_uchar() [L56] id1 = __VERIFIER_nondet_char() [L57] st1 = __VERIFIER_nondet_char() [L58] send1 = __VERIFIER_nondet_char() [L59] mode1 = __VERIFIER_nondet_bool() [L60] alive1 = __VERIFIER_nondet_bool() [L61] id2 = __VERIFIER_nondet_char() [L62] st2 = __VERIFIER_nondet_char() [L63] send2 = __VERIFIER_nondet_char() [L64] mode2 = __VERIFIER_nondet_bool() [L65] alive2 = __VERIFIER_nondet_bool() [L66] id3 = __VERIFIER_nondet_char() [L67] st3 = __VERIFIER_nondet_char() [L68] send3 = __VERIFIER_nondet_char() [L69] mode3 = __VERIFIER_nondet_bool() [L70] alive3 = __VERIFIER_nondet_bool() [L72] int init__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L73] COND TRUE ((int)r1) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L75] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L77] COND TRUE ((int)id1) >= 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L79] COND TRUE ((int)st1) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L81] COND TRUE ((int)send1) == ((int)id1) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L83] COND TRUE ((int)mode1) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L85] COND TRUE ((int)id2) >= 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L87] COND TRUE ((int)st2) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L89] COND TRUE ((int)send2) == ((int)id2) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L91] COND TRUE ((int)mode2) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L93] COND TRUE ((int)id3) >= 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L95] COND TRUE ((int)st3) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L97] COND TRUE ((int)send3) == ((int)id3) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L99] COND TRUE ((int)mode3) == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L101] COND TRUE ((int)id1) != ((int)id2) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L103] COND TRUE ((int)id1) != ((int)id3) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L105] COND TRUE ((int)id2) != ((int)id3) [L107] init__tmp = 1 [L108] __return_5979 = init__tmp [L109] main__i2 = __return_5979 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L110] COND TRUE main__i2 != 0 [L112] p1_old = nomsg [L113] p1_new = nomsg [L114] p2_old = nomsg [L115] p2_new = nomsg [L116] p3_old = nomsg [L117] p3_new = nomsg [L118] main__i2 = 0 [L120] msg_t node1__m1; [L121] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L122] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L128] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L139] mode1 = 1 [L141] msg_t node2__m2; [L142] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L149] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L907] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L160] mode2 = 1 [L162] msg_t node3__m3; [L163] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L164] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L170] COND TRUE !(alive3 == 0) [L172] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L173] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L175] COND TRUE p3_new == nomsg [L177] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L179] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L181] mode3 = 1 [L182] p1_old = p1_new [L183] p1_new = nomsg [L184] p2_old = p2_new [L185] p2_new = nomsg [L186] p3_old = p3_new [L187] p3_new = nomsg [L189] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L190] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=0, __return_6117=0, __return_6183=0, __return_6353=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] [L192] COND TRUE ((int)r1) < 3 [L194] check__tmp = 1 [L195] __return_6056 = check__tmp [L196] main__c1 = __return_6056 [L198] _Bool __tmp_1; [L199] __tmp_1 = main__c1 [L200] _Bool assert__arg; [L201] assert__arg = __tmp_1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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] [L202] COND FALSE !(assert__arg == 0) [L209] msg_t node1__m1; [L210] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, 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] [L211] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, 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] [L213] COND FALSE !(r1 == 255) [L219] r1 = r1 + 1 [L220] node1__m1 = p3_old [L221] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, 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] [L222] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, 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=0, send2=3, send3=127, st1=0, st2=0, st3=0] [L224] COND FALSE !(!(alive1 == 0)) [L821] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, 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] [L231] mode1 = 0 [L233] msg_t node2__m2; [L234] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, node1__m1=-1, node2__m2=-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] [L235] COND TRUE !(mode2 == 0) [L237] node2__m2 = p1_old [L238] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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=-1, node1__m1=127, node2__m2=-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] [L239] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, node1__m1=-1, node2__m2=-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] [L248] mode2 = 0 [L250] msg_t node3__m3; [L251] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L252] COND TRUE !(mode3 == 0) [L254] node3__m3 = p2_old [L255] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L256] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L265] mode3 = 0 [L266] p1_old = p1_new [L267] p1_new = nomsg [L268] p2_old = p2_new [L269] p2_new = nomsg [L270] p3_old = p3_new [L271] p3_new = nomsg [L273] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L274] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=0, __return_6183=0, __return_6353=0, __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, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L276] COND TRUE ((int)r1) < 3 [L278] check__tmp = 1 [L279] __return_6117 = check__tmp [L280] main__c1 = __return_6117 [L282] _Bool __tmp_2; [L283] __tmp_2 = main__c1 [L284] _Bool assert__arg; [L285] assert__arg = __tmp_2 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L286] COND FALSE !(assert__arg == 0) [L293] msg_t node1__m1; [L294] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L295] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L697] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L708] mode1 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L317] msg_t node2__m2; [L318] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L319] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L606] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L634] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L617] mode2 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-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] [L335] msg_t node3__m3; [L336] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L337] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L520] COND TRUE !(alive3 == 0) [L522] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L523] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L525] COND TRUE p3_new == nomsg [L527] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L529] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L531] mode3 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, p3_old=-1, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L352] p1_old = p1_new [L353] p1_new = nomsg [L354] p2_old = p2_new [L355] p2_new = nomsg [L356] p3_old = p3_new [L357] p3_new = nomsg [L359] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L360] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L362] COND TRUE ((int)r1) < 3 [L364] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L367] __return_6183 = check__tmp [L368] main__c1 = __return_6183 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L375] COND FALSE !(assert__arg == 0) [L383] msg_t node1__m1; [L384] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L385] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L387] COND FALSE !(r1 == 255) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=1, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L391] r1 = r1 + 1 [L392] node1__m1 = p3_old [L393] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L394] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L396] COND FALSE !(!(alive1 == 0)) [L422] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L403] mode1 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L317] msg_t node2__m2; [L318] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L319] COND TRUE !(mode2 == 0) [L321] node2__m2 = p1_old [L322] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L323] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=-1, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L332] mode2 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L335] msg_t node3__m3; [L336] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L337] COND TRUE !(mode3 == 0) [L339] node3__m3 = p2_old [L340] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L341] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L350] mode3 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L352] p1_old = p1_new [L353] p1_new = nomsg [L354] p2_old = p2_new [L355] p2_new = nomsg [L356] p3_old = p3_new [L357] p3_new = nomsg [L359] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L360] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L362] COND TRUE ((int)r1) < 3 [L364] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L367] __return_6183 = check__tmp [L368] main__c1 = __return_6183 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L375] COND FALSE !(assert__arg == 0) [L383] msg_t node1__m1; [L384] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L385] COND FALSE !(!(mode1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L438] COND FALSE !(!(alive1 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L449] mode1 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L317] msg_t node2__m2; [L318] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L319] COND FALSE !(!(mode2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L606] COND FALSE !(!(alive2 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L634] COND FALSE !(((int)send2) != ((int)id2)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L617] mode2 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L335] msg_t node3__m3; [L336] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L337] COND FALSE !(!(mode3 == 0)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L520] COND TRUE !(alive3 == 0) [L522] int node3____CPAchecker_TMP_0; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L523] COND TRUE send3 != nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L525] COND TRUE p3_new == nomsg [L527] node3____CPAchecker_TMP_0 = send3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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] [L529] p3_new = node3____CPAchecker_TMP_0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=127, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L531] mode3 = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, p3_old=-1, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L352] p1_old = p1_new [L353] p1_new = nomsg [L354] p2_old = p2_new [L355] p2_new = nomsg [L356] p3_old = p3_new [L357] p3_new = nomsg [L359] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L360] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L362] COND TRUE ((int)r1) < 3 [L364] check__tmp = 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L367] __return_6183 = check__tmp [L368] main__c1 = __return_6183 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L375] COND FALSE !(assert__arg == 0) [L383] msg_t node1__m1; [L384] node1__m1 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L385] COND TRUE !(mode1 == 0) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L387] COND FALSE !(r1 == 255) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=127, r1=2, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L391] r1 = r1 + 1 [L392] node1__m1 = p3_old [L393] p3_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L394] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L396] COND FALSE !(!(alive1 == 0)) [L422] send1 = node1__m1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L403] mode1 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L317] msg_t node2__m2; [L318] node2__m2 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L319] COND TRUE !(mode2 == 0) [L321] node2__m2 = p1_old [L322] p1_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=-1, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L323] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L332] mode2 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L335] msg_t node3__m3; [L336] node3__m3 = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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=-1, node1__m1=127, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L337] COND TRUE !(mode3 == 0) [L339] node3__m3 = p2_old [L340] p2_old = nomsg VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L341] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L350] mode3 = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L352] p1_old = p1_new [L353] p1_new = nomsg [L354] p2_old = p2_new [L355] p2_new = nomsg [L356] p3_old = p3_new [L357] p3_new = nomsg [L359] int check__tmp; VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L360] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L362] COND FALSE !(((int)r1) < 3) VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L475] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L482] check__tmp = 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=1, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=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, node1__m1=-1, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L367] __return_6183 = check__tmp [L368] main__c1 = __return_6183 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=0, id2=3, id3=127, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=127, node1__m1=127, node1__m1=-1, node1__m1=-1, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=0, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L375] COND TRUE assert__arg == 0 VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=0, assert__arg=1, check__tmp=1, check__tmp=0, check__tmp=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, node1__m1=127, node1__m1=-1, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] [L377] __VERIFIER_error() VAL [\old(__return_5979)=0, \old(__return_6056)=0, \old(__return_6117)=0, \old(__return_6183)=0, \old(__return_6353)=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_6056=1, __return_6117=1, __return_6183=0, __return_6353=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, alive1=0, alive2=0, alive3=1, assert__arg=1, assert__arg=1, assert__arg=0, check__tmp=1, check__tmp=0, check__tmp=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, node1__m1=-1, node1__m1=127, node1__m1=127, node2__m2=-1, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=127, node3____CPAchecker_TMP_0=127, node3__m3=-1, node3__m3=-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=3, send1=127, send2=3, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 152 locations, 1 error locations. UNSAFE Result, 744.9s OverallTime, 56 OverallIterations, 4 TraceHistogramMax, 608.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17536 SDtfs, 81078 SDslu, 155624 SDs, 0 SdLazy, 89775 SolverSat, 4826 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 160.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5193 GetRequests, 2458 SyntacticMatches, 162 SemanticMatches, 2573 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165968 ImplicationChecksByTransitivity, 334.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149097occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.9s AbstIntTime, 14 AbstIntIterations, 2 AbstIntStrong, 0.9860295145084906 AbsIntWeakeningRatio, 1.3162790697674418 AbsIntAvgWeakeningVarsNumRemoved, 31.46046511627907 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 73.5s AutomataMinimizationTime, 55 MinimizatonAttempts, 3867418 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 45.0s InterpolantComputationTime, 6227 NumberOfCodeBlocks, 6227 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 7339 ConstructedInterpolants, 603 QuantifiedInterpolants, 10710867 SizeOfPredicates, 104 NumberOfNonLiveVariables, 8172 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 79 InterpolantComputations, 45 PerfectInterpolantSequences, 423/534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...