./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-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.1.ufo.BOUNDED-6.pals.c.v+sep-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 46dda72cbacea7804179bc67e21a7607713ae67e303b365119c911cce7c0e646 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:20,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:20,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:20,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:20,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:20,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:20,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:20,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:20,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:20,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:20,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:20,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:20,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:20,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:20,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:20,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:20,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:20,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:20,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:20,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:20,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:20,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:20,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:20,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:20,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:20,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:20,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:20,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:20,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:20,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:20,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:20,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:20,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:20,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:20,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:20,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:20,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:20,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:20,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:20,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:20,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:20,396 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:20,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:20,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:20,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:20,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:20,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:20,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:20,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:20,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:20,415 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:20,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:20,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:20,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:20,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:20,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:20,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:20,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:20,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:20,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:20,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:20,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:20,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:20,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:20,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:20,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:20,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:20,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:20,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:20,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:20,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:20,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:20,418 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:20,418 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:20,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:20,418 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 -> 46dda72cbacea7804179bc67e21a7607713ae67e303b365119c911cce7c0e646 [2022-02-20 18:50:20,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:20,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:20,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:20,672 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:20,673 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:20,673 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2022-02-20 18:50:20,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a0eae9f/c658669c273a4fd6a40b1b1fe62e76fc/FLAG920ef6586 [2022-02-20 18:50:21,089 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:21,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2022-02-20 18:50:21,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a0eae9f/c658669c273a4fd6a40b1b1fe62e76fc/FLAG920ef6586 [2022-02-20 18:50:21,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a0eae9f/c658669c273a4fd6a40b1b1fe62e76fc [2022-02-20 18:50:21,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:21,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:21,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:21,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:21,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:21,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:21" (1/1) ... [2022-02-20 18:50:21,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7641499f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:21, skipping insertion in model container [2022-02-20 18:50:21,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:21" (1/1) ... [2022-02-20 18:50:21,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:21,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:21,706 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6199,6212] [2022-02-20 18:50:21,746 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9205,9218] [2022-02-20 18:50:21,756 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12265,12278] [2022-02-20 18:50:21,782 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15172,15185] [2022-02-20 18:50:21,795 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18387,18400] [2022-02-20 18:50:21,810 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21499,21512] [2022-02-20 18:50:21,829 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24550,24563] [2022-02-20 18:50:21,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:21,883 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:21,919 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6199,6212] [2022-02-20 18:50:21,934 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9205,9218] [2022-02-20 18:50:21,943 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12265,12278] [2022-02-20 18:50:21,956 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15172,15185] [2022-02-20 18:50:21,961 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18387,18400] [2022-02-20 18:50:21,966 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21499,21512] [2022-02-20 18:50:21,974 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.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24550,24563] [2022-02-20 18:50:22,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:22,028 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:22,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:22 WrapperNode [2022-02-20 18:50:22,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:22,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:22,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:22,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:22,034 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:22" (1/1) ... [2022-02-20 18:50:22,046 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:22" (1/1) ... [2022-02-20 18:50:22,157 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1332 [2022-02-20 18:50:22,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:22,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:22,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:22,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:22,164 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:22" (1/1) ... [2022-02-20 18:50:22,164 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:22" (1/1) ... [2022-02-20 18:50:22,181 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:22" (1/1) ... [2022-02-20 18:50:22,181 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:22" (1/1) ... [2022-02-20 18:50:22,192 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:22" (1/1) ... [2022-02-20 18:50:22,197 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:22" (1/1) ... [2022-02-20 18:50:22,200 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:22" (1/1) ... [2022-02-20 18:50:22,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:22,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:22,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:22,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:22,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:22" (1/1) ... [2022-02-20 18:50:22,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:22,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:22,255 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:22,260 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:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:22,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:22,431 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:22,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:23,250 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:23,256 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:23,257 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:23,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:23 BoogieIcfgContainer [2022-02-20 18:50:23,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:23,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:23,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:23,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:23,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:21" (1/3) ... [2022-02-20 18:50:23,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49081aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:23, skipping insertion in model container [2022-02-20 18:50:23,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:22" (2/3) ... [2022-02-20 18:50:23,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49081aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:23, skipping insertion in model container [2022-02-20 18:50:23,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:23" (3/3) ... [2022-02-20 18:50:23,263 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2022-02-20 18:50:23,266 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:23,266 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 18:50:23,293 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:23,297 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:23,297 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 18:50:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 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:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:23,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:23,320 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:23,320 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:23,324 INFO L85 PathProgramCache]: Analyzing trace with hash -506083603, now seen corresponding path program 1 times [2022-02-20 18:50:23,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:23,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318981273] [2022-02-20 18:50:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:23,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {284#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:23,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {285#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:23,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {285#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:23,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {285#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {286#(<= (+ ~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; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#(<= (+ ~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; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {286#(<= (+ ~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; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {286#(<= (+ ~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; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {286#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {286#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:23,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {286#(<= (+ ~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~2#1; {283#false} is VALID [2022-02-20 18:50:23,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {283#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {283#false} is VALID [2022-02-20 18:50:23,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {283#false} assume !(~r1~0 >= 3); {283#false} is VALID [2022-02-20 18:50:23,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {283#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {283#false} is VALID [2022-02-20 18:50:23,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {283#false} assume ~r1~0 < 3;main_~check__tmp~2#1 := 1;~__return_398~0 := main_~check__tmp~2#1;main_~main__c1~0#1 := ~__return_398~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {283#false} is VALID [2022-02-20 18:50:23,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {283#false} assume !(0 == main_~assert__arg~2#1 % 256);main_~main____CPAchecker_TMP_0~1#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {283#false} is VALID [2022-02-20 18:50:23,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {283#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~2#1;main_~node1__m1~2#1 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:23,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {283#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~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:23,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {283#false} assume !(main_~node1__m1~2#1 != ~nomsg~0);~mode1~0 := 0;~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~1#1; {283#false} is VALID [2022-02-20 18:50:23,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {283#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:23,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {283#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:23,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {283#false} assume main_~node2__m2~2#1 != ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:23,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {283#false} assume !(main_~node2__m2~2#1 > ~id2~0); {283#false} is VALID [2022-02-20 18:50:23,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {283#false} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:23,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {283#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:23,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {283#false} assume main_~node3__m3~2#1 != ~nomsg~0; {283#false} is VALID [2022-02-20 18:50:23,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {283#false} assume !(main_~node3__m3~2#1 > ~id3~0); {283#false} is VALID [2022-02-20 18:50:23,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {283#false} assume main_~node3__m3~2#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; {283#false} is VALID [2022-02-20 18:50:23,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {283#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1057~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1057~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; {283#false} is VALID [2022-02-20 18:50:23,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {283#false} assume 0 == main_~assert__arg~3#1 % 256; {283#false} is VALID [2022-02-20 18:50:23,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {283#false} assume !false; {283#false} is VALID [2022-02-20 18:50:23,549 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:23,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:23,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318981273] [2022-02-20 18:50:23,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318981273] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:23,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:23,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:23,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473061506] [2022-02-20 18:50:23,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:23,555 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:23,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:23,557 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:23,612 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:23,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:23,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:23,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:23,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:23,628 INFO L87 Difference]: Start difference. First operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 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.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:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:24,516 INFO L93 Difference]: Finished difference Result 392 states and 660 transitions. [2022-02-20 18:50:24,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:24,516 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:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:24,518 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:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2022-02-20 18:50:24,541 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:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2022-02-20 18:50:24,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 660 transitions. [2022-02-20 18:50:25,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:25,064 INFO L225 Difference]: With dead ends: 392 [2022-02-20 18:50:25,064 INFO L226 Difference]: Without dead ends: 244 [2022-02-20 18:50:25,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:25,069 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1142 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:25,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1142 Valid, 300 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-02-20 18:50:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-02-20 18:50:25,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:25,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 states have internal predecessors, (300), 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:25,175 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 states have internal predecessors, (300), 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:25,176 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 states have internal predecessors, (300), 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:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:25,183 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2022-02-20 18:50:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2022-02-20 18:50:25,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:25,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:25,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 states have internal predecessors, (300), 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 244 states. [2022-02-20 18:50:25,185 INFO L87 Difference]: Start difference. First operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 states have internal predecessors, (300), 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 244 states. [2022-02-20 18:50:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:25,192 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2022-02-20 18:50:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2022-02-20 18:50:25,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:25,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:25,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:25,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 states have internal predecessors, (300), 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:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 300 transitions. [2022-02-20 18:50:25,201 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 300 transitions. Word has length 48 [2022-02-20 18:50:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:25,201 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 300 transitions. [2022-02-20 18:50:25,202 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:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2022-02-20 18:50:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:25,203 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:25,203 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:25,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:25,203 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1206513712, now seen corresponding path program 1 times [2022-02-20 18:50:25,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:25,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205326615] [2022-02-20 18:50:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:25,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {1560#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1562#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1562#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1563#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:25,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {1563#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {1563#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:25,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {1564#(<= (+ ~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; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {1564#(<= (+ ~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; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {1564#(<= (+ ~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; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {1564#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1564#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:25,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {1564#(<= (+ ~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~3#1;main_~node3__m3~3#1 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {1561#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~1#1; {1561#false} is VALID [2022-02-20 18:50:25,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {1561#false} assume ~send3~0 != ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {1561#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~1#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~1#1 % 256 else main_~node3____CPAchecker_TMP_0~1#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~4#1; {1561#false} is VALID [2022-02-20 18:50:25,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {1561#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1561#false} is VALID [2022-02-20 18:50:25,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {1561#false} assume !(~r1~0 >= 3); {1561#false} is VALID [2022-02-20 18:50:25,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {1561#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1561#false} is VALID [2022-02-20 18:50:25,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {1561#false} assume ~r1~0 < 3;main_~check__tmp~4#1 := 1;~__return_384~0 := main_~check__tmp~4#1;main_~main__c1~0#1 := ~__return_384~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; {1561#false} is VALID [2022-02-20 18:50:25,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {1561#false} assume !(0 == main_~assert__arg~4#1 % 256);main_~main____CPAchecker_TMP_0~2#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {1561#false} is VALID [2022-02-20 18:50:25,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {1561#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~3#1;main_~node1__m1~3#1 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {1561#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~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {1561#false} assume main_~node1__m1~3#1 != ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {1561#false} assume !(main_~node1__m1~3#1 > ~id1~0); {1561#false} is VALID [2022-02-20 18:50:25,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {1561#false} assume main_~node1__m1~3#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {1561#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {1561#false} assume main_~node2__m2~3#1 != ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {1561#false} assume !(main_~node2__m2~3#1 > ~id2~0); {1561#false} is VALID [2022-02-20 18:50:25,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {1561#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {1561#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1561#false} is VALID [2022-02-20 18:50:25,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {1561#false} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0;~__tmp_952_0~0 := main_~main____CPAchecker_TMP_0~2#1; {1561#false} is VALID [2022-02-20 18:50:25,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {1561#false} main_~main____CPAchecker_TMP_0~2#1 := ~__tmp_952_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; {1561#false} is VALID [2022-02-20 18:50:25,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {1561#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_965~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_965~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; {1561#false} is VALID [2022-02-20 18:50:25,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {1561#false} assume 0 == main_~assert__arg~5#1 % 256; {1561#false} is VALID [2022-02-20 18:50:25,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-02-20 18:50:25,327 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:25,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:25,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205326615] [2022-02-20 18:50:25,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205326615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:25,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:25,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:25,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490030188] [2022-02-20 18:50:25,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:25,329 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:25,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:25,330 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:25,359 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:25,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:25,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:25,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:25,361 INFO L87 Difference]: Start difference. First operand 244 states and 300 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:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:25,837 INFO L93 Difference]: Finished difference Result 312 states and 387 transitions. [2022-02-20 18:50:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:25,837 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:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:25,838 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:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2022-02-20 18:50:25,841 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:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2022-02-20 18:50:25,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 387 transitions. [2022-02-20 18:50:26,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:26,112 INFO L225 Difference]: With dead ends: 312 [2022-02-20 18:50:26,112 INFO L226 Difference]: Without dead ends: 186 [2022-02-20 18:50:26,113 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:26,114 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 632 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:26,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [632 Valid, 144 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-20 18:50:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-02-20 18:50:26,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:26,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 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:26,220 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 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:26,220 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 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:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:26,223 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2022-02-20 18:50:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-02-20 18:50:26,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:26,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:26,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 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 186 states. [2022-02-20 18:50:26,224 INFO L87 Difference]: Start difference. First operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 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 186 states. [2022-02-20 18:50:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:26,228 INFO L93 Difference]: Finished difference Result 186 states and 227 transitions. [2022-02-20 18:50:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-02-20 18:50:26,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:26,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:26,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:26,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 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:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2022-02-20 18:50:26,232 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 48 [2022-02-20 18:50:26,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:26,233 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2022-02-20 18:50:26,233 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:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-02-20 18:50:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:26,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:26,234 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:26,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:26,234 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:26,234 INFO L85 PathProgramCache]: Analyzing trace with hash 731649800, now seen corresponding path program 1 times [2022-02-20 18:50:26,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:26,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247520759] [2022-02-20 18:50:26,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:26,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:26,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {2556#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {2558#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:26,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {2558#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:26,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {2558#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:26,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {2558#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2559#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:26,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {2559#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {2559#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:26,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {2559#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {2560#(<= (+ ~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; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {2560#(<= (+ ~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; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {2560#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2560#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:26,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {2560#(<= (+ ~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~5#1;main_~node2__m2~5#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {2557#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~1#1; {2557#false} is VALID [2022-02-20 18:50:26,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {2557#false} assume ~send2~0 != ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {2557#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~1#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~1#1 % 256 else main_~node2____CPAchecker_TMP_0~1#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {2557#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {2557#false} is VALID [2022-02-20 18:50:26,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {2557#false} assume ~send3~0 != ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {2557#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~2#1 := ~send3~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~8#1; {2557#false} is VALID [2022-02-20 18:50:26,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {2557#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2557#false} is VALID [2022-02-20 18:50:26,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {2557#false} assume !(~r1~0 >= 3); {2557#false} is VALID [2022-02-20 18:50:26,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {2557#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2557#false} is VALID [2022-02-20 18:50:26,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {2557#false} assume ~r1~0 < 3;main_~check__tmp~8#1 := 1;~__return_356~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_356~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; {2557#false} is VALID [2022-02-20 18:50:26,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {2557#false} assume !(0 == main_~assert__arg~8#1 % 256);main_~main____CPAchecker_TMP_0~4#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {2557#false} is VALID [2022-02-20 18:50:26,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {2557#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~5#1;main_~node1__m1~5#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {2557#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~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {2557#false} assume main_~node1__m1~5#1 != ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {2557#false} assume !(main_~node1__m1~5#1 > ~id1~0); {2557#false} is VALID [2022-02-20 18:50:26,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {2557#false} assume main_~node1__m1~5#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~6#1;main_~node2__m2~6#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {2557#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~6#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {2557#false} assume !(main_~node2__m2~6#1 != ~nomsg~0);~mode2~0 := 0;~__tmp_746_0~0 := main_~main____CPAchecker_TMP_0~4#1; {2557#false} is VALID [2022-02-20 18:50:26,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {2557#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_746_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {2557#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {2557#false} assume main_~node3__m3~7#1 != ~nomsg~0; {2557#false} is VALID [2022-02-20 18:50:26,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {2557#false} assume !(main_~node3__m3~7#1 > ~id3~0); {2557#false} is VALID [2022-02-20 18:50:26,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {2557#false} assume main_~node3__m3~7#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~9#1; {2557#false} is VALID [2022-02-20 18:50:26,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {2557#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_788~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_788~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; {2557#false} is VALID [2022-02-20 18:50:26,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {2557#false} assume 0 == main_~assert__arg~9#1 % 256; {2557#false} is VALID [2022-02-20 18:50:26,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {2557#false} assume !false; {2557#false} is VALID [2022-02-20 18:50:26,310 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:26,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:26,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247520759] [2022-02-20 18:50:26,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247520759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:26,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:26,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:26,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747773285] [2022-02-20 18:50:26,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:26,311 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:26,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:26,312 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:26,340 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:26,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:26,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:26,341 INFO L87 Difference]: Start difference. First operand 186 states and 227 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:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:26,973 INFO L93 Difference]: Finished difference Result 354 states and 447 transitions. [2022-02-20 18:50:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:26,974 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:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:26,974 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:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2022-02-20 18:50:26,977 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:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2022-02-20 18:50:26,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 447 transitions. [2022-02-20 18:50:27,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 447 edges. 447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:27,270 INFO L225 Difference]: With dead ends: 354 [2022-02-20 18:50:27,270 INFO L226 Difference]: Without dead ends: 251 [2022-02-20 18:50:27,270 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:27,271 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 786 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:27,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [786 Valid, 199 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-20 18:50:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 226. [2022-02-20 18:50:27,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:27,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 226 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 225 states have internal predecessors, (290), 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:27,465 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 226 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 225 states have internal predecessors, (290), 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:27,465 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 226 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 225 states have internal predecessors, (290), 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:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:27,475 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2022-02-20 18:50:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 314 transitions. [2022-02-20 18:50:27,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:27,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:27,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 225 states have internal predecessors, (290), 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 251 states. [2022-02-20 18:50:27,477 INFO L87 Difference]: Start difference. First operand has 226 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 225 states have internal predecessors, (290), 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 251 states. [2022-02-20 18:50:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:27,483 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2022-02-20 18:50:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 314 transitions. [2022-02-20 18:50:27,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:27,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:27,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:27,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 225 states have internal predecessors, (290), 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:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 290 transitions. [2022-02-20 18:50:27,489 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 290 transitions. Word has length 48 [2022-02-20 18:50:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:27,489 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 290 transitions. [2022-02-20 18:50:27,489 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:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 290 transitions. [2022-02-20 18:50:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:27,490 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:27,490 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:27,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:27,491 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash 613838546, now seen corresponding path program 1 times [2022-02-20 18:50:27,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:27,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251092054] [2022-02-20 18:50:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:27,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:27,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {3808#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {3810#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:27,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {3810#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {3811#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {3812#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {3812#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {3812#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:27,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {3812#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 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; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 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; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 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; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:27,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {3813#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 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; {3814#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:27,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {3814#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {3814#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:27,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {3814#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 3); {3814#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:27,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {3814#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {3814#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:27,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {3814#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {3814#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:27,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {3814#(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; {3814#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:27,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {3814#(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; {3814#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:27,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {3814#(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; {3815#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:50:27,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {3815#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {3809#false} is VALID [2022-02-20 18:50:27,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {3809#false} ~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~0#1; {3809#false} is VALID [2022-02-20 18:50:27,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {3809#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {3809#false} is VALID [2022-02-20 18:50:27,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {3809#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3809#false} is VALID [2022-02-20 18:50:27,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {3809#false} assume main_~node2__m2~2#1 != ~nomsg~0; {3809#false} is VALID [2022-02-20 18:50:27,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {3809#false} assume !(main_~node2__m2~2#1 > ~id2~0); {3809#false} is VALID [2022-02-20 18:50:27,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {3809#false} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {3809#false} is VALID [2022-02-20 18:50:27,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {3809#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3809#false} is VALID [2022-02-20 18:50:27,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {3809#false} assume main_~node3__m3~2#1 != ~nomsg~0; {3809#false} is VALID [2022-02-20 18:50:27,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {3809#false} assume !(main_~node3__m3~2#1 > ~id3~0); {3809#false} is VALID [2022-02-20 18:50:27,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {3809#false} assume main_~node3__m3~2#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; {3809#false} is VALID [2022-02-20 18:50:27,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {3809#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1057~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1057~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; {3809#false} is VALID [2022-02-20 18:50:27,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {3809#false} assume 0 == main_~assert__arg~3#1 % 256; {3809#false} is VALID [2022-02-20 18:50:27,635 INFO L290 TraceCheckUtils]: 49: Hoare triple {3809#false} assume !false; {3809#false} is VALID [2022-02-20 18:50:27,636 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:27,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:27,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251092054] [2022-02-20 18:50:27,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251092054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:27,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:27,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:50:27,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057726054] [2022-02-20 18:50:27,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:27,637 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:27,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:27,637 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:27,671 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:27,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:50:27,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:27,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:50:27,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:27,673 INFO L87 Difference]: Start difference. First operand 226 states and 290 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:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:28,963 INFO L93 Difference]: Finished difference Result 479 states and 630 transitions. [2022-02-20 18:50:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:50:28,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:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:28,964 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:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 408 transitions. [2022-02-20 18:50:28,967 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:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 408 transitions. [2022-02-20 18:50:28,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 408 transitions. [2022-02-20 18:50:29,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:29,217 INFO L225 Difference]: With dead ends: 479 [2022-02-20 18:50:29,217 INFO L226 Difference]: Without dead ends: 351 [2022-02-20 18:50:29,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:50:29,219 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 980 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:29,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [980 Valid, 311 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-20 18:50:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 226. [2022-02-20 18:50:29,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:29,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 226 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 225 states have internal predecessors, (289), 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:29,501 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 226 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 225 states have internal predecessors, (289), 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:29,501 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 226 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 225 states have internal predecessors, (289), 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:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,507 INFO L93 Difference]: Finished difference Result 351 states and 453 transitions. [2022-02-20 18:50:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 453 transitions. [2022-02-20 18:50:29,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:29,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:29,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 225 states have internal predecessors, (289), 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 351 states. [2022-02-20 18:50:29,508 INFO L87 Difference]: Start difference. First operand has 226 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 225 states have internal predecessors, (289), 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 351 states. [2022-02-20 18:50:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,514 INFO L93 Difference]: Finished difference Result 351 states and 453 transitions. [2022-02-20 18:50:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 453 transitions. [2022-02-20 18:50:29,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:29,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:29,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:29,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 225 states have internal predecessors, (289), 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:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 289 transitions. [2022-02-20 18:50:29,518 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 289 transitions. Word has length 50 [2022-02-20 18:50:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:29,518 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 289 transitions. [2022-02-20 18:50:29,519 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:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 289 transitions. [2022-02-20 18:50:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:29,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:29,519 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:29,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:29,520 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:29,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1717096174, now seen corresponding path program 1 times [2022-02-20 18:50:29,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:29,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220320149] [2022-02-20 18:50:29,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:29,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {5459#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {5461#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:29,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {5461#(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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {5462#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {5463#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {5463#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {5463#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {5463#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {5464#(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; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {5464#(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; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {5464#(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; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {5464#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:29,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {5464#(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; {5465#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:29,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {5465#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5465#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:29,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {5465#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {5465#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:29,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {5465#(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; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {5466#(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; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {5466#(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; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {5466#(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; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {5466#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:29,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {5466#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5467#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:50:29,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {5467#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0);~mode3~0 := 0; {5460#false} is VALID [2022-02-20 18:50:29,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {5460#false} ~__tmp_952_0~0 := main_~main____CPAchecker_TMP_0~0#1; {5460#false} is VALID [2022-02-20 18:50:29,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {5460#false} main_~main____CPAchecker_TMP_0~2#1 := ~__tmp_952_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; {5460#false} is VALID [2022-02-20 18:50:29,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {5460#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_965~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_965~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; {5460#false} is VALID [2022-02-20 18:50:29,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {5460#false} assume 0 == main_~assert__arg~5#1 % 256; {5460#false} is VALID [2022-02-20 18:50:29,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {5460#false} assume !false; {5460#false} is VALID [2022-02-20 18:50:29,704 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:29,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:29,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220320149] [2022-02-20 18:50:29,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220320149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:29,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:29,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:29,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607937002] [2022-02-20 18:50:29,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:29,705 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:29,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:29,706 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:29,736 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:29,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:29,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:29,739 INFO L87 Difference]: Start difference. First operand 226 states and 289 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:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:31,802 INFO L93 Difference]: Finished difference Result 548 states and 743 transitions. [2022-02-20 18:50:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:31,803 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:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:31,803 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:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 445 transitions. [2022-02-20 18:50:31,806 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:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 445 transitions. [2022-02-20 18:50:31,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 445 transitions. [2022-02-20 18:50:32,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:32,176 INFO L225 Difference]: With dead ends: 548 [2022-02-20 18:50:32,176 INFO L226 Difference]: Without dead ends: 542 [2022-02-20 18:50:32,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:50:32,177 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 1244 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:32,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1244 Valid, 632 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-02-20 18:50:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 226. [2022-02-20 18:50:32,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:32,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 226 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 225 states have internal predecessors, (288), 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:32,589 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 226 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 225 states have internal predecessors, (288), 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:32,590 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 226 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 225 states have internal predecessors, (288), 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:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:32,602 INFO L93 Difference]: Finished difference Result 542 states and 737 transitions. [2022-02-20 18:50:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 737 transitions. [2022-02-20 18:50:32,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:32,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:32,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 225 states have internal predecessors, (288), 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 542 states. [2022-02-20 18:50:32,603 INFO L87 Difference]: Start difference. First operand has 226 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 225 states have internal predecessors, (288), 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 542 states. [2022-02-20 18:50:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:32,614 INFO L93 Difference]: Finished difference Result 542 states and 737 transitions. [2022-02-20 18:50:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 737 transitions. [2022-02-20 18:50:32,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:32,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:32,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:32,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 225 states have internal predecessors, (288), 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:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 288 transitions. [2022-02-20 18:50:32,618 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 288 transitions. Word has length 50 [2022-02-20 18:50:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:32,618 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 288 transitions. [2022-02-20 18:50:32,619 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:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 288 transitions. [2022-02-20 18:50:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:32,619 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:32,619 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:32,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:32,620 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1648014290, now seen corresponding path program 1 times [2022-02-20 18:50:32,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:32,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010093339] [2022-02-20 18:50:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:32,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {7612#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {7614#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:32,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {7614#(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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {7615#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {7615#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {7615#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {7615#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {7616#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {7616#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {7616#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {7616#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {7617#(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; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {7617#(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; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {7617#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:32,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {7617#(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; {7618#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:32,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {7618#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7618#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:32,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {7618#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {7618#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:32,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {7618#(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; {7618#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:32,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {7618#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7618#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:32,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {7618#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {7618#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:32,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {7618#(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; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {7619#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {7619#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {7619#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {7619#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {7619#(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; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {7619#(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; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {7619#(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; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {7619#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {7619#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {7619#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7619#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:32,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {7619#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7620#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:32,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {7620#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {7613#false} is VALID [2022-02-20 18:50:32,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {7613#false} ~__tmp_746_0~0 := main_~main____CPAchecker_TMP_0~0#1; {7613#false} is VALID [2022-02-20 18:50:32,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {7613#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_746_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {7613#false} is VALID [2022-02-20 18:50:32,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {7613#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7613#false} is VALID [2022-02-20 18:50:32,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {7613#false} assume main_~node3__m3~7#1 != ~nomsg~0; {7613#false} is VALID [2022-02-20 18:50:32,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {7613#false} assume !(main_~node3__m3~7#1 > ~id3~0); {7613#false} is VALID [2022-02-20 18:50:32,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {7613#false} assume main_~node3__m3~7#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~9#1; {7613#false} is VALID [2022-02-20 18:50:32,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {7613#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_788~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_788~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; {7613#false} is VALID [2022-02-20 18:50:32,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {7613#false} assume 0 == main_~assert__arg~9#1 % 256; {7613#false} is VALID [2022-02-20 18:50:32,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {7613#false} assume !false; {7613#false} is VALID [2022-02-20 18:50:32,746 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:32,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:32,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010093339] [2022-02-20 18:50:32,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010093339] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:32,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:32,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:32,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793232629] [2022-02-20 18:50:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:32,747 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:32,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:32,747 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:32,783 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:32,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:32,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:32,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:32,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:32,784 INFO L87 Difference]: Start difference. First operand 226 states and 288 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:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:34,738 INFO L93 Difference]: Finished difference Result 463 states and 631 transitions. [2022-02-20 18:50:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:34,751 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:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:34,752 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:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 415 transitions. [2022-02-20 18:50:34,755 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:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 415 transitions. [2022-02-20 18:50:34,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 415 transitions. [2022-02-20 18:50:35,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:35,052 INFO L225 Difference]: With dead ends: 463 [2022-02-20 18:50:35,052 INFO L226 Difference]: Without dead ends: 360 [2022-02-20 18:50:35,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:35,053 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 890 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:35,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [890 Valid, 649 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-02-20 18:50:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 226. [2022-02-20 18:50:35,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:35,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 226 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 225 states have internal predecessors, (287), 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:35,395 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 226 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 225 states have internal predecessors, (287), 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:35,395 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 226 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 225 states have internal predecessors, (287), 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:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:35,401 INFO L93 Difference]: Finished difference Result 360 states and 483 transitions. [2022-02-20 18:50:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 483 transitions. [2022-02-20 18:50:35,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:35,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:35,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 225 states have internal predecessors, (287), 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:50:35,402 INFO L87 Difference]: Start difference. First operand has 226 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 225 states have internal predecessors, (287), 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:50:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:35,408 INFO L93 Difference]: Finished difference Result 360 states and 483 transitions. [2022-02-20 18:50:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 483 transitions. [2022-02-20 18:50:35,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:35,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:35,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:35,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 225 states have internal predecessors, (287), 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:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 287 transitions. [2022-02-20 18:50:35,413 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 287 transitions. Word has length 50 [2022-02-20 18:50:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:35,414 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 287 transitions. [2022-02-20 18:50:35,414 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:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-02-20 18:50:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:50:35,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:35,415 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] [2022-02-20 18:50:35,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:35,415 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1708755507, now seen corresponding path program 1 times [2022-02-20 18:50:35,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:35,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914447211] [2022-02-20 18:50:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:35,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {9281#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {9281#true} is VALID [2022-02-20 18:50:35,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {9281#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {9283#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:35,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {9283#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {9283#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:35,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {9283#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {9284#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:35,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {9284#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {9284#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:35,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {9284#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {9285#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {9285#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode1~0 % 256; {9285#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {9285#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 >= 0; {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st2~0; {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send2~0 == ~id2~0; {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode2~0 % 256; {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id3~0 >= 0; {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st3~0; {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send3~0 == ~id3~0; {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode3~0 % 256; {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {9286#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id2~0; {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id3~0; {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~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; {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send1~0 != ~nomsg~0; {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:35,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {9287#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~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; {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~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; {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {9288#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~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; {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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; {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 >= 3); {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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; {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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; {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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; {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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; {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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; {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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); {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {9289#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~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~1#1;main_~node2__m2~1#1 := ~nomsg~0; {9290#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:35,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {9290#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9291#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:35,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {9291#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume main_~node2__m2~1#1 != ~nomsg~0; {9291#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {9291#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 > ~id2~0); {9292#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {9292#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {9282#false} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {9282#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9282#false} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {9282#false} assume main_~node3__m3~1#1 != ~nomsg~0; {9282#false} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {9282#false} assume !(main_~node3__m3~1#1 > ~id3~0); {9282#false} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {9282#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~1#1; {9282#false} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {9282#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1167~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1167~0;~__tmp_1168_0~0 := main_~main____CPAchecker_TMP_0~0#1; {9282#false} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {9282#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1168_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {9282#false} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {9282#false} assume 0 == main_~assert__arg~1#1 % 256; {9282#false} is VALID [2022-02-20 18:50:35,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {9282#false} assume !false; {9282#false} is VALID [2022-02-20 18:50:35,734 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:35,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:35,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914447211] [2022-02-20 18:50:35,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914447211] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:35,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:35,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:35,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83492919] [2022-02-20 18:50:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:35,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 51 [2022-02-20 18:50:35,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:35,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:35,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:35,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:35,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:35,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:35,764 INFO L87 Difference]: Start difference. First operand 226 states and 287 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:39,364 INFO L93 Difference]: Finished difference Result 584 states and 813 transitions. [2022-02-20 18:50:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:50:39,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 51 [2022-02-20 18:50:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 537 transitions. [2022-02-20 18:50:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 537 transitions. [2022-02-20 18:50:39,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 537 transitions. [2022-02-20 18:50:39,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:39,789 INFO L225 Difference]: With dead ends: 584 [2022-02-20 18:50:39,790 INFO L226 Difference]: Without dead ends: 488 [2022-02-20 18:50:39,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:50:39,791 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 1207 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:39,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1207 Valid, 1437 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-02-20 18:50:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 214. [2022-02-20 18:50:40,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:40,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 488 states. Second operand has 214 states, 208 states have (on average 1.3125) internal successors, (273), 213 states have internal predecessors, (273), 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:40,421 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand has 214 states, 208 states have (on average 1.3125) internal successors, (273), 213 states have internal predecessors, (273), 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:40,422 INFO L87 Difference]: Start difference. First operand 488 states. Second operand has 214 states, 208 states have (on average 1.3125) internal successors, (273), 213 states have internal predecessors, (273), 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:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:40,443 INFO L93 Difference]: Finished difference Result 488 states and 673 transitions. [2022-02-20 18:50:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 673 transitions. [2022-02-20 18:50:40,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:40,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:40,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 208 states have (on average 1.3125) internal successors, (273), 213 states have internal predecessors, (273), 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 488 states. [2022-02-20 18:50:40,446 INFO L87 Difference]: Start difference. First operand has 214 states, 208 states have (on average 1.3125) internal successors, (273), 213 states have internal predecessors, (273), 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 488 states. [2022-02-20 18:50:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:40,466 INFO L93 Difference]: Finished difference Result 488 states and 673 transitions. [2022-02-20 18:50:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 673 transitions. [2022-02-20 18:50:40,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:40,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:40,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:40,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 208 states have (on average 1.3125) internal successors, (273), 213 states have internal predecessors, (273), 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:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 273 transitions. [2022-02-20 18:50:40,475 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 273 transitions. Word has length 51 [2022-02-20 18:50:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:40,475 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 273 transitions. [2022-02-20 18:50:40,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 273 transitions. [2022-02-20 18:50:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:40,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:40,476 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:40,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:40,477 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash 871420535, now seen corresponding path program 1 times [2022-02-20 18:50:40,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:40,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202555952] [2022-02-20 18:50:40,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:40,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {11359#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {11359#true} is VALID [2022-02-20 18:50:40,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {11359#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {11361#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:40,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {11361#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {11361#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:40,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {11361#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {11362#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:40,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {11362#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {11362#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:40,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {11362#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {11363#(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:50:40,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {11363#(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; {11363#(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:50:40,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {11363#(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; {11364#(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:50:40,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {11364#(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; {11364#(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:50:40,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {11364#(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; {11364#(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:50:40,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {11364#(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; {11364#(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:50:40,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {11364#(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; {11364#(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:50:40,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {11364#(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; {11364#(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:50:40,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {11364#(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; {11364#(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:50:40,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {11364#(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; {11364#(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:50:40,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {11364#(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; {11365#(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:50:40,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {11365#(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; {11365#(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:50:40,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {11365#(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_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {11365#(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:50:40,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {11365#(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; {11365#(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:50:40,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {11365#(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; {11365#(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:50:40,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {11365#(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; {11365#(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:50:40,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {11365#(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; {11365#(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:50:40,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {11365#(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; {11366#(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:50:40,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {11366#(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; {11366#(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:50:40,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {11366#(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; {11366#(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:50:40,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {11366#(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; {11366#(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:50:40,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {11366#(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; {11366#(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:50:40,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {11366#(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; {11366#(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:50:40,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {11366#(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; {11367#(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:50:40,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {11367#(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; {11367#(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:50:40,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {11367#(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); {11367#(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:50:40,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {11367#(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; {11367#(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:50:40,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {11367#(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_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {11367#(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:50:40,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {11367#(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; {11367#(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:50:40,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {11367#(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; {11367#(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:50:40,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {11367#(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; {11367#(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:50:40,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {11367#(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; {11367#(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:50:40,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {11367#(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;~send1~0 := main_~node1__m1~1#1; {11368#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:40,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {11368#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0; {11368#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:40,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {11368#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~0#1; {11368#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:40,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {11368#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {11368#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:40,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {11368#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11369#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:50:40,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {11369#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {11369#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:50:40,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {11369#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {11370#(<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0)} is VALID [2022-02-20 18:50:40,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {11370#(<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0)} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {11360#false} is VALID [2022-02-20 18:50:40,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {11360#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11360#false} is VALID [2022-02-20 18:50:40,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {11360#false} assume main_~node3__m3~2#1 != ~nomsg~0; {11360#false} is VALID [2022-02-20 18:50:40,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {11360#false} assume !(main_~node3__m3~2#1 > ~id3~0); {11360#false} is VALID [2022-02-20 18:50:40,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {11360#false} assume main_~node3__m3~2#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; {11360#false} is VALID [2022-02-20 18:50:40,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {11360#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1057~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1057~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; {11360#false} is VALID [2022-02-20 18:50:40,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {11360#false} assume 0 == main_~assert__arg~3#1 % 256; {11360#false} is VALID [2022-02-20 18:50:40,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {11360#false} assume !false; {11360#false} is VALID [2022-02-20 18:50:40,900 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:40,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:40,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202555952] [2022-02-20 18:50:40,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202555952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:40,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:40,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:40,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419719928] [2022-02-20 18:50:40,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:40,901 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:40,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:40,901 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:40,942 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:40,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:40,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:40,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:40,943 INFO L87 Difference]: Start difference. First operand 214 states and 273 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:50:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,292 INFO L93 Difference]: Finished difference Result 461 states and 629 transitions. [2022-02-20 18:50:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:50:44,292 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:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:44,293 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:50:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 397 transitions. [2022-02-20 18:50:44,299 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:50:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 397 transitions. [2022-02-20 18:50:44,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 397 transitions. [2022-02-20 18:50:44,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:44,554 INFO L225 Difference]: With dead ends: 461 [2022-02-20 18:50:44,554 INFO L226 Difference]: Without dead ends: 444 [2022-02-20 18:50:44,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:44,555 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 885 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:44,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [885 Valid, 1636 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-02-20 18:50:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 197. [2022-02-20 18:50:45,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:45,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 444 states. Second operand has 197 states, 193 states have (on average 1.310880829015544) internal successors, (253), 196 states have internal predecessors, (253), 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,116 INFO L74 IsIncluded]: Start isIncluded. First operand 444 states. Second operand has 197 states, 193 states have (on average 1.310880829015544) internal successors, (253), 196 states have internal predecessors, (253), 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,116 INFO L87 Difference]: Start difference. First operand 444 states. Second operand has 197 states, 193 states have (on average 1.310880829015544) internal successors, (253), 196 states have internal predecessors, (253), 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,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,125 INFO L93 Difference]: Finished difference Result 444 states and 609 transitions. [2022-02-20 18:50:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 609 transitions. [2022-02-20 18:50:45,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 193 states have (on average 1.310880829015544) internal successors, (253), 196 states have internal predecessors, (253), 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 444 states. [2022-02-20 18:50:45,127 INFO L87 Difference]: Start difference. First operand has 197 states, 193 states have (on average 1.310880829015544) internal successors, (253), 196 states have internal predecessors, (253), 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 444 states. [2022-02-20 18:50:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,135 INFO L93 Difference]: Finished difference Result 444 states and 609 transitions. [2022-02-20 18:50:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 609 transitions. [2022-02-20 18:50:45,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:45,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.310880829015544) internal successors, (253), 196 states have internal predecessors, (253), 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,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 253 transitions. [2022-02-20 18:50:45,138 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 253 transitions. Word has length 52 [2022-02-20 18:50:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:45,138 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 253 transitions. [2022-02-20 18:50:45,139 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:50:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 253 transitions. [2022-02-20 18:50:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:45,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:45,139 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:45,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:45,140 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1375412663, now seen corresponding path program 1 times [2022-02-20 18:50:45,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:45,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620225470] [2022-02-20 18:50:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:45,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {13154#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {13154#true} is VALID [2022-02-20 18:50:45,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {13154#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {13156#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {13157#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {13157#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {13157#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {13157#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {13158#(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:45,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {13158#(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; {13158#(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:45,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {13158#(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; {13159#(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:45,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {13159#(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; {13159#(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:45,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {13159#(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; {13159#(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:45,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {13159#(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; {13159#(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:45,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {13159#(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; {13159#(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:45,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {13159#(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; {13159#(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:45,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {13159#(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_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {13160#(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:45,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {13160#(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; {13160#(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:45,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {13160#(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; {13160#(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:45,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {13160#(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; {13160#(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:45,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {13160#(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; {13160#(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:45,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {13160#(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; {13160#(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:45,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {13160#(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; {13160#(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:45,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {13160#(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; {13160#(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:45,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {13160#(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; {13161#(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:45,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {13161#(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; {13161#(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:45,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {13161#(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; {13161#(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:45,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {13161#(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; {13162#(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:45,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {13162#(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; {13162#(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:45,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {13162#(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); {13162#(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:45,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {13162#(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; {13162#(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:45,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {13162#(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_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {13162#(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:45,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {13162#(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; {13162#(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:45,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {13162#(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; {13162#(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:45,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {13162#(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; {13162#(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:45,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {13162#(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; {13162#(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:45,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {13162#(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); {13162#(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:45,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {13162#(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~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13162#(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:45,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {13162#(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; {13162#(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:45,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {13162#(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; {13162#(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:45,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {13162#(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; {13163#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {13163#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {13163#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:45,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {13163#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~__tmp_746_0~0 := main_~main____CPAchecker_TMP_0~0#1; {13163#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:45,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {13163#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_746_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {13163#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:45,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {13163#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13164#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:50:45,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {13164#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~7#1|))} assume main_~node3__m3~7#1 != ~nomsg~0; {13164#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:50:45,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {13164#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~7#1|))} assume !(main_~node3__m3~7#1 > ~id3~0); {13165#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} is VALID [2022-02-20 18:50:45,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {13165#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} assume main_~node3__m3~7#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~9#1; {13155#false} is VALID [2022-02-20 18:50:45,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {13155#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_788~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_788~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; {13155#false} is VALID [2022-02-20 18:50:45,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {13155#false} assume 0 == main_~assert__arg~9#1 % 256; {13155#false} is VALID [2022-02-20 18:50:45,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {13155#false} assume !false; {13155#false} is VALID [2022-02-20 18:50:45,470 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,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:45,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620225470] [2022-02-20 18:50:45,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620225470] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:45,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:45,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:45,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705836645] [2022-02-20 18:50:45,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:45,471 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:45,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:45,471 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:45,511 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:45,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:45,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:45,513 INFO L87 Difference]: Start difference. First operand 197 states and 253 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:50:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,581 INFO L93 Difference]: Finished difference Result 435 states and 580 transitions. [2022-02-20 18:50:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:50:48,581 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:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:48,582 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:50:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 349 transitions. [2022-02-20 18:50:48,607 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:50:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 349 transitions. [2022-02-20 18:50:48,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 349 transitions. [2022-02-20 18:50:49,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:49,059 INFO L225 Difference]: With dead ends: 435 [2022-02-20 18:50:49,060 INFO L226 Difference]: Without dead ends: 347 [2022-02-20 18:50:49,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:50:49,062 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 791 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:49,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 936 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-02-20 18:50:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 193. [2022-02-20 18:50:49,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:49,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 193 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 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,861 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 193 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 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,861 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 193 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 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,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,867 INFO L93 Difference]: Finished difference Result 347 states and 448 transitions. [2022-02-20 18:50:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 448 transitions. [2022-02-20 18:50:49,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 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 347 states. [2022-02-20 18:50:49,868 INFO L87 Difference]: Start difference. First operand has 193 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 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 347 states. [2022-02-20 18:50:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,874 INFO L93 Difference]: Finished difference Result 347 states and 448 transitions. [2022-02-20 18:50:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 448 transitions. [2022-02-20 18:50:49,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:49,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 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,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 248 transitions. [2022-02-20 18:50:49,878 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 248 transitions. Word has length 52 [2022-02-20 18:50:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:49,878 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 248 transitions. [2022-02-20 18:50:49,878 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:50:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 248 transitions. [2022-02-20 18:50:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:50:49,879 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:49,879 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:50:49,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:50:49,879 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 4832631, now seen corresponding path program 1 times [2022-02-20 18:50:49,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:49,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896102338] [2022-02-20 18:50:49,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:49,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {14721#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {14723#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:49,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {14723#(<= (+ ~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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {14724#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {14724#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {14724#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {14724#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {14725#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {14725#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {14725#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {14725#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {14726#(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_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {14726#(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; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {14726#(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; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {14726#(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; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {14726#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:49,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {14726#(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; {14727#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:49,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {14727#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14727#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:49,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {14727#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {14727#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:49,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {14727#(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; {14727#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:49,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {14727#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14727#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:49,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {14727#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {14727#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:49,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {14727#(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; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {14728#(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; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {14728#(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; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {14728#(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; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} ~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~0#1; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {14728#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:49,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {14728#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14729#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} is VALID [2022-02-20 18:50:49,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {14729#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} assume !(main_~node2__m2~2#1 != ~nomsg~0);~mode2~0 := 0; {14722#false} is VALID [2022-02-20 18:50:49,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {14722#false} ~__tmp_650_0~0 := main_~main____CPAchecker_TMP_0~1#1; {14722#false} is VALID [2022-02-20 18:50:49,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {14722#false} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_650_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {14722#false} is VALID [2022-02-20 18:50:49,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {14722#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14722#false} is VALID [2022-02-20 18:50:49,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {14722#false} assume main_~node3__m3~8#1 != ~nomsg~0; {14722#false} is VALID [2022-02-20 18:50:49,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {14722#false} assume !(main_~node3__m3~8#1 > ~id3~0); {14722#false} is VALID [2022-02-20 18:50:49,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {14722#false} assume main_~node3__m3~8#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~11#1; {14722#false} is VALID [2022-02-20 18:50:49,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {14722#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14722#false} is VALID [2022-02-20 18:50:49,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {14722#false} assume !(~r1~0 >= 3); {14722#false} is VALID [2022-02-20 18:50:49,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {14722#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~11#1 := 0;~__return_695~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_695~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; {14722#false} is VALID [2022-02-20 18:50:49,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {14722#false} assume 0 == main_~assert__arg~11#1 % 256; {14722#false} is VALID [2022-02-20 18:50:49,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {14722#false} assume !false; {14722#false} is VALID [2022-02-20 18:50:49,995 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,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:49,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896102338] [2022-02-20 18:50:49,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896102338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:49,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:49,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:49,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028116759] [2022-02-20 18:50:49,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:49,996 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:50:49,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:49,997 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:50:50,037 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:50:50,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:50,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:50,038 INFO L87 Difference]: Start difference. First operand 193 states and 248 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:50:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,253 INFO L93 Difference]: Finished difference Result 314 states and 416 transitions. [2022-02-20 18:50:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:50:51,253 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:50:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:51,253 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:50:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2022-02-20 18:50:51,254 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:50:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2022-02-20 18:50:51,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 247 transitions. [2022-02-20 18:50:51,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,385 INFO L225 Difference]: With dead ends: 314 [2022-02-20 18:50:51,386 INFO L226 Difference]: Without dead ends: 196 [2022-02-20 18:50:51,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:50:51,386 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 318 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:51,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 336 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-20 18:50:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2022-02-20 18:50:51,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:51,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 193 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 192 states have internal predecessors, (246), 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:51,861 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 193 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 192 states have internal predecessors, (246), 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:51,861 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 193 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 192 states have internal predecessors, (246), 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:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,864 INFO L93 Difference]: Finished difference Result 196 states and 249 transitions. [2022-02-20 18:50:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 249 transitions. [2022-02-20 18:50:51,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 192 states have internal predecessors, (246), 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 196 states. [2022-02-20 18:50:51,865 INFO L87 Difference]: Start difference. First operand has 193 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 192 states have internal predecessors, (246), 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 196 states. [2022-02-20 18:50:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,867 INFO L93 Difference]: Finished difference Result 196 states and 249 transitions. [2022-02-20 18:50:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 249 transitions. [2022-02-20 18:50:51,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:51,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 192 states have internal predecessors, (246), 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:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 246 transitions. [2022-02-20 18:50:51,870 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 246 transitions. Word has length 54 [2022-02-20 18:50:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:51,871 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 246 transitions. [2022-02-20 18:50:51,871 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:50:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 246 transitions. [2022-02-20 18:50:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:50:51,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:51,871 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:50:51,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:50:51,872 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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:51,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash -924533993, now seen corresponding path program 1 times [2022-02-20 18:50:51,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:51,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130420175] [2022-02-20 18:50:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:51,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {15812#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {15814#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:51,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {15814#(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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {15815#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {15816#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {15816#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {15816#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {15816#(and (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~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; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~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; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {15817#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~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; {15818#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:51,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {15818#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15818#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:51,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {15818#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {15818#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:51,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {15818#(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; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 3); {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:51,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {15819#(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; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {15819#(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; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {15819#(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; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} ~__tmp_746_0~0 := main_~main____CPAchecker_TMP_0~0#1; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_746_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {15819#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:52,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {15819#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15820#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:50:52,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {15820#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~7#1|))} assume !(main_~node3__m3~7#1 != ~nomsg~0);~mode3~0 := 0; {15813#false} is VALID [2022-02-20 18:50:52,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {15813#false} ~__tmp_601_0~0 := main_~main____CPAchecker_TMP_0~4#1; {15813#false} is VALID [2022-02-20 18:50:52,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {15813#false} main_~main____CPAchecker_TMP_0~7#1 := ~__tmp_601_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~13#1; {15813#false} is VALID [2022-02-20 18:50:52,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {15813#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15813#false} is VALID [2022-02-20 18:50:52,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {15813#false} assume !(~r1~0 >= 3); {15813#false} is VALID [2022-02-20 18:50:52,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {15813#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_617~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_617~0;havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {15813#false} is VALID [2022-02-20 18:50:52,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {15813#false} assume 0 == main_~assert__arg~13#1 % 256; {15813#false} is VALID [2022-02-20 18:50:52,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {15813#false} assume !false; {15813#false} is VALID [2022-02-20 18:50:52,011 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,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:52,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130420175] [2022-02-20 18:50:52,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130420175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:52,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:52,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:52,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636024612] [2022-02-20 18:50:52,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:52,012 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:50:52,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:52,012 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:50:52,036 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:50:52,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:52,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:52,037 INFO L87 Difference]: Start difference. First operand 193 states and 246 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:50:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,939 INFO L93 Difference]: Finished difference Result 341 states and 441 transitions. [2022-02-20 18:50:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:50:53,948 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:50:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:53,949 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:50:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 271 transitions. [2022-02-20 18:50:53,960 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:50:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 271 transitions. [2022-02-20 18:50:53,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 271 transitions. [2022-02-20 18:50:54,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:54,099 INFO L225 Difference]: With dead ends: 341 [2022-02-20 18:50:54,099 INFO L226 Difference]: Without dead ends: 333 [2022-02-20 18:50:54,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:50:54,100 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 495 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:54,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 707 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-02-20 18:50:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 193. [2022-02-20 18:50:54,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:54,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 193 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 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:54,575 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 193 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 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:54,576 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 193 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 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:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,580 INFO L93 Difference]: Finished difference Result 333 states and 432 transitions. [2022-02-20 18:50:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 432 transitions. [2022-02-20 18:50:54,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:54,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:54,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 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 333 states. [2022-02-20 18:50:54,581 INFO L87 Difference]: Start difference. First operand has 193 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 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 333 states. [2022-02-20 18:50:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,586 INFO L93 Difference]: Finished difference Result 333 states and 432 transitions. [2022-02-20 18:50:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 432 transitions. [2022-02-20 18:50:54,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:54,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:54,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:54,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 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:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2022-02-20 18:50:54,589 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 54 [2022-02-20 18:50:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:54,590 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2022-02-20 18:50:54,590 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:50:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2022-02-20 18:50:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:50:54,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:54,590 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, 1] [2022-02-20 18:50:54,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:50:54,591 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1614885916, now seen corresponding path program 1 times [2022-02-20 18:50:54,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:54,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839643217] [2022-02-20 18:50:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:54,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:54,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {17217#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {17217#true} is VALID [2022-02-20 18:50:54,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {17217#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~st1~0; {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {17219#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id2~0 >= 0; {17220#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {17220#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume 0 == ~st2~0; {17220#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {17220#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {17221#(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:54,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {17221#(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; {17221#(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:54,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {17221#(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; {17222#(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:54,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {17222#(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; {17222#(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:54,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {17222#(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; {17222#(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:54,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {17222#(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; {17222#(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:54,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {17222#(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; {17222#(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:54,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {17222#(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; {17222#(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:54,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {17222#(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_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {17223#(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:54,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {17223#(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; {17223#(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:54,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {17223#(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; {17223#(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:54,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {17223#(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; {17223#(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:54,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {17223#(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; {17223#(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:54,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {17223#(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; {17223#(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:54,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {17223#(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; {17223#(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:54,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {17223#(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; {17223#(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:54,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {17223#(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; {17224#(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:54,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {17224#(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; {17224#(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:54,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {17224#(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; {17224#(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:54,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {17224#(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; {17225#(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:54,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {17225#(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; {17225#(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:54,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {17225#(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); {17225#(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:54,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {17225#(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; {17225#(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:54,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {17225#(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_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {17225#(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:54,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {17225#(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; {17225#(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:54,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {17225#(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; {17225#(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:54,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {17225#(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; {17225#(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:54,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {17225#(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; {17225#(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:54,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {17225#(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; {17225#(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:54,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {17225#(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; {17225#(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:54,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {17225#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} ~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~0#1; {17225#(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:54,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {17225#(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~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {17225#(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:54,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {17225#(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~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17225#(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:54,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {17225#(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~2#1 != ~nomsg~0; {17225#(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:54,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {17225#(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~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {17226#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:54,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {17226#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {17226#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:54,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {17226#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~__tmp_650_0~0 := main_~main____CPAchecker_TMP_0~1#1; {17226#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:54,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {17226#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_650_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {17226#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:54,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {17226#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17227#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} is VALID [2022-02-20 18:50:54,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {17227#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} assume main_~node3__m3~8#1 != ~nomsg~0; {17227#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} is VALID [2022-02-20 18:50:54,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {17227#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~8#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0))} assume !(main_~node3__m3~8#1 > ~id3~0); {17228#(<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0)} is VALID [2022-02-20 18:50:54,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {17228#(<= (+ |ULTIMATE.start_main_~node3__m3~8#1| 1) ~id3~0)} assume main_~node3__m3~8#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~11#1; {17218#false} is VALID [2022-02-20 18:50:54,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {17218#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17218#false} is VALID [2022-02-20 18:50:54,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {17218#false} assume !(~r1~0 >= 3); {17218#false} is VALID [2022-02-20 18:50:54,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {17218#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~11#1 := 0;~__return_695~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_695~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; {17218#false} is VALID [2022-02-20 18:50:54,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {17218#false} assume 0 == main_~assert__arg~11#1 % 256; {17218#false} is VALID [2022-02-20 18:50:54,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {17218#false} assume !false; {17218#false} is VALID [2022-02-20 18:50:54,913 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:54,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:54,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839643217] [2022-02-20 18:50:54,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839643217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:54,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:54,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:54,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488315883] [2022-02-20 18:50:54,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:54,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 56 [2022-02-20 18:50:54,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:54,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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:54,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:54,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:54,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:54,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:54,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:54,946 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,269 INFO L93 Difference]: Finished difference Result 523 states and 707 transitions. [2022-02-20 18:50:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:50:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 56 [2022-02-20 18:50:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 399 transitions. [2022-02-20 18:50:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 399 transitions. [2022-02-20 18:50:59,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 399 transitions. [2022-02-20 18:50:59,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:59,545 INFO L225 Difference]: With dead ends: 523 [2022-02-20 18:50:59,545 INFO L226 Difference]: Without dead ends: 517 [2022-02-20 18:50:59,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:50:59,549 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 715 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:59,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 1853 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-02-20 18:51:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 187. [2022-02-20 18:51:00,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:00,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 517 states. Second operand has 187 states, 185 states have (on average 1.2864864864864864) internal successors, (238), 186 states have internal predecessors, (238), 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,071 INFO L74 IsIncluded]: Start isIncluded. First operand 517 states. Second operand has 187 states, 185 states have (on average 1.2864864864864864) internal successors, (238), 186 states have internal predecessors, (238), 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,073 INFO L87 Difference]: Start difference. First operand 517 states. Second operand has 187 states, 185 states have (on average 1.2864864864864864) internal successors, (238), 186 states have internal predecessors, (238), 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,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,111 INFO L93 Difference]: Finished difference Result 517 states and 698 transitions. [2022-02-20 18:51:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 698 transitions. [2022-02-20 18:51:00,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:00,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:00,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 185 states have (on average 1.2864864864864864) internal successors, (238), 186 states have internal predecessors, (238), 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 517 states. [2022-02-20 18:51:00,112 INFO L87 Difference]: Start difference. First operand has 187 states, 185 states have (on average 1.2864864864864864) internal successors, (238), 186 states have internal predecessors, (238), 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 517 states. [2022-02-20 18:51:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,135 INFO L93 Difference]: Finished difference Result 517 states and 698 transitions. [2022-02-20 18:51:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 698 transitions. [2022-02-20 18:51:00,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:00,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:00,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:00,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 1.2864864864864864) internal successors, (238), 186 states have internal predecessors, (238), 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,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 238 transitions. [2022-02-20 18:51:00,139 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 238 transitions. Word has length 56 [2022-02-20 18:51:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:00,139 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 238 transitions. [2022-02-20 18:51:00,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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,139 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 238 transitions. [2022-02-20 18:51:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:51:00,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:00,141 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, 1] [2022-02-20 18:51:00,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:00,141 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash -712982628, now seen corresponding path program 1 times [2022-02-20 18:51:00,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:00,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047592626] [2022-02-20 18:51:00,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:00,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {19246#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {19246#true} is VALID [2022-02-20 18:51:00,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {19246#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {19248#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:00,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {19248#(<= ~send1~0 127)} assume 0 == ~r1~0; {19248#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:00,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {19248#(<= ~send1~0 127)} assume ~id1~0 >= 0; {19249#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:00,486 INFO L290 TraceCheckUtils]: 4: Hoare triple {19249#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {19249#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:00,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {19249#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {19250#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {19250#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {19250#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {19250#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {19251#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {19251#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {19251#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {19251#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {19252#(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:00,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {19252#(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; {19252#(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:00,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {19252#(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; {19253#(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:00,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {19253#(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; {19253#(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:00,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {19253#(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; {19254#(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:00,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {19254#(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; {19254#(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:00,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {19254#(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; {19254#(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:00,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {19254#(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; {19254#(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:00,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {19254#(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_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {19254#(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:00,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {19254#(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; {19254#(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:00,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {19254#(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; {19254#(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:00,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {19254#(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; {19254#(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:00,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {19254#(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; {19254#(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:00,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {19254#(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; {19255#(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:00,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {19255#(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; {19255#(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:00,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {19255#(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; {19255#(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:00,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {19255#(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; {19256#(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:00,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {19256#(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; {19256#(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:00,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {19256#(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; {19256#(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:00,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {19256#(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; {19257#(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:00,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {19257#(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; {19257#(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:00,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {19257#(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); {19257#(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:00,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {19257#(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; {19257#(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:00,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {19257#(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_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {19257#(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:00,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {19257#(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; {19257#(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:00,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {19257#(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; {19257#(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:00,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {19257#(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; {19258#(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:00,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {19258#(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; {19258#(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:00,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {19258#(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); {19259#(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:00,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {19259#(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~1#1;main_~node2__m2~1#1 := ~nomsg~0; {19260#(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:00,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {19260#(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~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19261#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {19261#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {19261#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {19261#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {19262#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:00,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {19262#(<= (+ ~p2_old~0 1) ~id3~0)} ~mode2~0 := 0; {19262#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:00,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {19262#(<= (+ ~p2_old~0 1) ~id3~0)} ~__tmp_746_0~0 := main_~main____CPAchecker_TMP_0~0#1; {19262#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:00,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {19262#(<= (+ ~p2_old~0 1) ~id3~0)} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_746_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {19262#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:00,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {19262#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19263#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:00,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {19263#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} assume main_~node3__m3~7#1 != ~nomsg~0; {19263#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:00,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {19263#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} assume main_~node3__m3~7#1 > ~id3~0;~send3~0 := main_~node3__m3~7#1; {19247#false} is VALID [2022-02-20 18:51:00,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {19247#false} ~mode3~0 := 0; {19247#false} is VALID [2022-02-20 18:51:00,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {19247#false} ~__tmp_601_0~0 := main_~main____CPAchecker_TMP_0~4#1; {19247#false} is VALID [2022-02-20 18:51:00,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {19247#false} main_~main____CPAchecker_TMP_0~7#1 := ~__tmp_601_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~13#1; {19247#false} is VALID [2022-02-20 18:51:00,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {19247#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19247#false} is VALID [2022-02-20 18:51:00,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {19247#false} assume !(~r1~0 >= 3); {19247#false} is VALID [2022-02-20 18:51:00,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {19247#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_617~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_617~0;havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {19247#false} is VALID [2022-02-20 18:51:00,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {19247#false} assume 0 == main_~assert__arg~13#1 % 256; {19247#false} is VALID [2022-02-20 18:51:00,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {19247#false} assume !false; {19247#false} is VALID [2022-02-20 18:51:00,505 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:00,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:00,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047592626] [2022-02-20 18:51:00,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047592626] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:00,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:00,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:00,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953839905] [2022-02-20 18:51:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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 56 [2022-02-20 18:51:00,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:00,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:00,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:00,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:00,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:00,537 INFO L87 Difference]: Start difference. First operand 187 states and 238 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,857 INFO L93 Difference]: Finished difference Result 221 states and 270 transitions. [2022-02-20 18:51:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 18:51:02,858 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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 56 [2022-02-20 18:51:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 187 transitions. [2022-02-20 18:51:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 187 transitions. [2022-02-20 18:51:02,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 187 transitions. [2022-02-20 18:51:02,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:02,959 INFO L225 Difference]: With dead ends: 221 [2022-02-20 18:51:02,960 INFO L226 Difference]: Without dead ends: 212 [2022-02-20 18:51:02,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2022-02-20 18:51:02,961 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:02,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 1540 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-20 18:51:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 193. [2022-02-20 18:51:03,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:03,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 193 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 192 states have internal predecessors, (244), 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:03,689 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 193 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 192 states have internal predecessors, (244), 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:03,689 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 193 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 192 states have internal predecessors, (244), 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:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:03,708 INFO L93 Difference]: Finished difference Result 212 states and 261 transitions. [2022-02-20 18:51:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2022-02-20 18:51:03,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:03,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:03,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 192 states have internal predecessors, (244), 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 212 states. [2022-02-20 18:51:03,709 INFO L87 Difference]: Start difference. First operand has 193 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 192 states have internal predecessors, (244), 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 212 states. [2022-02-20 18:51:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:03,717 INFO L93 Difference]: Finished difference Result 212 states and 261 transitions. [2022-02-20 18:51:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2022-02-20 18:51:03,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:03,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:03,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:03,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 192 states have internal predecessors, (244), 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:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 244 transitions. [2022-02-20 18:51:03,721 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 244 transitions. Word has length 56 [2022-02-20 18:51:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:03,722 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 244 transitions. [2022-02-20 18:51:03,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 244 transitions. [2022-02-20 18:51:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:51:03,722 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:03,722 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, 1, 1] [2022-02-20 18:51:03,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:51:03,735 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:03,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1082760790, now seen corresponding path program 1 times [2022-02-20 18:51:03,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:03,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213089952] [2022-02-20 18:51:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:03,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:04,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {20261#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {20261#true} is VALID [2022-02-20 18:51:04,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {20261#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {20263#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:04,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {20263#(<= ~id3~0 127)} assume 0 == ~r1~0; {20263#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:04,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {20263#(<= ~id3~0 127)} assume ~id1~0 >= 0; {20264#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:04,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {20264#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~st1~0; {20264#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:04,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {20264#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {20265#(and (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:04,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {20265#(and (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} assume 0 == ~mode1~0 % 256; {20265#(and (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:04,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {20265#(and (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~send1~0) (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 127)))} assume ~id2~0 >= 0; {20266#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {20266#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {20266#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {20266#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {20266#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {20266#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {20266#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {20266#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {20267#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {20267#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {20267#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {20267#(and (<= (+ ~send1~0 ~id3~0) (+ ~id1~0 ~id2~0 127)) (<= 0 ~id3~0) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {20268#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {20268#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {20268#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {20268#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {20268#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:04,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {20268#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))))) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~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; {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume ~send1~0 != ~nomsg~0; {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {20269#(and (<= (+ ~send3~0 ~send1~0) (+ ~id1~0 ~id2~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~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; {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume ~send2~0 != ~nomsg~0; {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~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; {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} assume ~send3~0 != ~nomsg~0; {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:04,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {20270#(and (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~p1_new~0) (+ ~id1~0 ~id2~0 127))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)) (<= 0 ~send3~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 127) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~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; {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume !(~r1~0 >= 3); {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~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; {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {20271#(or (and (or (<= ~id1~0 ~id3~0) (<= ~p3_old~0 ~id3~0)) (or (not (<= ~id1~0 ~id3~0)) (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 129 ~p1_old~0) (+ ~id1~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; {20272#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~id1~0 ~id3~0) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0))) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {20272#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~id1~0 ~id3~0) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0))) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {20272#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~id1~0 ~id3~0) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0))) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {20272#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~id1~0 ~id3~0) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0))) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {20273#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (not (<= ~id1~0 ~id3~0)) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0)) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:04,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {20273#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (not (<= ~id1~0 ~id3~0)) (<= |ULTIMATE.start_main_~node1__m1~1#1| ~id3~0)) (<= (+ 129 ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|) (+ ~id1~0 ~id2~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {20274#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:51:04,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {20274#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20275#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {20275#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 != ~nomsg~0; {20275#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {20275#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {20262#false} ~mode2~0 := 0; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {20262#false} ~__tmp_746_0~0 := main_~main____CPAchecker_TMP_0~0#1; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {20262#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_746_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {20262#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {20262#false} assume main_~node3__m3~7#1 != ~nomsg~0; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {20262#false} assume !(main_~node3__m3~7#1 > ~id3~0); {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {20262#false} assume !(main_~node3__m3~7#1 == ~id3~0); {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {20262#false} ~mode3~0 := 0; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {20262#false} ~__tmp_601_0~0 := main_~main____CPAchecker_TMP_0~4#1; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {20262#false} main_~main____CPAchecker_TMP_0~7#1 := ~__tmp_601_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~13#1; {20262#false} is VALID [2022-02-20 18:51:04,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {20262#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20262#false} is VALID [2022-02-20 18:51:04,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {20262#false} assume !(~r1~0 >= 3); {20262#false} is VALID [2022-02-20 18:51:04,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {20262#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_617~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_617~0;havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {20262#false} is VALID [2022-02-20 18:51:04,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {20262#false} assume 0 == main_~assert__arg~13#1 % 256; {20262#false} is VALID [2022-02-20 18:51:04,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {20262#false} assume !false; {20262#false} is VALID [2022-02-20 18:51:04,106 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:04,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:04,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213089952] [2022-02-20 18:51:04,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213089952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:04,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:04,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 18:51:04,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719580308] [2022-02-20 18:51:04,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:04,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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 57 [2022-02-20 18:51:04,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:04,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:04,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 18:51:04,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:04,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 18:51:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:51:04,148 INFO L87 Difference]: Start difference. First operand 193 states and 244 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:06,519 INFO L93 Difference]: Finished difference Result 212 states and 261 transitions. [2022-02-20 18:51:06,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 18:51:06,519 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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 57 [2022-02-20 18:51:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2022-02-20 18:51:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2022-02-20 18:51:06,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 178 transitions. [2022-02-20 18:51:06,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:06,682 INFO L225 Difference]: With dead ends: 212 [2022-02-20 18:51:06,682 INFO L226 Difference]: Without dead ends: 196 [2022-02-20 18:51:06,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2022-02-20 18:51:06,682 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 296 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:06,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 1023 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-20 18:51:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2022-02-20 18:51:07,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:07,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 187 states, 185 states have (on average 1.281081081081081) internal successors, (237), 186 states have internal predecessors, (237), 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:07,332 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 187 states, 185 states have (on average 1.281081081081081) internal successors, (237), 186 states have internal predecessors, (237), 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:07,332 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 187 states, 185 states have (on average 1.281081081081081) internal successors, (237), 186 states have internal predecessors, (237), 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:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:07,342 INFO L93 Difference]: Finished difference Result 196 states and 245 transitions. [2022-02-20 18:51:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 245 transitions. [2022-02-20 18:51:07,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:07,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:07,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 185 states have (on average 1.281081081081081) internal successors, (237), 186 states have internal predecessors, (237), 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 196 states. [2022-02-20 18:51:07,342 INFO L87 Difference]: Start difference. First operand has 187 states, 185 states have (on average 1.281081081081081) internal successors, (237), 186 states have internal predecessors, (237), 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 196 states. [2022-02-20 18:51:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:07,344 INFO L93 Difference]: Finished difference Result 196 states and 245 transitions. [2022-02-20 18:51:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 245 transitions. [2022-02-20 18:51:07,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:07,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:07,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:07,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 1.281081081081081) internal successors, (237), 186 states have internal predecessors, (237), 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:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2022-02-20 18:51:07,347 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 57 [2022-02-20 18:51:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:07,347 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2022-02-20 18:51:07,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2022-02-20 18:51:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:51:07,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:07,348 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, 1, 1] [2022-02-20 18:51:07,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:51:07,349 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1556324125, now seen corresponding path program 1 times [2022-02-20 18:51:07,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:07,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862450474] [2022-02-20 18:51:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:07,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {21223#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {21223#true} is VALID [2022-02-20 18:51:07,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {21223#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {21225#(and (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:51:07,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {21225#(and (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} assume 0 == ~r1~0; {21225#(and (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:51:07,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {21225#(and (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} assume ~id1~0 >= 0; {21226#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:51:07,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {21226#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} assume 0 == ~st1~0; {21226#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} is VALID [2022-02-20 18:51:07,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {21226#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 (+ ~send1~0 255)))} assume ~send1~0 == ~id1~0; {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:07,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume 0 == ~mode1~0 % 256; {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:07,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume ~id2~0 >= 0; {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:07,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume 0 == ~st2~0; {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:07,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume ~send2~0 == ~id2~0; {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:07,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume 0 == ~mode2~0 % 256; {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:07,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {21227#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (<= ~id1~0 127))} assume ~id3~0 >= 0; {21228#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} is VALID [2022-02-20 18:51:07,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {21228#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} assume 0 == ~st3~0; {21228#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} is VALID [2022-02-20 18:51:07,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {21228#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} assume ~send3~0 == ~id3~0; {21229#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {21229#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume 0 == ~mode3~0 % 256; {21229#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {21229#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~id1~0 != ~id2~0; {21229#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {21229#(and (or (<= ~id3~0 ~send3~0) (< ~id3~0 (+ ~id1~0 1))) (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~id1~0 != ~id3~0; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~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; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~send1~0 != ~nomsg~0; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~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; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~send2~0 != ~nomsg~0; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~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; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} assume ~send3~0 != ~nomsg~0; {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:07,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {21230#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~send3~0 127)) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (<= ~send3~0 ~id3~0) (<= ~id1~0 ~id3~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; {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:07,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:07,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume !(~r1~0 >= 3); {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:07,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:07,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:07,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_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; {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:07,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0))} is VALID [2022-02-20 18:51:07,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {21231#(or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_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; {21232#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:07,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {21232#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} assume main_~node1__m1~1#1 != ~nomsg~0; {21232#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:07,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {21232#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 > ~id1~0); {21233#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:51:07,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {21233#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {21224#false} is VALID [2022-02-20 18:51:07,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {21224#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21224#false} is VALID [2022-02-20 18:51:07,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {21224#false} assume main_~node2__m2~1#1 != ~nomsg~0; {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {21224#false} assume !(main_~node2__m2~1#1 > ~id2~0); {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {21224#false} assume !(main_~node2__m2~1#1 == ~id2~0); {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {21224#false} ~mode2~0 := 0; {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {21224#false} ~__tmp_746_0~0 := main_~main____CPAchecker_TMP_0~0#1; {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {21224#false} main_~main____CPAchecker_TMP_0~4#1 := ~__tmp_746_0~0;havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {21224#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 47: Hoare triple {21224#false} assume main_~node3__m3~7#1 != ~nomsg~0; {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {21224#false} assume main_~node3__m3~7#1 > ~id3~0;~send3~0 := main_~node3__m3~7#1; {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {21224#false} ~mode3~0 := 0; {21224#false} is VALID [2022-02-20 18:51:07,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {21224#false} ~__tmp_601_0~0 := main_~main____CPAchecker_TMP_0~4#1; {21224#false} is VALID [2022-02-20 18:51:07,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {21224#false} main_~main____CPAchecker_TMP_0~7#1 := ~__tmp_601_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~13#1; {21224#false} is VALID [2022-02-20 18:51:07,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {21224#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21224#false} is VALID [2022-02-20 18:51:07,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {21224#false} assume !(~r1~0 >= 3); {21224#false} is VALID [2022-02-20 18:51:07,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {21224#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_617~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_617~0;havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {21224#false} is VALID [2022-02-20 18:51:07,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {21224#false} assume 0 == main_~assert__arg~13#1 % 256; {21224#false} is VALID [2022-02-20 18:51:07,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {21224#false} assume !false; {21224#false} is VALID [2022-02-20 18:51:07,612 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:07,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:07,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862450474] [2022-02-20 18:51:07,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862450474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:07,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:07,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:51:07,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496934063] [2022-02-20 18:51:07,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:07,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 57 [2022-02-20 18:51:07,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:07,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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:07,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:07,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:51:07,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:07,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:51:07,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:51:07,656 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:11,772 INFO L93 Difference]: Finished difference Result 455 states and 631 transitions. [2022-02-20 18:51:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:11,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 57 [2022-02-20 18:51:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 383 transitions. [2022-02-20 18:51:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 383 transitions. [2022-02-20 18:51:11,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 383 transitions. [2022-02-20 18:51:12,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:12,037 INFO L225 Difference]: With dead ends: 455 [2022-02-20 18:51:12,037 INFO L226 Difference]: Without dead ends: 435 [2022-02-20 18:51:12,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:51:12,040 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 722 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:12,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 1028 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-02-20 18:51:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 167. [2022-02-20 18:51:12,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:12,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 167 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 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:51:12,654 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 167 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 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:51:12,654 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 167 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 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:51:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:12,661 INFO L93 Difference]: Finished difference Result 435 states and 610 transitions. [2022-02-20 18:51:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 610 transitions. [2022-02-20 18:51:12,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:12,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:12,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 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 435 states. [2022-02-20 18:51:12,662 INFO L87 Difference]: Start difference. First operand has 167 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 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 435 states. [2022-02-20 18:51:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:12,668 INFO L93 Difference]: Finished difference Result 435 states and 610 transitions. [2022-02-20 18:51:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 610 transitions. [2022-02-20 18:51:12,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:12,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:12,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:12,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 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:51:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 216 transitions. [2022-02-20 18:51:12,672 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 216 transitions. Word has length 57 [2022-02-20 18:51:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:12,672 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 216 transitions. [2022-02-20 18:51:12,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 216 transitions. [2022-02-20 18:51:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:51:12,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:12,673 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, 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:12,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 18:51:12,674 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1117882514, now seen corresponding path program 1 times [2022-02-20 18:51:12,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:12,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008343909] [2022-02-20 18:51:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:12,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {22969#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {22969#true} is VALID [2022-02-20 18:51:12,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {22969#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {22969#true} is VALID [2022-02-20 18:51:12,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {22969#true} assume 0 == ~r1~0; {22969#true} is VALID [2022-02-20 18:51:12,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {22969#true} assume ~id1~0 >= 0; {22969#true} is VALID [2022-02-20 18:51:12,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {22969#true} assume 0 == ~st1~0; {22971#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:12,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {22971#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {22971#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:12,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {22971#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {22971#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:12,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {22971#(<= ~st1~0 0)} assume ~id2~0 >= 0; {22971#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:12,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {22971#(<= ~st1~0 0)} assume 0 == ~st2~0; {22972#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {22972#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {22972#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {22972#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {22972#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {22972#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {22972#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {22972#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~0#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 != ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_650_0~0 := main_~main____CPAchecker_TMP_0~1#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_650_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_516_0~0 := main_~main____CPAchecker_TMP_0~6#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_516_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~15#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~15#1 := 1;~__return_535~0 := main_~check__tmp~15#1;main_~main__c1~0#1 := ~__return_535~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; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} 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_544_0~0 := main_~main____CPAchecker_TMP_0~9#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_544_0~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~9#1;main_~node1__m1~9#1 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 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~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~9#1 != ~nomsg~0); {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~10#1;main_~node2__m2~10#1 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~10#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~10#1 != ~nomsg~0); {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,768 INFO L290 TraceCheckUtils]: 64: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,768 INFO L290 TraceCheckUtils]: 65: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,769 INFO L290 TraceCheckUtils]: 67: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~12#1 != ~nomsg~0); {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,769 INFO L290 TraceCheckUtils]: 68: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,770 INFO L290 TraceCheckUtils]: 69: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~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~16#1; {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:12,770 INFO L290 TraceCheckUtils]: 70: Hoare triple {22973#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~16#1 := 0; {22970#false} is VALID [2022-02-20 18:51:12,770 INFO L290 TraceCheckUtils]: 71: Hoare triple {22970#false} ~__return_1315~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1315~0;~__tmp_1168_0~0 := main_~main____CPAchecker_TMP_0~9#1; {22970#false} is VALID [2022-02-20 18:51:12,770 INFO L290 TraceCheckUtils]: 72: Hoare triple {22970#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1168_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {22970#false} is VALID [2022-02-20 18:51:12,770 INFO L290 TraceCheckUtils]: 73: Hoare triple {22970#false} assume 0 == main_~assert__arg~1#1 % 256; {22970#false} is VALID [2022-02-20 18:51:12,770 INFO L290 TraceCheckUtils]: 74: Hoare triple {22970#false} assume !false; {22970#false} is VALID [2022-02-20 18:51:12,771 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:12,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:12,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008343909] [2022-02-20 18:51:12,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008343909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:12,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:12,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:12,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450944835] [2022-02-20 18:51:12,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:12,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 75 [2022-02-20 18:51:12,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:12,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:12,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:12,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:12,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:12,826 INFO L87 Difference]: Start difference. First operand 167 states and 216 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:15,907 INFO L93 Difference]: Finished difference Result 671 states and 972 transitions. [2022-02-20 18:51:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:51:15,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 75 [2022-02-20 18:51:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 513 transitions. [2022-02-20 18:51:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 513 transitions. [2022-02-20 18:51:15,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 513 transitions. [2022-02-20 18:51:16,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 513 edges. 513 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:16,231 INFO L225 Difference]: With dead ends: 671 [2022-02-20 18:51:16,232 INFO L226 Difference]: Without dead ends: 587 [2022-02-20 18:51:16,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:51:16,232 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 534 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:16,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 463 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-02-20 18:51:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 249. [2022-02-20 18:51:17,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:17,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 249 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 248 states have internal predecessors, (337), 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,560 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 249 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 248 states have internal predecessors, (337), 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,560 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 249 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 248 states have internal predecessors, (337), 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,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,571 INFO L93 Difference]: Finished difference Result 587 states and 834 transitions. [2022-02-20 18:51:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 834 transitions. [2022-02-20 18:51:17,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:17,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:17,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 248 states have internal predecessors, (337), 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 587 states. [2022-02-20 18:51:17,572 INFO L87 Difference]: Start difference. First operand has 249 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 248 states have internal predecessors, (337), 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 587 states. [2022-02-20 18:51:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,583 INFO L93 Difference]: Finished difference Result 587 states and 834 transitions. [2022-02-20 18:51:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 834 transitions. [2022-02-20 18:51:17,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:17,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:17,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:17,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 248 states have internal predecessors, (337), 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,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 337 transitions. [2022-02-20 18:51:17,588 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 337 transitions. Word has length 75 [2022-02-20 18:51:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:17,588 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 337 transitions. [2022-02-20 18:51:17,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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,588 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 337 transitions. [2022-02-20 18:51:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:51:17,589 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:17,589 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, 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,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 18:51:17,589 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1016465065, now seen corresponding path program 1 times [2022-02-20 18:51:17,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:17,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978311871] [2022-02-20 18:51:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:17,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:17,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {25419#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {25419#true} is VALID [2022-02-20 18:51:17,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {25419#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {25419#true} is VALID [2022-02-20 18:51:17,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {25419#true} assume 0 == ~r1~0; {25419#true} is VALID [2022-02-20 18:51:17,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {25419#true} assume ~id1~0 >= 0; {25419#true} is VALID [2022-02-20 18:51:17,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {25419#true} assume 0 == ~st1~0; {25421#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:17,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {25421#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {25421#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:17,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {25421#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {25421#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:17,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {25421#(<= ~st1~0 0)} assume ~id2~0 >= 0; {25421#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:17,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {25421#(<= ~st1~0 0)} assume 0 == ~st2~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 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; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 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; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 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; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 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; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 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; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 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; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} ~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~0#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 != ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} ~__tmp_650_0~0 := main_~main____CPAchecker_TMP_0~1#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_650_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} ~__tmp_516_0~0 := main_~main____CPAchecker_TMP_0~6#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_516_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~15#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~15#1 := 1;~__return_535~0 := main_~check__tmp~15#1;main_~main__c1~0#1 := ~__return_535~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; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} 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_544_0~0 := main_~main____CPAchecker_TMP_0~9#1; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_544_0~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~9#1;main_~node1__m1~9#1 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,658 INFO L290 TraceCheckUtils]: 58: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 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~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,658 INFO L290 TraceCheckUtils]: 59: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~9#1 != ~nomsg~0); {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,658 INFO L290 TraceCheckUtils]: 60: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~10#1;main_~node2__m2~10#1 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,659 INFO L290 TraceCheckUtils]: 62: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~10#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~10#1 != ~nomsg~0); {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,660 INFO L290 TraceCheckUtils]: 66: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,660 INFO L290 TraceCheckUtils]: 67: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~12#1 != ~nomsg~0; {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,660 INFO L290 TraceCheckUtils]: 68: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~12#1 > ~id3~0); {25422#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:17,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {25422#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~12#1 == ~id3~0;~st3~0 := 1; {25423#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:17,661 INFO L290 TraceCheckUtils]: 70: Hoare triple {25423#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {25423#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:17,661 INFO L290 TraceCheckUtils]: 71: Hoare triple {25423#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~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~16#1; {25423#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:17,662 INFO L290 TraceCheckUtils]: 72: Hoare triple {25423#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~16#1 := 0; {25420#false} is VALID [2022-02-20 18:51:17,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {25420#false} ~__return_1315~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1315~0;~__tmp_1168_0~0 := main_~main____CPAchecker_TMP_0~9#1; {25420#false} is VALID [2022-02-20 18:51:17,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {25420#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1168_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {25420#false} is VALID [2022-02-20 18:51:17,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {25420#false} assume 0 == main_~assert__arg~1#1 % 256; {25420#false} is VALID [2022-02-20 18:51:17,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {25420#false} assume !false; {25420#false} is VALID [2022-02-20 18:51:17,662 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,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:17,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978311871] [2022-02-20 18:51:17,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978311871] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:17,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:17,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:51:17,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394418692] [2022-02-20 18:51:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:17,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2022-02-20 18:51:17,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:17,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:17,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:17,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:17,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:17,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:17,713 INFO L87 Difference]: Start difference. First operand 249 states and 337 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:21,390 INFO L93 Difference]: Finished difference Result 831 states and 1200 transitions. [2022-02-20 18:51:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:21,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2022-02-20 18:51:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-02-20 18:51:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-02-20 18:51:21,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-02-20 18:51:21,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:21,542 INFO L225 Difference]: With dead ends: 831 [2022-02-20 18:51:21,542 INFO L226 Difference]: Without dead ends: 665 [2022-02-20 18:51:21,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:51:21,543 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 297 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:21,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 417 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-02-20 18:51:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 413. [2022-02-20 18:51:23,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:23,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 665 states. Second operand has 413 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 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,499 INFO L74 IsIncluded]: Start isIncluded. First operand 665 states. Second operand has 413 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 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,499 INFO L87 Difference]: Start difference. First operand 665 states. Second operand has 413 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 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,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,512 INFO L93 Difference]: Finished difference Result 665 states and 951 transitions. [2022-02-20 18:51:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 951 transitions. [2022-02-20 18:51:23,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 413 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 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 665 states. [2022-02-20 18:51:23,513 INFO L87 Difference]: Start difference. First operand has 413 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 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 665 states. [2022-02-20 18:51:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,526 INFO L93 Difference]: Finished difference Result 665 states and 951 transitions. [2022-02-20 18:51:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 951 transitions. [2022-02-20 18:51:23,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:23,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 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,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 581 transitions. [2022-02-20 18:51:23,535 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 581 transitions. Word has length 77 [2022-02-20 18:51:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:23,535 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 581 transitions. [2022-02-20 18:51:23,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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,535 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 581 transitions. [2022-02-20 18:51:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:51:23,536 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:23,536 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, 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:23,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 18:51:23,536 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1101947074, now seen corresponding path program 1 times [2022-02-20 18:51:23,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:23,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253925124] [2022-02-20 18:51:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:23,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {28483#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {28483#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {28483#true} assume 0 == ~r1~0; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {28483#true} assume ~id1~0 >= 0; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {28483#true} assume 0 == ~st1~0; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {28483#true} assume ~send1~0 == ~id1~0; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {28483#true} assume 0 == ~mode1~0 % 256; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {28483#true} assume ~id2~0 >= 0; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {28483#true} assume 0 == ~st2~0; {28483#true} is VALID [2022-02-20 18:51:23,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {28483#true} assume ~send2~0 == ~id2~0; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {28483#true} assume 0 == ~mode2~0 % 256; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {28483#true} assume ~id3~0 >= 0; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {28483#true} assume 0 == ~st3~0; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {28483#true} assume ~send3~0 == ~id3~0; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {28483#true} assume 0 == ~mode3~0 % 256; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {28483#true} assume ~id1~0 != ~id2~0; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {28483#true} assume ~id1~0 != ~id3~0; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {28483#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {28483#true} is VALID [2022-02-20 18:51:23,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {28483#true} 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; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {28483#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {28483#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {28483#true} assume ~send1~0 != ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {28483#true} 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; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {28483#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {28483#true} assume ~send2~0 != ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {28483#true} 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; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {28483#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {28483#true} assume ~send3~0 != ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {28483#true} 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; {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {28483#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {28483#true} assume !(~r1~0 >= 3); {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {28483#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {28483#true} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {28483#true} 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; {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {28483#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {28483#true} 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; {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {28483#true} assume main_~node1__m1~1#1 != ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {28483#true} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {28483#true} ~mode1~0 := 0; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {28483#true} ~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~0#1; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {28483#true} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {28483#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {28483#true} assume main_~node2__m2~2#1 != ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {28483#true} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {28483#true} ~mode2~0 := 0; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {28483#true} ~__tmp_650_0~0 := main_~main____CPAchecker_TMP_0~1#1; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {28483#true} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_650_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {28483#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {28483#true} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {28483#true} ~__tmp_516_0~0 := main_~main____CPAchecker_TMP_0~6#1; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 50: Hoare triple {28483#true} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_516_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~15#1; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {28483#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {28483#true} assume !(~r1~0 >= 3); {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {28483#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {28483#true} assume ~r1~0 < 3;main_~check__tmp~15#1 := 1;~__return_535~0 := main_~check__tmp~15#1;main_~main__c1~0#1 := ~__return_535~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; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {28483#true} 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_544_0~0 := main_~main____CPAchecker_TMP_0~9#1; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {28483#true} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_544_0~0; {28483#true} is VALID [2022-02-20 18:51:23,574 INFO L290 TraceCheckUtils]: 57: Hoare triple {28483#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~9#1;main_~node1__m1~9#1 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 58: Hoare triple {28483#true} 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~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 59: Hoare triple {28483#true} assume !(main_~node1__m1~9#1 != ~nomsg~0); {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 60: Hoare triple {28483#true} ~mode1~0 := 0; {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {28483#true} havoc main_~node2__m2~10#1;main_~node2__m2~10#1 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {28483#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~10#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {28483#true} assume !(main_~node2__m2~10#1 != ~nomsg~0); {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 64: Hoare triple {28483#true} ~mode2~0 := 0; {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 65: Hoare triple {28483#true} havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 66: Hoare triple {28483#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28483#true} is VALID [2022-02-20 18:51:23,575 INFO L290 TraceCheckUtils]: 67: Hoare triple {28483#true} assume !(main_~node3__m3~12#1 != ~nomsg~0); {28483#true} is VALID [2022-02-20 18:51:23,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {28483#true} ~mode3~0 := 0; {28483#true} is VALID [2022-02-20 18:51:23,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {28483#true} ~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; {28483#true} is VALID [2022-02-20 18:51:23,576 INFO L290 TraceCheckUtils]: 70: Hoare triple {28483#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28483#true} is VALID [2022-02-20 18:51:23,576 INFO L290 TraceCheckUtils]: 71: Hoare triple {28483#true} assume ~r1~0 >= 3; {28485#(not (<= ~r1~0 2))} is VALID [2022-02-20 18:51:23,576 INFO L290 TraceCheckUtils]: 72: Hoare triple {28485#(not (<= ~r1~0 2))} assume ~r1~0 < 3;main_~check__tmp~16#1 := 1; {28484#false} is VALID [2022-02-20 18:51:23,577 INFO L290 TraceCheckUtils]: 73: Hoare triple {28484#false} ~__return_1315~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1315~0;~__tmp_1168_0~0 := main_~main____CPAchecker_TMP_0~9#1; {28484#false} is VALID [2022-02-20 18:51:23,577 INFO L290 TraceCheckUtils]: 74: Hoare triple {28484#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1168_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {28484#false} is VALID [2022-02-20 18:51:23,577 INFO L290 TraceCheckUtils]: 75: Hoare triple {28484#false} assume 0 == main_~assert__arg~1#1 % 256; {28484#false} is VALID [2022-02-20 18:51:23,577 INFO L290 TraceCheckUtils]: 76: Hoare triple {28484#false} assume !false; {28484#false} is VALID [2022-02-20 18:51:23,577 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,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:23,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253925124] [2022-02-20 18:51:23,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253925124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:23,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:23,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:23,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489574928] [2022-02-20 18:51:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2022-02-20 18:51:23,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:23,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:23,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:23,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:23,607 INFO L87 Difference]: Start difference. First operand 413 states and 581 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:28,454 INFO L93 Difference]: Finished difference Result 1021 states and 1471 transitions. [2022-02-20 18:51:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2022-02-20 18:51:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2022-02-20 18:51:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2022-02-20 18:51:28,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 246 transitions. [2022-02-20 18:51:28,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:28,570 INFO L225 Difference]: With dead ends: 1021 [2022-02-20 18:51:28,570 INFO L226 Difference]: Without dead ends: 691 [2022-02-20 18:51:28,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:28,571 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 51 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:28,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 290 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-02-20 18:51:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-02-20 18:51:32,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:32,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 689 states, 688 states have (on average 1.3997093023255813) internal successors, (963), 688 states have internal predecessors, (963), 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:32,718 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 689 states, 688 states have (on average 1.3997093023255813) internal successors, (963), 688 states have internal predecessors, (963), 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:32,718 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 689 states, 688 states have (on average 1.3997093023255813) internal successors, (963), 688 states have internal predecessors, (963), 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:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:32,732 INFO L93 Difference]: Finished difference Result 691 states and 964 transitions. [2022-02-20 18:51:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 964 transitions. [2022-02-20 18:51:32,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:32,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:32,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 689 states, 688 states have (on average 1.3997093023255813) internal successors, (963), 688 states have internal predecessors, (963), 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 691 states. [2022-02-20 18:51:32,733 INFO L87 Difference]: Start difference. First operand has 689 states, 688 states have (on average 1.3997093023255813) internal successors, (963), 688 states have internal predecessors, (963), 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 691 states. [2022-02-20 18:51:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:32,747 INFO L93 Difference]: Finished difference Result 691 states and 964 transitions. [2022-02-20 18:51:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 964 transitions. [2022-02-20 18:51:32,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:32,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:32,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:32,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.3997093023255813) internal successors, (963), 688 states have internal predecessors, (963), 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:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 963 transitions. [2022-02-20 18:51:32,767 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 963 transitions. Word has length 77 [2022-02-20 18:51:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:32,767 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 963 transitions. [2022-02-20 18:51:32,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 963 transitions. [2022-02-20 18:51:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:51:32,768 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:32,768 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, 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:32,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 18:51:32,768 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:32,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1035453562, now seen corresponding path program 1 times [2022-02-20 18:51:32,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:32,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843209303] [2022-02-20 18:51:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:32,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {32272#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(50, 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_94~0 := 0;~__return_412~0 := 0;~__return_1167~0 := 0;~__tmp_1168_0~0 := 0;~__return_398~0 := 0;~__tmp_986_0~0 := 0;~__return_1057~0 := 0;~__return_384~0 := 0;~__tmp_952_0~0 := 0;~__return_965~0 := 0;~__return_370~0 := 0;~__tmp_815_0~0 := 0;~__tmp_856_0~0 := 0;~__return_872~0 := 0;~__return_356~0 := 0;~__tmp_746_0~0 := 0;~__return_788~0 := 0;~__tmp_797_0~0 := 0;~__return_342~0 := 0;~__tmp_638_0~0 := 0;~__tmp_650_0~0 := 0;~__return_695~0 := 0;~__return_328~0 := 0;~__tmp_589_0~0 := 0;~__tmp_601_0~0 := 0;~__return_617~0 := 0;~__return_314~0 := 0;~__tmp_492_0~0 := 0;~__tmp_504_0~0 := 0;~__tmp_516_0~0 := 0;~__return_535~0 := 0;~__tmp_544_0~0 := 0;~__return_1315~0 := 0;~__return_1180~0 := 0; {32272#true} is VALID [2022-02-20 18:51:32,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {32272#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_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#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_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#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; {32272#true} is VALID [2022-02-20 18:51:32,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {32272#true} assume 0 == ~r1~0; {32272#true} is VALID [2022-02-20 18:51:32,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {32272#true} assume ~id1~0 >= 0; {32272#true} is VALID [2022-02-20 18:51:32,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {32272#true} assume 0 == ~st1~0; {32272#true} is VALID [2022-02-20 18:51:32,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {32272#true} assume ~send1~0 == ~id1~0; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {32272#true} assume 0 == ~mode1~0 % 256; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {32272#true} assume ~id2~0 >= 0; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {32272#true} assume 0 == ~st2~0; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {32272#true} assume ~send2~0 == ~id2~0; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {32272#true} assume 0 == ~mode2~0 % 256; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {32272#true} assume ~id3~0 >= 0; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {32272#true} assume 0 == ~st3~0; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {32272#true} assume ~send3~0 == ~id3~0; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {32272#true} assume 0 == ~mode3~0 % 256; {32272#true} is VALID [2022-02-20 18:51:32,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {32272#true} assume ~id1~0 != ~id2~0; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {32272#true} assume ~id1~0 != ~id3~0; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {32272#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_94~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_94~0; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {32272#true} 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; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {32272#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {32272#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {32272#true} assume ~send1~0 != ~nomsg~0; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {32272#true} 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; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {32272#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {32272#true} is VALID [2022-02-20 18:51:32,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {32272#true} assume ~send2~0 != ~nomsg~0; {32272#true} is VALID [2022-02-20 18:51:32,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {32272#true} 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; {32272#true} is VALID [2022-02-20 18:51:32,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {32272#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {32272#true} is VALID [2022-02-20 18:51:32,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {32272#true} assume ~send3~0 != ~nomsg~0; {32272#true} is VALID [2022-02-20 18:51:32,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {32272#true} 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; {32272#true} is VALID [2022-02-20 18:51:32,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {32272#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32272#true} is VALID [2022-02-20 18:51:32,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {32272#true} assume !(~r1~0 >= 3); {32272#true} is VALID [2022-02-20 18:51:32,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {32272#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_412~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_412~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; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 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; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 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; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_986_0~0 := main_~main____CPAchecker_TMP_0~0#1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_986_0~0;havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 != ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node2__m2~2#1 > ~id2~0;~send2~0 := main_~node2__m2~2#1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_650_0~0 := main_~main____CPAchecker_TMP_0~1#1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~6#1 := ~__tmp_650_0~0;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~8#1 != ~nomsg~0);~mode3~0 := 0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~__tmp_516_0~0 := main_~main____CPAchecker_TMP_0~6#1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~8#1 := ~__tmp_516_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~15#1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~15#1 := 1;~__return_535~0 := main_~check__tmp~15#1;main_~main__c1~0#1 := ~__return_535~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; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} 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_544_0~0 := main_~main____CPAchecker_TMP_0~9#1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~9#1 := ~__tmp_544_0~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~9#1;main_~node1__m1~9#1 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 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~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~9#1 != ~nomsg~0); {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~10#1;main_~node2__m2~10#1 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~10#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~10#1 != ~nomsg~0); {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~12#1;main_~node3__m3~12#1 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,815 INFO L290 TraceCheckUtils]: 66: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~12#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,815 INFO L290 TraceCheckUtils]: 67: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~12#1 != ~nomsg~0); {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,816 INFO L290 TraceCheckUtils]: 68: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~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~16#1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:32,817 INFO L290 TraceCheckUtils]: 72: Hoare triple {32274#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~16#1 := 0; {32273#false} is VALID [2022-02-20 18:51:32,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {32273#false} ~__return_1315~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1315~0;~__tmp_1168_0~0 := main_~main____CPAchecker_TMP_0~9#1; {32273#false} is VALID [2022-02-20 18:51:32,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {32273#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_1168_0~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {32273#false} is VALID [2022-02-20 18:51:32,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {32273#false} assume 0 == main_~assert__arg~1#1 % 256; {32273#false} is VALID [2022-02-20 18:51:32,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {32273#false} assume !false; {32273#false} is VALID [2022-02-20 18:51:32,817 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:32,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:32,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843209303] [2022-02-20 18:51:32,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843209303] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:32,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:32,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:32,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537746517] [2022-02-20 18:51:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:32,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2022-02-20 18:51:32,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:32,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:32,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:32,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:32,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:32,867 INFO L87 Difference]: Start difference. First operand 689 states and 963 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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)