./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8903dcb91a7500453f98b743541ef164d589c2f5828e51ac11fb5ea90b79c3dd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:42,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:42,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:42,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:42,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:42,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:42,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:42,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:42,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:42,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:42,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:42,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:42,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:42,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:42,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:42,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:42,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:42,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:42,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:42,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:42,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:42,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:42,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:42,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:42,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:42,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:42,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:42,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:42,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:42,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:42,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:42,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:42,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:42,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:42,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:42,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:42,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:42,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:42,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:42,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:42,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:42,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:50:42,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:42,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:42,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:42,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:42,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:42,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:42,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:42,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:42,499 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:42,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:42,500 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:42,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:42,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:42,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:42,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:42,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:42,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:42,501 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:42,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:42,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:42,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:42,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:42,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:42,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:42,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:42,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:42,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:42,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:42,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:42,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:42,504 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:42,505 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:42,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:42,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8903dcb91a7500453f98b743541ef164d589c2f5828e51ac11fb5ea90b79c3dd [2022-02-20 18:50:42,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:42,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:42,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:42,773 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:42,773 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:42,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:50:42,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e650883df/861c6935bdaa47d586aaf725dbed7249/FLAG7eb464d36 [2022-02-20 18:50:43,191 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:43,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:50:43,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e650883df/861c6935bdaa47d586aaf725dbed7249/FLAG7eb464d36 [2022-02-20 18:50:43,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e650883df/861c6935bdaa47d586aaf725dbed7249 [2022-02-20 18:50:43,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:43,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:43,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:43,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:43,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:43,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37dc96b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:43, skipping insertion in model container [2022-02-20 18:50:43,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:43" (1/1) ... [2022-02-20 18:50:43,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:43,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:43,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7543,7556] [2022-02-20 18:50:43,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10430,10443] [2022-02-20 18:50:43,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11521,11534] [2022-02-20 18:50:43,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12127,12140] [2022-02-20 18:50:43,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13546,13559] [2022-02-20 18:50:43,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14152,14165] [2022-02-20 18:50:43,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15123,15136] [2022-02-20 18:50:43,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:43,917 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:43,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7543,7556] [2022-02-20 18:50:44,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10430,10443] [2022-02-20 18:50:44,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11521,11534] [2022-02-20 18:50:44,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12127,12140] [2022-02-20 18:50:44,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13546,13559] [2022-02-20 18:50:44,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14152,14165] [2022-02-20 18:50:44,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15123,15136] [2022-02-20 18:50:44,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:44,088 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:44,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44 WrapperNode [2022-02-20 18:50:44,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:44,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:44,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:44,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:44,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,170 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1018 [2022-02-20 18:50:44,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:44,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:44,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:44,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:44,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:44,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:44,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:44,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:44,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:44,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:44,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:50:44,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:50:44,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:44,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:44,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:44,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:44,446 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:44,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:45,325 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:45,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:45,333 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:45,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:45 BoogieIcfgContainer [2022-02-20 18:50:45,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:45,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:45,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:45,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:45,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:43" (1/3) ... [2022-02-20 18:50:45,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9f7ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:45, skipping insertion in model container [2022-02-20 18:50:45,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44" (2/3) ... [2022-02-20 18:50:45,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9f7ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:45, skipping insertion in model container [2022-02-20 18:50:45,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:45" (3/3) ... [2022-02-20 18:50:45,343 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2022-02-20 18:50:45,347 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:45,348 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 18:50:45,385 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:45,390 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:50:45,390 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 18:50:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 206 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:50:45,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:45,419 INFO L514 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] [2022-02-20 18:50:45,420 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:45,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1485336045, now seen corresponding path program 1 times [2022-02-20 18:50:45,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:45,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156244879] [2022-02-20 18:50:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:45,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {212#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:45,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {212#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:45,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {212#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:45,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {213#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:45,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {213#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {213#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:45,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {214#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {214#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {211#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {211#false} is VALID [2022-02-20 18:50:45,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {211#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~2#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~2#1 % 256 else main_~node2____CPAchecker_TMP_0~2#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {211#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {211#false} is VALID [2022-02-20 18:50:45,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {211#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~4#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~16#1; {211#false} is VALID [2022-02-20 18:50:45,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {211#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {211#false} is VALID [2022-02-20 18:50:45,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {211#false} assume !(~r1~0 >= 3); {211#false} is VALID [2022-02-20 18:50:45,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {211#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {211#false} is VALID [2022-02-20 18:50:45,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {211#false} assume ~r1~0 < 3;main_~check__tmp~16#1 := 1;~__return_1479~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_16~0#1;main_~__tmp_16~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~15#1;main_~assert__arg~15#1 := main_~__tmp_16~0#1; {211#false} is VALID [2022-02-20 18:50:45,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {211#false} assume !(0 == main_~assert__arg~15#1 % 256);main_~main____CPAchecker_TMP_0~9#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~9#1; {211#false} is VALID [2022-02-20 18:50:45,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {211#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {211#false} is VALID [2022-02-20 18:50:45,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {211#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {211#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {211#false} assume main_~node1__m1~1#1 != ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {211#false} assume !(main_~node1__m1~1#1 > ~id1~0); {211#false} is VALID [2022-02-20 18:50:45,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {211#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {211#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {211#false} assume main_~node2__m2~3#1 != ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {211#false} assume !(main_~node2__m2~3#1 > ~id2~0); {211#false} is VALID [2022-02-20 18:50:45,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {211#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {211#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {211#false} is VALID [2022-02-20 18:50:45,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {211#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {211#false} is VALID [2022-02-20 18:50:45,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {211#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {211#false} is VALID [2022-02-20 18:50:45,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {211#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2120~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2120~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {211#false} is VALID [2022-02-20 18:50:45,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {211#false} assume 0 == main_~assert__arg~8#1 % 256; {211#false} is VALID [2022-02-20 18:50:45,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-02-20 18:50:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:45,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:45,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156244879] [2022-02-20 18:50:45,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156244879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:45,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:45,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:45,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625774053] [2022-02-20 18:50:45,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:45,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:50:45,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:45,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:45,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:45,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:45,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:45,880 INFO L87 Difference]: Start difference. First operand has 207 states, 199 states have (on average 1.8241206030150754) internal successors, (363), 206 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:46,618 INFO L93 Difference]: Finished difference Result 339 states and 570 transitions. [2022-02-20 18:50:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:50:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-02-20 18:50:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-02-20 18:50:46,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-02-20 18:50:47,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:47,145 INFO L225 Difference]: With dead ends: 339 [2022-02-20 18:50:47,151 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 18:50:47,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:47,158 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 847 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:47,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [847 Valid, 224 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 18:50:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-02-20 18:50:47,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:47,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 175 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 174 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,261 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 175 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 174 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,261 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 175 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 174 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,270 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-02-20 18:50:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-02-20 18:50:47,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:47,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:47,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 174 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 175 states. [2022-02-20 18:50:47,277 INFO L87 Difference]: Start difference. First operand has 175 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 174 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 175 states. [2022-02-20 18:50:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,285 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-02-20 18:50:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-02-20 18:50:47,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:47,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:47,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:47,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 174 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2022-02-20 18:50:47,295 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 47 [2022-02-20 18:50:47,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:47,296 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2022-02-20 18:50:47,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-02-20 18:50:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:47,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:47,298 INFO L514 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] [2022-02-20 18:50:47,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:47,299 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash 200422799, now seen corresponding path program 1 times [2022-02-20 18:50:47,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:47,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470108255] [2022-02-20 18:50:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:47,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:47,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {1187#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1187#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {1187#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {1187#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1187#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {1187#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1187#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1187#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1187#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1188#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:47,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {1188#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:47,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1189#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {1189#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {1186#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {1186#false} is VALID [2022-02-20 18:50:47,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {1186#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {1186#false} is VALID [2022-02-20 18:50:47,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1186#false} is VALID [2022-02-20 18:50:47,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} assume !(~r1~0 >= 3); {1186#false} is VALID [2022-02-20 18:50:47,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1186#false} is VALID [2022-02-20 18:50:47,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} assume ~r1~0 < 3;main_~check__tmp~12#1 := 1;~__return_1988~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_1988~0;havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~11#1;main_~assert__arg~11#1 := main_~__tmp_12~0#1; {1186#false} is VALID [2022-02-20 18:50:47,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} assume !(0 == main_~assert__arg~11#1 % 256);main_~main____CPAchecker_TMP_0~5#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~5#1; {1186#false} is VALID [2022-02-20 18:50:47,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {1186#false} is VALID [2022-02-20 18:50:47,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} assume main_~node1__m1~1#1 != ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} assume !(main_~node1__m1~1#1 > ~id1~0); {1186#false} is VALID [2022-02-20 18:50:47,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {1186#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {1186#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {1186#false} assume main_~node2__m2~3#1 != ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {1186#false} assume !(main_~node2__m2~3#1 > ~id2~0); {1186#false} is VALID [2022-02-20 18:50:47,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {1186#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {1186#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1186#false} is VALID [2022-02-20 18:50:47,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {1186#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {1186#false} is VALID [2022-02-20 18:50:47,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {1186#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {1186#false} is VALID [2022-02-20 18:50:47,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {1186#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2120~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2120~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {1186#false} is VALID [2022-02-20 18:50:47,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {1186#false} assume 0 == main_~assert__arg~8#1 % 256; {1186#false} is VALID [2022-02-20 18:50:47,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {1186#false} assume !false; {1186#false} is VALID [2022-02-20 18:50:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:47,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:47,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470108255] [2022-02-20 18:50:47,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470108255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:47,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:47,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:47,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101821850] [2022-02-20 18:50:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:47,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:47,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:47,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:47,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:47,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:47,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:47,486 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,963 INFO L93 Difference]: Finished difference Result 298 states and 377 transitions. [2022-02-20 18:50:47,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:47,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:47,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 377 transitions. [2022-02-20 18:50:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 377 transitions. [2022-02-20 18:50:47,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 377 transitions. [2022-02-20 18:50:48,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:48,267 INFO L225 Difference]: With dead ends: 298 [2022-02-20 18:50:48,268 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 18:50:48,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:48,269 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 551 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:48,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:48,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 18:50:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-02-20 18:50:48,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:48,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 162 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,391 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 162 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,397 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 162 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,402 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2022-02-20 18:50:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2022-02-20 18:50:48,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:48,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:48,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 162 states. [2022-02-20 18:50:48,404 INFO L87 Difference]: Start difference. First operand has 162 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 162 states. [2022-02-20 18:50:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,409 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2022-02-20 18:50:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2022-02-20 18:50:48,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:48,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:48,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:48,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2022-02-20 18:50:48,419 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 48 [2022-02-20 18:50:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:48,420 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2022-02-20 18:50:48,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2022-02-20 18:50:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:48,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:48,421 INFO L514 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] [2022-02-20 18:50:48,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:48,422 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2021523794, now seen corresponding path program 1 times [2022-02-20 18:50:48,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:48,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015408653] [2022-02-20 18:50:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:48,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {2076#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {2078#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:48,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {2078#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {2079#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:48,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {2079#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {2079#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:48,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {2079#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2080#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:48,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {2080#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~10#1; {2077#false} is VALID [2022-02-20 18:50:48,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {2077#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2077#false} is VALID [2022-02-20 18:50:48,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {2077#false} assume !(~r1~0 >= 3); {2077#false} is VALID [2022-02-20 18:50:48,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {2077#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2077#false} is VALID [2022-02-20 18:50:48,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {2077#false} assume ~r1~0 < 3;main_~check__tmp~10#1 := 1;~__return_2167~0 := main_~check__tmp~10#1;main_~main__c1~0#1 := ~__return_2167~0;havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~9#1;main_~assert__arg~9#1 := main_~__tmp_10~0#1; {2077#false} is VALID [2022-02-20 18:50:48,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {2077#false} assume !(0 == main_~assert__arg~9#1 % 256);main_~main____CPAchecker_TMP_0~3#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~3#1; {2077#false} is VALID [2022-02-20 18:50:48,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {2077#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {2077#false} is VALID [2022-02-20 18:50:48,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {2077#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2077#false} is VALID [2022-02-20 18:50:48,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {2077#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2077#false} is VALID [2022-02-20 18:50:48,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {2077#false} assume main_~node1__m1~1#1 != ~nomsg~0; {2077#false} is VALID [2022-02-20 18:50:48,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {2077#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2077#false} is VALID [2022-02-20 18:50:48,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {2077#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {2077#false} is VALID [2022-02-20 18:50:48,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {2077#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2077#false} is VALID [2022-02-20 18:50:48,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {2077#false} assume main_~node2__m2~3#1 != ~nomsg~0; {2077#false} is VALID [2022-02-20 18:50:48,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {2077#false} assume !(main_~node2__m2~3#1 > ~id2~0); {2077#false} is VALID [2022-02-20 18:50:48,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {2077#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {2077#false} is VALID [2022-02-20 18:50:48,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {2077#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2077#false} is VALID [2022-02-20 18:50:48,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {2077#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {2077#false} is VALID [2022-02-20 18:50:48,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {2077#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {2077#false} is VALID [2022-02-20 18:50:48,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {2077#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2120~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2120~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {2077#false} is VALID [2022-02-20 18:50:48,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {2077#false} assume 0 == main_~assert__arg~8#1 % 256; {2077#false} is VALID [2022-02-20 18:50:48,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {2077#false} assume !false; {2077#false} is VALID [2022-02-20 18:50:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:48,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:48,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015408653] [2022-02-20 18:50:48,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015408653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:48,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:48,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:48,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496994365] [2022-02-20 18:50:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:50:48,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:48,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:48,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:48,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:48,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:48,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:48,630 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,140 INFO L93 Difference]: Finished difference Result 285 states and 360 transitions. [2022-02-20 18:50:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:49,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:50:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-02-20 18:50:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-02-20 18:50:49,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 360 transitions. [2022-02-20 18:50:49,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:49,401 INFO L225 Difference]: With dead ends: 285 [2022-02-20 18:50:49,402 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 18:50:49,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:49,403 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 513 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:49,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 128 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 18:50:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-02-20 18:50:49,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:49,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,513 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,513 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,517 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2022-02-20 18:50:49,517 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2022-02-20 18:50:49,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 157 states. [2022-02-20 18:50:49,519 INFO L87 Difference]: Start difference. First operand has 157 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 157 states. [2022-02-20 18:50:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,523 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2022-02-20 18:50:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2022-02-20 18:50:49,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:49,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2022-02-20 18:50:49,528 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 49 [2022-02-20 18:50:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:49,529 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2022-02-20 18:50:49,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2022-02-20 18:50:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:49,530 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:49,530 INFO L514 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] [2022-02-20 18:50:49,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:49,530 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:49,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1243075504, now seen corresponding path program 1 times [2022-02-20 18:50:49,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:49,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020716048] [2022-02-20 18:50:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:49,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {2939#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {2941#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:49,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2941#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {2943#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {2943#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {2943#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {2943#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:49,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {2944#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2945#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:49,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {2945#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2945#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:49,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {2945#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {2945#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:49,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {2945#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {2946#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:49,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {2946#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2947#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:50:49,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {2947#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {2940#false} is VALID [2022-02-20 18:50:49,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {2940#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {2940#false} is VALID [2022-02-20 18:50:49,755 INFO L290 TraceCheckUtils]: 47: Hoare triple {2940#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2120~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2120~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {2940#false} is VALID [2022-02-20 18:50:49,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {2940#false} assume 0 == main_~assert__arg~8#1 % 256; {2940#false} is VALID [2022-02-20 18:50:49,756 INFO L290 TraceCheckUtils]: 49: Hoare triple {2940#false} assume !false; {2940#false} is VALID [2022-02-20 18:50:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:49,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:49,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020716048] [2022-02-20 18:50:49,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020716048] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:49,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:49,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:49,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566970040] [2022-02-20 18:50:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:49,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:49,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:49,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:49,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:49,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:49,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:49,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:49,807 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,022 INFO L93 Difference]: Finished difference Result 332 states and 431 transitions. [2022-02-20 18:50:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:52,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 431 transitions. [2022-02-20 18:50:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 431 transitions. [2022-02-20 18:50:52,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 431 transitions. [2022-02-20 18:50:52,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:52,374 INFO L225 Difference]: With dead ends: 332 [2022-02-20 18:50:52,374 INFO L226 Difference]: Without dead ends: 327 [2022-02-20 18:50:52,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:50:52,375 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 1198 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:52,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 607 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:50:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-02-20 18:50:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 157. [2022-02-20 18:50:52,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:52,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 157 states, 150 states have (on average 1.28) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,552 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 157 states, 150 states have (on average 1.28) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,552 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 157 states, 150 states have (on average 1.28) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,562 INFO L93 Difference]: Finished difference Result 327 states and 426 transitions. [2022-02-20 18:50:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 426 transitions. [2022-02-20 18:50:52,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:52,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:52,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 150 states have (on average 1.28) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 327 states. [2022-02-20 18:50:52,564 INFO L87 Difference]: Start difference. First operand has 157 states, 150 states have (on average 1.28) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 327 states. [2022-02-20 18:50:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,572 INFO L93 Difference]: Finished difference Result 327 states and 426 transitions. [2022-02-20 18:50:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 426 transitions. [2022-02-20 18:50:52,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:52,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:52,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:52,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.28) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2022-02-20 18:50:52,577 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 50 [2022-02-20 18:50:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:52,578 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2022-02-20 18:50:52,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2022-02-20 18:50:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:52,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:52,579 INFO L514 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] [2022-02-20 18:50:52,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:52,579 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1139694690, now seen corresponding path program 1 times [2022-02-20 18:50:52,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:52,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304501943] [2022-02-20 18:50:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:52,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {4247#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {4249#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:52,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {4249#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {4250#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {4250#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {4250#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {4250#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {4251#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {4251#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {4251#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {4251#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:52,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {4252#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4253#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:52,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {4253#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4253#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:52,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {4253#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {4253#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:52,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {4253#(not (= ~nomsg~0 ~p1_new~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4253#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:52,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {4253#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4253#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:52,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {4253#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {4253#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:52,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {4253#(not (= ~nomsg~0 ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {4254#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:52,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {4254#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4255#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:50:52,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {4255#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {4248#false} is VALID [2022-02-20 18:50:52,767 INFO L290 TraceCheckUtils]: 42: Hoare triple {4248#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {4248#false} is VALID [2022-02-20 18:50:52,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {4248#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4248#false} is VALID [2022-02-20 18:50:52,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {4248#false} assume main_~node3__m3~4#1 != ~nomsg~0; {4248#false} is VALID [2022-02-20 18:50:52,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {4248#false} assume !(main_~node3__m3~4#1 > ~id3~0); {4248#false} is VALID [2022-02-20 18:50:52,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {4248#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {4248#false} is VALID [2022-02-20 18:50:52,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {4248#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1925~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1925~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {4248#false} is VALID [2022-02-20 18:50:52,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {4248#false} assume 0 == main_~assert__arg~7#1 % 256; {4248#false} is VALID [2022-02-20 18:50:52,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {4248#false} assume !false; {4248#false} is VALID [2022-02-20 18:50:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:52,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:52,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304501943] [2022-02-20 18:50:52,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304501943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:52,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:52,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:52,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013953115] [2022-02-20 18:50:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:52,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:52,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:52,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:52,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:52,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:52,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:52,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:52,810 INFO L87 Difference]: Start difference. First operand 157 states and 192 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,143 INFO L93 Difference]: Finished difference Result 391 states and 514 transitions. [2022-02-20 18:50:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:55,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 514 transitions. [2022-02-20 18:50:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 514 transitions. [2022-02-20 18:50:55,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 514 transitions. [2022-02-20 18:50:55,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:55,547 INFO L225 Difference]: With dead ends: 391 [2022-02-20 18:50:55,547 INFO L226 Difference]: Without dead ends: 331 [2022-02-20 18:50:55,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:55,549 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 1041 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:55,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1041 Valid, 810 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:50:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-20 18:50:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 157. [2022-02-20 18:50:55,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:55,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 157 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,749 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 157 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,750 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 157 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,758 INFO L93 Difference]: Finished difference Result 331 states and 431 transitions. [2022-02-20 18:50:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 431 transitions. [2022-02-20 18:50:55,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:55,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:55,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 331 states. [2022-02-20 18:50:55,760 INFO L87 Difference]: Start difference. First operand has 157 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 331 states. [2022-02-20 18:50:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,768 INFO L93 Difference]: Finished difference Result 331 states and 431 transitions. [2022-02-20 18:50:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 431 transitions. [2022-02-20 18:50:55,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:55,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:55,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:55,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2022-02-20 18:50:55,773 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 50 [2022-02-20 18:50:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:55,773 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2022-02-20 18:50:55,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2022-02-20 18:50:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:55,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:55,774 INFO L514 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] [2022-02-20 18:50:55,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:55,775 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash 134088220, now seen corresponding path program 1 times [2022-02-20 18:50:55,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:55,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418565893] [2022-02-20 18:50:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:55,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {5639#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {5641#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:55,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {5641#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {5642#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {5643#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {5643#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {5643#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {5643#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:55,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {5644#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5645#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:55,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {5645#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5645#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:55,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {5645#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 3); {5645#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:55,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {5645#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5645#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:55,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {5645#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {5645#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:55,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {5645#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {5645#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:55,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {5645#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {5645#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:55,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {5645#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {5645#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:55,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {5645#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5646#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:50:55,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {5646#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {5640#false} is VALID [2022-02-20 18:50:55,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {5640#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {5640#false} is VALID [2022-02-20 18:50:55,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {5640#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5640#false} is VALID [2022-02-20 18:50:55,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {5640#false} assume main_~node2__m2~1#1 != ~nomsg~0; {5640#false} is VALID [2022-02-20 18:50:55,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {5640#false} assume !(main_~node2__m2~1#1 > ~id2~0); {5640#false} is VALID [2022-02-20 18:50:55,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {5640#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {5640#false} is VALID [2022-02-20 18:50:55,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {5640#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5640#false} is VALID [2022-02-20 18:50:55,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {5640#false} assume main_~node3__m3~3#1 != ~nomsg~0; {5640#false} is VALID [2022-02-20 18:50:55,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {5640#false} assume !(main_~node3__m3~3#1 > ~id3~0); {5640#false} is VALID [2022-02-20 18:50:55,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {5640#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {5640#false} is VALID [2022-02-20 18:50:55,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {5640#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2203~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2203~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {5640#false} is VALID [2022-02-20 18:50:55,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {5640#false} assume 0 == main_~assert__arg~5#1 % 256; {5640#false} is VALID [2022-02-20 18:50:55,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {5640#false} assume !false; {5640#false} is VALID [2022-02-20 18:50:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:55,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:55,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418565893] [2022-02-20 18:50:55,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418565893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:55,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:55,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:50:55,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296240640] [2022-02-20 18:50:55,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:55,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:55,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:56,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:56,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:50:56,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:56,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:50:56,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:56,003 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,237 INFO L93 Difference]: Finished difference Result 312 states and 389 transitions. [2022-02-20 18:50:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:50:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 389 transitions. [2022-02-20 18:50:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 389 transitions. [2022-02-20 18:50:57,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 389 transitions. [2022-02-20 18:50:57,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:57,543 INFO L225 Difference]: With dead ends: 312 [2022-02-20 18:50:57,543 INFO L226 Difference]: Without dead ends: 229 [2022-02-20 18:50:57,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:50:57,548 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 837 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:57,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [837 Valid, 428 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-02-20 18:50:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 157. [2022-02-20 18:50:57,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:57,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 157 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 156 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,744 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 157 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 156 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,745 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 157 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 156 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,749 INFO L93 Difference]: Finished difference Result 229 states and 279 transitions. [2022-02-20 18:50:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 279 transitions. [2022-02-20 18:50:57,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 156 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 229 states. [2022-02-20 18:50:57,751 INFO L87 Difference]: Start difference. First operand has 157 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 156 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 229 states. [2022-02-20 18:50:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,755 INFO L93 Difference]: Finished difference Result 229 states and 279 transitions. [2022-02-20 18:50:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 279 transitions. [2022-02-20 18:50:57,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:57,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 156 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2022-02-20 18:50:57,760 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 50 [2022-02-20 18:50:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:57,760 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2022-02-20 18:50:57,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2022-02-20 18:50:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:57,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:57,761 INFO L514 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] [2022-02-20 18:50:57,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:57,761 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1263855603, now seen corresponding path program 1 times [2022-02-20 18:50:57,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:57,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730649437] [2022-02-20 18:50:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:57,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:58,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {6701#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {6701#true} is VALID [2022-02-20 18:50:58,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {6701#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:58,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:58,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:58,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:58,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:58,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:58,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {6703#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {6704#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:58,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {6704#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {6704#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:58,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {6704#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {6705#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:50:58,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {6705#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode2~0 % 256; {6705#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:50:58,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {6705#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id3~0 >= 0; {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:50:58,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~st3~0; {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:50:58,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send3~0 == ~id3~0; {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:50:58,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode3~0 % 256; {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:50:58,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id2~0; {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:50:58,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id3~0; {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:50:58,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {6706#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:50:58,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:50:58,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:50:58,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:50:58,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~send1~0 != ~nomsg~0; {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:50:58,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:50:58,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:50:58,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~send2~0 != ~nomsg~0; {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:50:58,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {6707#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6708#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:50:58,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {6708#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6708#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:50:58,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {6708#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {6708#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:50:58,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {6708#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(~r1~0 >= 3); {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 != ~nomsg~0; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node1__m1~1#1 > ~id1~0); {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~3#1 != ~nomsg~0; {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:50:58,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {6709#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {6710#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:58,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {6710#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {6710#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:58,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {6710#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6710#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:58,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {6710#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6711#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} is VALID [2022-02-20 18:50:58,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {6711#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {6711#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} is VALID [2022-02-20 18:50:58,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {6711#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {6712#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:50:58,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {6712#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {6702#false} is VALID [2022-02-20 18:50:58,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {6702#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1925~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1925~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {6702#false} is VALID [2022-02-20 18:50:58,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {6702#false} assume 0 == main_~assert__arg~7#1 % 256; {6702#false} is VALID [2022-02-20 18:50:58,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {6702#false} assume !false; {6702#false} is VALID [2022-02-20 18:50:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:58,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:58,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730649437] [2022-02-20 18:50:58,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730649437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:58,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:58,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:58,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660673978] [2022-02-20 18:50:58,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:58,173 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:50:58,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:58,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:58,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:58,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:58,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:58,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:58,215 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,685 INFO L93 Difference]: Finished difference Result 292 states and 367 transitions. [2022-02-20 18:51:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:00,685 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 367 transitions. [2022-02-20 18:51:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 367 transitions. [2022-02-20 18:51:00,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 367 transitions. [2022-02-20 18:51:00,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,992 INFO L225 Difference]: With dead ends: 292 [2022-02-20 18:51:00,992 INFO L226 Difference]: Without dead ends: 245 [2022-02-20 18:51:00,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:51:00,993 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 1045 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:00,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 885 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-02-20 18:51:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 153. [2022-02-20 18:51:01,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:01,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 153 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 152 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,328 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 153 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 152 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,329 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 153 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 152 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:01,333 INFO L93 Difference]: Finished difference Result 245 states and 298 transitions. [2022-02-20 18:51:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 298 transitions. [2022-02-20 18:51:01,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:01,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:01,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 152 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 245 states. [2022-02-20 18:51:01,335 INFO L87 Difference]: Start difference. First operand has 153 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 152 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 245 states. [2022-02-20 18:51:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:01,339 INFO L93 Difference]: Finished difference Result 245 states and 298 transitions. [2022-02-20 18:51:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 298 transitions. [2022-02-20 18:51:01,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:01,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:01,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:01,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 152 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 185 transitions. [2022-02-20 18:51:01,343 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 185 transitions. Word has length 52 [2022-02-20 18:51:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:01,344 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 185 transitions. [2022-02-20 18:51:01,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 185 transitions. [2022-02-20 18:51:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:01,345 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:01,345 INFO L514 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] [2022-02-20 18:51:01,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:51:01,345 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:01,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1250594545, now seen corresponding path program 1 times [2022-02-20 18:51:01,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:01,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758713149] [2022-02-20 18:51:01,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:01,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:01,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {7783#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {7783#true} is VALID [2022-02-20 18:51:01,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {7783#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {7785#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:01,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {7785#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {7785#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:01,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {7785#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {7786#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:01,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {7786#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {7786#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:01,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {7786#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {7787#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} is VALID [2022-02-20 18:51:01,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {7787#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} assume 0 == ~mode1~0 % 256; {7787#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} is VALID [2022-02-20 18:51:01,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {7787#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} assume ~id2~0 >= 0; {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:01,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~st2~0; {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:01,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:01,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:01,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:01,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:01,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:01,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~mode3~0 % 256; {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:01,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {7788#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~id1~0 != ~id2~0; {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:01,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~id1~0 != ~id3~0; {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:01,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:01,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:01,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:01,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:01,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~send1~0 != ~nomsg~0; {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:01,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {7789#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:01,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:01,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:01,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:01,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:01,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:01,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {7790#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 >= 3); {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {7791#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {7792#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:01,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {7792#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7793#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:01,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {7793#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {7793#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:01,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {7793#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {7794#(<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {7794#(<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0)} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {7784#false} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {7784#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7784#false} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {7784#false} assume main_~node3__m3~5#1 != ~nomsg~0; {7784#false} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {7784#false} assume main_~node3__m3~5#1 > ~id3~0;~send3~0 := main_~node3__m3~5#1; {7784#false} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {7784#false} ~mode3~0 := 0; {7784#false} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {7784#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {7784#false} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {7784#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2120~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2120~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {7784#false} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {7784#false} assume 0 == main_~assert__arg~8#1 % 256; {7784#false} is VALID [2022-02-20 18:51:01,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {7784#false} assume !false; {7784#false} is VALID [2022-02-20 18:51:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:01,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:01,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758713149] [2022-02-20 18:51:01,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758713149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:01,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:01,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:01,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760896312] [2022-02-20 18:51:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:01,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:01,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:01,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:01,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:01,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:01,779 INFO L87 Difference]: Start difference. First operand 153 states and 185 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:04,486 INFO L93 Difference]: Finished difference Result 294 states and 373 transitions. [2022-02-20 18:51:04,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:51:04,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 373 transitions. [2022-02-20 18:51:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 373 transitions. [2022-02-20 18:51:04,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 373 transitions. [2022-02-20 18:51:04,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:04,835 INFO L225 Difference]: With dead ends: 294 [2022-02-20 18:51:04,836 INFO L226 Difference]: Without dead ends: 240 [2022-02-20 18:51:04,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:04,837 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 687 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:04,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [687 Valid, 1664 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-02-20 18:51:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 142. [2022-02-20 18:51:05,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:05,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 142 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,322 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 142 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,322 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 142 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,326 INFO L93 Difference]: Finished difference Result 240 states and 297 transitions. [2022-02-20 18:51:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 297 transitions. [2022-02-20 18:51:05,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:05,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:05,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 240 states. [2022-02-20 18:51:05,328 INFO L87 Difference]: Start difference. First operand has 142 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 240 states. [2022-02-20 18:51:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,333 INFO L93 Difference]: Finished difference Result 240 states and 297 transitions. [2022-02-20 18:51:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 297 transitions. [2022-02-20 18:51:05,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:05,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:05,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:05,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2022-02-20 18:51:05,337 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 52 [2022-02-20 18:51:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:05,337 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2022-02-20 18:51:05,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-02-20 18:51:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:05,338 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:05,338 INFO L514 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] [2022-02-20 18:51:05,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:51:05,339 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1706910886, now seen corresponding path program 1 times [2022-02-20 18:51:05,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:05,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706184973] [2022-02-20 18:51:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:05,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {8840#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {8840#true} is VALID [2022-02-20 18:51:05,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {8840#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {8842#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {8843#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {8843#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {8843#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:05,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {8843#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {8844#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:05,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {8844#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode2~0 % 256; {8844#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:05,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {8844#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id3~0 >= 0; {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:05,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~st3~0; {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:05,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send3~0 == ~id3~0; {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:05,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode3~0 % 256; {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:05,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id2~0; {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:05,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id3~0; {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:05,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {8845#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:05,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:05,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:05,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:05,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~send1~0 != ~nomsg~0; {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:05,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:05,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:05,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~send2~0 != ~nomsg~0; {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:05,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {8846#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8847#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:05,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {8847#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8847#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:05,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {8847#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {8847#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:05,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {8847#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(~r1~0 >= 3); {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 != ~nomsg~0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} ~mode1~0 := 0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~1#1 != ~nomsg~0; {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node2__m2~1#1 > ~id2~0); {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:05,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {8848#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {8849#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:05,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {8849#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8850#(or (<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:51:05,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {8850#(or (<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~3#1|))} assume main_~node3__m3~3#1 != ~nomsg~0; {8850#(or (<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:51:05,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {8850#(or (<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~3#1|))} assume !(main_~node3__m3~3#1 > ~id3~0); {8851#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:05,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {8851#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {8841#false} is VALID [2022-02-20 18:51:05,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {8841#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2203~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2203~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {8841#false} is VALID [2022-02-20 18:51:05,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {8841#false} assume 0 == main_~assert__arg~5#1 % 256; {8841#false} is VALID [2022-02-20 18:51:05,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {8841#false} assume !false; {8841#false} is VALID [2022-02-20 18:51:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:05,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:05,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706184973] [2022-02-20 18:51:05,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706184973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:05,779 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:05,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:05,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146891781] [2022-02-20 18:51:05,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:05,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:05,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:05,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:05,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:05,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:05,832 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:08,331 INFO L93 Difference]: Finished difference Result 226 states and 278 transitions. [2022-02-20 18:51:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:51:08,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 278 transitions. [2022-02-20 18:51:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 278 transitions. [2022-02-20 18:51:08,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 278 transitions. [2022-02-20 18:51:08,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:08,567 INFO L225 Difference]: With dead ends: 226 [2022-02-20 18:51:08,567 INFO L226 Difference]: Without dead ends: 222 [2022-02-20 18:51:08,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:08,568 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 813 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:08,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 895 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-02-20 18:51:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2022-02-20 18:51:09,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:09,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 138 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 137 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,007 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 138 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 137 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,007 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 138 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 137 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,010 INFO L93 Difference]: Finished difference Result 222 states and 274 transitions. [2022-02-20 18:51:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 274 transitions. [2022-02-20 18:51:09,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:09,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:09,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 137 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 222 states. [2022-02-20 18:51:09,011 INFO L87 Difference]: Start difference. First operand has 138 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 137 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 222 states. [2022-02-20 18:51:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,014 INFO L93 Difference]: Finished difference Result 222 states and 274 transitions. [2022-02-20 18:51:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 274 transitions. [2022-02-20 18:51:09,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:09,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:09,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:09,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 137 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2022-02-20 18:51:09,018 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 52 [2022-02-20 18:51:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:09,018 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2022-02-20 18:51:09,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2022-02-20 18:51:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:51:09,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:09,019 INFO L514 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] [2022-02-20 18:51:09,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:09,019 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash 190692674, now seen corresponding path program 1 times [2022-02-20 18:51:09,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:09,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433810752] [2022-02-20 18:51:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:09,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {9768#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {9770#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:09,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {9770#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:09,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:09,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:09,259 INFO L290 TraceCheckUtils]: 4: Hoare triple {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:09,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:09,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:09,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {9771#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {9772#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:09,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {9772#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {9772#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:09,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {9772#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode2~0 % 256; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id3~0 >= 0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~st3~0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send3~0 == ~id3~0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode3~0 % 256; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id2~0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id3~0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send1~0 != ~nomsg~0; {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:09,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {9773#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {9774#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:51:09,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {9774#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9774#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:51:09,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {9774#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume ~send2~0 != ~nomsg~0; {9774#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:51:09,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {9774#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {9775#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:09,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {9775#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9775#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:09,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {9775#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~send3~0 != ~nomsg~0; {9775#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:09,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {9775#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(~r1~0 >= 3); {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {9776#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9777#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {9777#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node2__m2~3#1 != ~nomsg~0; {9777#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:09,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {9777#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {9778#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:09,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {9778#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {9778#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:09,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {9778#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {9778#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:09,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {9778#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9779#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:51:09,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {9779#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {9769#false} is VALID [2022-02-20 18:51:09,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {9769#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {9769#false} is VALID [2022-02-20 18:51:09,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {9769#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9769#false} is VALID [2022-02-20 18:51:09,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {9769#false} assume !(~r1~0 >= 3); {9769#false} is VALID [2022-02-20 18:51:09,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {9769#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1770~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1770~0;havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~6#1;main_~assert__arg~6#1 := main_~__tmp_7~0#1; {9769#false} is VALID [2022-02-20 18:51:09,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {9769#false} assume 0 == main_~assert__arg~6#1 % 256; {9769#false} is VALID [2022-02-20 18:51:09,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {9769#false} assume !false; {9769#false} is VALID [2022-02-20 18:51:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:09,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:09,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433810752] [2022-02-20 18:51:09,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433810752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:09,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:09,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:51:09,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80650181] [2022-02-20 18:51:09,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:51:09,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:09,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:09,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:09,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:09,323 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:13,374 INFO L93 Difference]: Finished difference Result 350 states and 453 transitions. [2022-02-20 18:51:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:51:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:51:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 453 transitions. [2022-02-20 18:51:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 453 transitions. [2022-02-20 18:51:13,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 453 transitions. [2022-02-20 18:51:13,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:13,788 INFO L225 Difference]: With dead ends: 350 [2022-02-20 18:51:13,788 INFO L226 Difference]: Without dead ends: 343 [2022-02-20 18:51:13,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2022-02-20 18:51:13,789 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 1746 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:13,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1746 Valid, 567 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:51:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-02-20 18:51:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 142. [2022-02-20 18:51:14,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:14,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 142 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,300 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 142 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,301 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 142 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:14,307 INFO L93 Difference]: Finished difference Result 343 states and 446 transitions. [2022-02-20 18:51:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 446 transitions. [2022-02-20 18:51:14,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:14,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:14,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 343 states. [2022-02-20 18:51:14,309 INFO L87 Difference]: Start difference. First operand has 142 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 343 states. [2022-02-20 18:51:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:14,316 INFO L93 Difference]: Finished difference Result 343 states and 446 transitions. [2022-02-20 18:51:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 446 transitions. [2022-02-20 18:51:14,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:14,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:14,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:14,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2022-02-20 18:51:14,320 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 53 [2022-02-20 18:51:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:14,320 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2022-02-20 18:51:14,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-02-20 18:51:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:51:14,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:14,321 INFO L514 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] [2022-02-20 18:51:14,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:14,321 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash -659119293, now seen corresponding path program 1 times [2022-02-20 18:51:14,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:14,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803850456] [2022-02-20 18:51:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:14,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {11137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {11139#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:14,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {11139#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {11140#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {11141#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {11141#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {11141#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {11141#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:14,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {11142#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11143#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:14,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {11143#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11143#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:14,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {11143#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {11143#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:14,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {11143#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {11144#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:14,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {11144#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11145#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:51:14,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {11145#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} assume !(main_~node3__m3~3#1 != ~nomsg~0);~mode3~0 := 0; {11138#false} is VALID [2022-02-20 18:51:14,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {11138#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~4#1; {11138#false} is VALID [2022-02-20 18:51:14,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {11138#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11138#false} is VALID [2022-02-20 18:51:14,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {11138#false} assume !(~r1~0 >= 3); {11138#false} is VALID [2022-02-20 18:51:14,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {11138#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~4#1 := 0;~__return_2039~0 := main_~check__tmp~4#1;main_~main__c1~0#1 := ~__return_2039~0;havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~4#1;main_~assert__arg~4#1 := main_~__tmp_5~0#1; {11138#false} is VALID [2022-02-20 18:51:14,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {11138#false} assume 0 == main_~assert__arg~4#1 % 256; {11138#false} is VALID [2022-02-20 18:51:14,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {11138#false} assume !false; {11138#false} is VALID [2022-02-20 18:51:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:14,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:14,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803850456] [2022-02-20 18:51:14,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803850456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:14,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:14,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:14,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820462570] [2022-02-20 18:51:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:14,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:51:14,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:14,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:14,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:14,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:14,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:14,536 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:16,501 INFO L93 Difference]: Finished difference Result 223 states and 274 transitions. [2022-02-20 18:51:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:51:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:51:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 274 transitions. [2022-02-20 18:51:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 274 transitions. [2022-02-20 18:51:16,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 274 transitions. [2022-02-20 18:51:16,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:16,713 INFO L225 Difference]: With dead ends: 223 [2022-02-20 18:51:16,713 INFO L226 Difference]: Without dead ends: 216 [2022-02-20 18:51:16,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:16,714 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 920 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:16,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [920 Valid, 424 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-20 18:51:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 142. [2022-02-20 18:51:17,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:17,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 142 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 141 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,269 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 142 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 141 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,271 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 142 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 141 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,274 INFO L93 Difference]: Finished difference Result 216 states and 267 transitions. [2022-02-20 18:51:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 267 transitions. [2022-02-20 18:51:17,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:17,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:17,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 141 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 216 states. [2022-02-20 18:51:17,276 INFO L87 Difference]: Start difference. First operand has 142 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 141 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 216 states. [2022-02-20 18:51:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,279 INFO L93 Difference]: Finished difference Result 216 states and 267 transitions. [2022-02-20 18:51:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 267 transitions. [2022-02-20 18:51:17,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:17,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:17,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:17,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 141 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 171 transitions. [2022-02-20 18:51:17,282 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 171 transitions. Word has length 53 [2022-02-20 18:51:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:17,282 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 171 transitions. [2022-02-20 18:51:17,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 171 transitions. [2022-02-20 18:51:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:51:17,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:17,283 INFO L514 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] [2022-02-20 18:51:17,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:17,284 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash 339917441, now seen corresponding path program 1 times [2022-02-20 18:51:17,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:17,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801023784] [2022-02-20 18:51:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:17,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:17,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {12055#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {12057#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:17,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {12057#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {12058#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {12058#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {12058#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {12058#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {12059#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {12059#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {12059#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {12059#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:17,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {12060#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12061#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:17,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {12061#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12061#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:17,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {12061#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {12061#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:17,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {12061#(not (= ~nomsg~0 ~p1_new~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12061#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:17,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {12061#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12061#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:17,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {12061#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {12061#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:17,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {12061#(not (= ~nomsg~0 ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12062#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:17,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {12062#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12063#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:17,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {12063#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {12056#false} is VALID [2022-02-20 18:51:17,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {12056#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12056#false} is VALID [2022-02-20 18:51:17,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {12056#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12056#false} is VALID [2022-02-20 18:51:17,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {12056#false} assume main_~node3__m3~1#1 != ~nomsg~0; {12056#false} is VALID [2022-02-20 18:51:17,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {12056#false} assume !(main_~node3__m3~1#1 > ~id3~0); {12056#false} is VALID [2022-02-20 18:51:17,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {12056#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {12056#false} is VALID [2022-02-20 18:51:17,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {12056#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12056#false} is VALID [2022-02-20 18:51:17,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {12056#false} assume !(~r1~0 >= 3); {12056#false} is VALID [2022-02-20 18:51:17,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {12056#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1856~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1856~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {12056#false} is VALID [2022-02-20 18:51:17,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {12056#false} assume 0 == main_~assert__arg~3#1 % 256; {12056#false} is VALID [2022-02-20 18:51:17,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {12056#false} assume !false; {12056#false} is VALID [2022-02-20 18:51:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:17,415 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:17,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801023784] [2022-02-20 18:51:17,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801023784] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:17,416 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:17,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:17,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787124857] [2022-02-20 18:51:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:17,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:51:17,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:17,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:17,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:17,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:17,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:17,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:17,454 INFO L87 Difference]: Start difference. First operand 142 states and 171 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:19,380 INFO L93 Difference]: Finished difference Result 285 states and 361 transitions. [2022-02-20 18:51:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:51:19,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:51:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 357 transitions. [2022-02-20 18:51:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 357 transitions. [2022-02-20 18:51:19,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 357 transitions. [2022-02-20 18:51:19,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:19,633 INFO L225 Difference]: With dead ends: 285 [2022-02-20 18:51:19,633 INFO L226 Difference]: Without dead ends: 224 [2022-02-20 18:51:19,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:51:19,634 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 752 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:19,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 539 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-02-20 18:51:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 142. [2022-02-20 18:51:20,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:20,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 142 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,155 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 142 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,155 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 142 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:20,158 INFO L93 Difference]: Finished difference Result 224 states and 276 transitions. [2022-02-20 18:51:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 276 transitions. [2022-02-20 18:51:20,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:20,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:20,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 224 states. [2022-02-20 18:51:20,159 INFO L87 Difference]: Start difference. First operand has 142 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 224 states. [2022-02-20 18:51:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:20,163 INFO L93 Difference]: Finished difference Result 224 states and 276 transitions. [2022-02-20 18:51:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 276 transitions. [2022-02-20 18:51:20,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:20,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:20,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:20,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-02-20 18:51:20,166 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 53 [2022-02-20 18:51:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:20,166 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-02-20 18:51:20,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-02-20 18:51:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:20,167 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:20,167 INFO L514 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] [2022-02-20 18:51:20,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:20,168 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash -746268687, now seen corresponding path program 1 times [2022-02-20 18:51:20,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:20,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023714491] [2022-02-20 18:51:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:20,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {13074#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {13076#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:20,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {13076#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {13077#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {13078#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {13078#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st2~0; {13078#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {13078#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:20,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {13079#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13080#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:20,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {13080#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13080#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:20,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {13080#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {13080#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:20,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {13080#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 == ~id2~0); {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {13081#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:20,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {13081#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13082#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:51:20,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {13082#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {13075#false} is VALID [2022-02-20 18:51:20,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {13075#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {13075#false} is VALID [2022-02-20 18:51:20,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {13075#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13075#false} is VALID [2022-02-20 18:51:20,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {13075#false} assume !(~r1~0 >= 3); {13075#false} is VALID [2022-02-20 18:51:20,297 INFO L290 TraceCheckUtils]: 51: Hoare triple {13075#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1770~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1770~0;havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~6#1;main_~assert__arg~6#1 := main_~__tmp_7~0#1; {13075#false} is VALID [2022-02-20 18:51:20,297 INFO L290 TraceCheckUtils]: 52: Hoare triple {13075#false} assume 0 == main_~assert__arg~6#1 % 256; {13075#false} is VALID [2022-02-20 18:51:20,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {13075#false} assume !false; {13075#false} is VALID [2022-02-20 18:51:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:20,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:20,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023714491] [2022-02-20 18:51:20,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023714491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:20,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:20,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:20,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92577988] [2022-02-20 18:51:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:20,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:51:20,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:20,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:20,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:20,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:20,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:20,342 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:22,290 INFO L93 Difference]: Finished difference Result 223 states and 272 transitions. [2022-02-20 18:51:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:51:22,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:51:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 272 transitions. [2022-02-20 18:51:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 272 transitions. [2022-02-20 18:51:22,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 272 transitions. [2022-02-20 18:51:22,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:22,494 INFO L225 Difference]: With dead ends: 223 [2022-02-20 18:51:22,494 INFO L226 Difference]: Without dead ends: 216 [2022-02-20 18:51:22,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:22,495 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 496 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:22,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 625 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-20 18:51:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 138. [2022-02-20 18:51:22,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:22,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 138 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,985 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 138 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,985 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 138 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:22,988 INFO L93 Difference]: Finished difference Result 216 states and 265 transitions. [2022-02-20 18:51:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2022-02-20 18:51:22,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:22,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:22,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 216 states. [2022-02-20 18:51:22,989 INFO L87 Difference]: Start difference. First operand has 138 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 216 states. [2022-02-20 18:51:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:22,993 INFO L93 Difference]: Finished difference Result 216 states and 265 transitions. [2022-02-20 18:51:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2022-02-20 18:51:22,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:22,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:22,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:22,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 137 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2022-02-20 18:51:22,996 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 54 [2022-02-20 18:51:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:22,996 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2022-02-20 18:51:22,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2022-02-20 18:51:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:22,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:22,997 INFO L514 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] [2022-02-20 18:51:22,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:51:22,997 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash -11876974, now seen corresponding path program 1 times [2022-02-20 18:51:22,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:22,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145477704] [2022-02-20 18:51:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:23,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {13986#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {13986#true} is VALID [2022-02-20 18:51:23,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {13986#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {13988#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:23,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {13988#(<= ~send1~0 127)} assume 0 == ~r1~0; {13988#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:23,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {13988#(<= ~send1~0 127)} assume ~id1~0 >= 0; {13989#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:23,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {13989#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {13989#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:23,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {13989#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {13990#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {13990#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {13990#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {13990#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {13991#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {13991#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {13991#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {13991#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {13992#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {13992#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {13992#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {13992#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {13993#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {13993#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {13993#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {13993#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {13994#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13995#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:23,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {13995#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13995#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:23,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {13995#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {13995#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:23,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {13995#(or (and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13996#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:23,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {13996#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13996#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:23,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {13996#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} assume ~send3~0 != ~nomsg~0; {13996#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:23,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {13996#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 >= 3); {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {13997#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13998#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {13998#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {13998#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {13998#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {13999#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {13999#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {14000#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {14000#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14001#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {14001#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {14001#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {14001#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {14002#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:23,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {14002#(<= (+ ~p2_old~0 1) ~id3~0)} ~mode2~0 := 0; {14002#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:23,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {14002#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {14002#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:23,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {14002#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14003#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:23,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {14003#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {14003#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:23,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {14003#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 > ~id3~0;~send3~0 := main_~node3__m3~4#1; {13987#false} is VALID [2022-02-20 18:51:23,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {13987#false} ~mode3~0 := 0; {13987#false} is VALID [2022-02-20 18:51:23,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {13987#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {13987#false} is VALID [2022-02-20 18:51:23,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {13987#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13987#false} is VALID [2022-02-20 18:51:23,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {13987#false} assume !(~r1~0 >= 3); {13987#false} is VALID [2022-02-20 18:51:23,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {13987#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1770~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1770~0;havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~6#1;main_~assert__arg~6#1 := main_~__tmp_7~0#1; {13987#false} is VALID [2022-02-20 18:51:23,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {13987#false} assume 0 == main_~assert__arg~6#1 % 256; {13987#false} is VALID [2022-02-20 18:51:23,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {13987#false} assume !false; {13987#false} is VALID [2022-02-20 18:51:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:23,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:23,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145477704] [2022-02-20 18:51:23,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145477704] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:23,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:23,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:23,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275871480] [2022-02-20 18:51:23,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:23,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:23,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:23,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:23,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:23,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:23,538 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:29,157 INFO L93 Difference]: Finished difference Result 368 states and 458 transitions. [2022-02-20 18:51:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:51:29,157 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 458 transitions. [2022-02-20 18:51:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 458 transitions. [2022-02-20 18:51:29,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 458 transitions. [2022-02-20 18:51:29,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:29,502 INFO L225 Difference]: With dead ends: 368 [2022-02-20 18:51:29,502 INFO L226 Difference]: Without dead ends: 360 [2022-02-20 18:51:29,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2022-02-20 18:51:29,503 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 900 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:29,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [900 Valid, 2695 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 18:51:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-02-20 18:51:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 143. [2022-02-20 18:51:30,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:30,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 143 states, 139 states have (on average 1.223021582733813) internal successors, (170), 142 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,106 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 143 states, 139 states have (on average 1.223021582733813) internal successors, (170), 142 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,107 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 143 states, 139 states have (on average 1.223021582733813) internal successors, (170), 142 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:30,111 INFO L93 Difference]: Finished difference Result 360 states and 450 transitions. [2022-02-20 18:51:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 450 transitions. [2022-02-20 18:51:30,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:30,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:30,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 139 states have (on average 1.223021582733813) internal successors, (170), 142 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 360 states. [2022-02-20 18:51:30,112 INFO L87 Difference]: Start difference. First operand has 143 states, 139 states have (on average 1.223021582733813) internal successors, (170), 142 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 360 states. [2022-02-20 18:51:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:30,119 INFO L93 Difference]: Finished difference Result 360 states and 450 transitions. [2022-02-20 18:51:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 450 transitions. [2022-02-20 18:51:30,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:30,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:30,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:30,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.223021582733813) internal successors, (170), 142 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2022-02-20 18:51:30,122 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 55 [2022-02-20 18:51:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:30,122 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2022-02-20 18:51:30,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2022-02-20 18:51:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:30,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:30,123 INFO L514 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] [2022-02-20 18:51:30,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:51:30,124 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash -637393645, now seen corresponding path program 1 times [2022-02-20 18:51:30,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:30,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521921622] [2022-02-20 18:51:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:30,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {15400#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {15400#true} is VALID [2022-02-20 18:51:30,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {15400#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {15402#(<= ~id2~0 127)} is VALID [2022-02-20 18:51:30,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {15402#(<= ~id2~0 127)} assume 0 == ~r1~0; {15402#(<= ~id2~0 127)} is VALID [2022-02-20 18:51:30,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {15402#(<= ~id2~0 127)} assume ~id1~0 >= 0; {15403#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:30,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {15403#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {15403#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:30,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {15403#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {15404#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:30,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {15404#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} assume 0 == ~mode1~0 % 256; {15404#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:30,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {15404#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} assume ~id2~0 >= 0; {15405#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:30,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {15405#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume 0 == ~st2~0; {15405#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:30,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {15405#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {15406#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:30,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {15406#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {15406#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:30,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {15406#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {15407#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:30,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {15407#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {15407#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:30,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {15407#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {15408#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15409#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {15409#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15409#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {15409#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {15409#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:30,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {15409#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15410#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:30,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {15410#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15410#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:30,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {15410#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} assume ~send3~0 != ~nomsg~0; {15410#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:30,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {15410#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:30,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:30,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 >= 3); {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:30,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:30,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:30,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:30,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:30,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:30,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {15411#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15412#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {15412#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {15412#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {15412#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {15413#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {15413#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {15413#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {15413#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {15413#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {15413#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15414#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {15414#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {15414#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {15414#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {15415#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {15415#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {15416#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:30,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {15416#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15417#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:30,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {15417#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} assume main_~node3__m3~3#1 != ~nomsg~0; {15417#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:30,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {15417#(<= (+ |ULTIMATE.start_main_~node3__m3~3#1| 1) ~id3~0)} assume main_~node3__m3~3#1 > ~id3~0;~send3~0 := main_~node3__m3~3#1; {15401#false} is VALID [2022-02-20 18:51:30,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {15401#false} ~mode3~0 := 0; {15401#false} is VALID [2022-02-20 18:51:30,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {15401#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~4#1; {15401#false} is VALID [2022-02-20 18:51:30,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {15401#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15401#false} is VALID [2022-02-20 18:51:30,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {15401#false} assume !(~r1~0 >= 3); {15401#false} is VALID [2022-02-20 18:51:30,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {15401#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~4#1 := 0;~__return_2039~0 := main_~check__tmp~4#1;main_~main__c1~0#1 := ~__return_2039~0;havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~4#1;main_~assert__arg~4#1 := main_~__tmp_5~0#1; {15401#false} is VALID [2022-02-20 18:51:30,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {15401#false} assume 0 == main_~assert__arg~4#1 % 256; {15401#false} is VALID [2022-02-20 18:51:30,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {15401#false} assume !false; {15401#false} is VALID [2022-02-20 18:51:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:30,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:30,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521921622] [2022-02-20 18:51:30,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521921622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:30,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:30,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:30,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494956968] [2022-02-20 18:51:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:30,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:30,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:30,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:30,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:30,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:30,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:30,673 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:36,599 INFO L93 Difference]: Finished difference Result 371 states and 460 transitions. [2022-02-20 18:51:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 18:51:36,600 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 460 transitions. [2022-02-20 18:51:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 460 transitions. [2022-02-20 18:51:36,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 460 transitions. [2022-02-20 18:51:36,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:36,957 INFO L225 Difference]: With dead ends: 371 [2022-02-20 18:51:36,957 INFO L226 Difference]: Without dead ends: 363 [2022-02-20 18:51:36,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 18:51:36,958 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 935 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:36,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [935 Valid, 2657 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 18:51:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-02-20 18:51:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 152. [2022-02-20 18:51:37,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:37,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 152 states, 148 states have (on average 1.222972972972973) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,635 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 152 states, 148 states have (on average 1.222972972972973) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,635 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 152 states, 148 states have (on average 1.222972972972973) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:37,640 INFO L93 Difference]: Finished difference Result 363 states and 452 transitions. [2022-02-20 18:51:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 452 transitions. [2022-02-20 18:51:37,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:37,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:37,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 148 states have (on average 1.222972972972973) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 363 states. [2022-02-20 18:51:37,641 INFO L87 Difference]: Start difference. First operand has 152 states, 148 states have (on average 1.222972972972973) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 363 states. [2022-02-20 18:51:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:37,648 INFO L93 Difference]: Finished difference Result 363 states and 452 transitions. [2022-02-20 18:51:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 452 transitions. [2022-02-20 18:51:37,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:37,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:37,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:37,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.222972972972973) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2022-02-20 18:51:37,651 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 55 [2022-02-20 18:51:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:37,652 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2022-02-20 18:51:37,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2022-02-20 18:51:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:37,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:37,653 INFO L514 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] [2022-02-20 18:51:37,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 18:51:37,653 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash -824240014, now seen corresponding path program 1 times [2022-02-20 18:51:37,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:37,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405222471] [2022-02-20 18:51:37,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:37,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {16842#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1406~0 := 0;~__return_2236~0 := 0;~__tmp_1489_0~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__tmp_1623_0~0 := 0;~__return_1559~0 := 0;~__return_1856~0 := 0;~__return_2039~0 := 0;~__return_2203~0 := 0;~__return_1770~0 := 0;~__return_1925~0 := 0;~__return_2120~0 := 0;~__return_2272~0 := 0;~__return_2167~0 := 0;~__return_2072~0 := 0;~__return_1988~0 := 0;~__return_1889~0 := 0;~__return_1817~0 := 0;~__return_1707~0 := 0;~__return_1479~0 := 0; {16842#true} is VALID [2022-02-20 18:51:37,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {16842#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:37,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:37,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:37,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:37,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:37,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:37,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {16844#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {16845#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:37,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {16845#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {16845#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:37,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {16845#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {16846#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:37,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {16846#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode2~0 % 256; {16846#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:37,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {16846#(and (<= ~id3~0 (+ ~send2~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send2~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id3~0 >= 0; {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:37,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~st3~0; {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:37,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~send3~0 == ~id3~0; {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:37,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode3~0 % 256; {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:37,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id2~0; {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:37,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id1~0 != ~id3~0; {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:37,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {16847#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:37,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:37,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:37,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:37,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~send1~0 != ~nomsg~0; {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:37,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:37,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:37,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~send2~0 != ~nomsg~0; {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} is VALID [2022-02-20 18:51:37,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {16848#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~send2~0 (+ ~id3~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {16849#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:37,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {16849#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16849#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:37,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {16849#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {16849#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:37,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {16849#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:37,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:37,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(~r1~0 >= 3); {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:37,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:37,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_2236~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2236~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:37,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_1489_0~0 := main_~main____CPAchecker_TMP_0~0#1; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:37,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1489_0~0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:37,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:38,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:38,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 != ~nomsg~0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:38,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:38,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} ~mode1~0 := 0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:38,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:38,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:38,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~1#1 != ~nomsg~0; {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:38,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {16850#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {16851#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:38,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {16851#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {16851#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:38,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {16851#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {16851#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:38,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {16851#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16852#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:38,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {16852#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:38,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {16852#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {16853#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:38,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {16853#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {16843#false} is VALID [2022-02-20 18:51:38,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {16843#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16843#false} is VALID [2022-02-20 18:51:38,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {16843#false} assume !(~r1~0 >= 3); {16843#false} is VALID [2022-02-20 18:51:38,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {16843#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1856~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1856~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {16843#false} is VALID [2022-02-20 18:51:38,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {16843#false} assume 0 == main_~assert__arg~3#1 % 256; {16843#false} is VALID [2022-02-20 18:51:38,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {16843#false} assume !false; {16843#false} is VALID [2022-02-20 18:51:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:38,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:38,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405222471] [2022-02-20 18:51:38,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405222471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:38,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:38,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:38,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868437282] [2022-02-20 18:51:38,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:38,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:38,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:38,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:38,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:38,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:38,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:38,066 INFO L87 Difference]: Start difference. First operand 152 states and 181 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)