./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:00,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:00,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:00,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:00,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:00,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:00,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:00,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:00,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:00,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:00,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:00,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:00,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:00,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:00,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:00,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:00,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:00,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:00,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:00,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:00,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:00,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:00,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:00,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:00,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:00,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:00,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:00,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:00,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:00,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:00,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:00,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:00,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:00,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:00,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:00,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:00,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:00,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:00,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:00,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:00,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:00,195 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:52:00,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:00,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:00,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:00,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:00,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:00,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:00,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:00,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:00,221 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:00,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:00,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:00,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:00,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:00,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:00,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:00,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:00,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:00,223 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:00,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:00,224 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:00,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:00,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:00,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:00,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:00,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:00,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:00,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:00,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:00,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:00,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:00,225 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:00,225 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:00,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:00,226 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 -> 38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174 [2022-02-20 18:52:00,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:00,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:00,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:00,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:00,447 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:00,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2022-02-20 18:52:00,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/034072ce4/fa7ae4de336b4eec98907e719993052b/FLAG61230ac43 [2022-02-20 18:52:00,933 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:00,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2022-02-20 18:52:00,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/034072ce4/fa7ae4de336b4eec98907e719993052b/FLAG61230ac43 [2022-02-20 18:52:00,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/034072ce4/fa7ae4de336b4eec98907e719993052b [2022-02-20 18:52:00,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:00,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:00,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:00,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:00,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:00,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:00" (1/1) ... [2022-02-20 18:52:00,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ebf524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:00, skipping insertion in model container [2022-02-20 18:52:00,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:00" (1/1) ... [2022-02-20 18:52:00,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:01,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:01,212 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2022-02-20 18:52:01,253 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2022-02-20 18:52:01,259 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2022-02-20 18:52:01,263 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2022-02-20 18:52:01,270 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2022-02-20 18:52:01,274 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2022-02-20 18:52:01,279 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2022-02-20 18:52:01,289 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2022-02-20 18:52:01,292 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2022-02-20 18:52:01,297 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2022-02-20 18:52:01,305 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2022-02-20 18:52:01,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:01,401 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:01,438 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2022-02-20 18:52:01,447 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2022-02-20 18:52:01,451 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2022-02-20 18:52:01,457 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2022-02-20 18:52:01,461 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2022-02-20 18:52:01,463 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2022-02-20 18:52:01,465 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2022-02-20 18:52:01,470 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2022-02-20 18:52:01,483 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2022-02-20 18:52:01,486 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2022-02-20 18:52:01,490 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.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2022-02-20 18:52:01,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:01,549 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:01,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01 WrapperNode [2022-02-20 18:52:01,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:01,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:01,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:01,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:01,555 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:52:01" (1/1) ... [2022-02-20 18:52:01,574 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:52:01" (1/1) ... [2022-02-20 18:52:01,660 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1868 [2022-02-20 18:52:01,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:01,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:01,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:01,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:01,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:01,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:01,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:01,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:01,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (1/1) ... [2022-02-20 18:52:01,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:01,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:01,766 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:52:01,795 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:52:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:01,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:01,952 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:01,954 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:03,107 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:03,120 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:03,120 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:03,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:03 BoogieIcfgContainer [2022-02-20 18:52:03,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:03,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:03,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:03,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:03,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:00" (1/3) ... [2022-02-20 18:52:03,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b96b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:03, skipping insertion in model container [2022-02-20 18:52:03,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:01" (2/3) ... [2022-02-20 18:52:03,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b96b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:03, skipping insertion in model container [2022-02-20 18:52:03,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:03" (3/3) ... [2022-02-20 18:52:03,128 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2022-02-20 18:52:03,133 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:03,133 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 18:52:03,176 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:03,180 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:52:03,181 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 18:52:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:52:03,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:03,235 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:03,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1374718599, now seen corresponding path program 1 times [2022-02-20 18:52:03,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:03,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725604211] [2022-02-20 18:52:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:03,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {363#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {363#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {363#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {363#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {364#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:03,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {364#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {364#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:03,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {365#(<= (+ ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {365#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {365#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {362#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {362#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {362#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~2#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~2#1 % 256 else main_~node2____CPAchecker_TMP_0~2#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {362#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {362#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {362#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~4#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~16#1;main_~node4__m4~16#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {362#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~8#1; {362#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {362#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~8#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~8#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~8#1 % 256 else main_~node4____CPAchecker_TMP_0~8#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~31#1; {362#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {362#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {362#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {362#false} assume !(~r1~0 >= 4); {362#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {362#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {362#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {362#false} assume ~r1~0 < 4;main_~check__tmp~31#1 := 1;~__return_3019~0 := main_~check__tmp~31#1;main_~main__c1~0#1 := ~__return_3019~0;havoc main_~__tmp_28~0#1;main_~__tmp_28~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~27#1;main_~assert__arg~27#1 := main_~__tmp_28~0#1; {362#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {362#false} assume !(0 == main_~assert__arg~27#1 % 256);main_~main____CPAchecker_TMP_0~17#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~17#1; {362#false} is VALID [2022-02-20 18:52:03,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {362#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {362#false} is VALID [2022-02-20 18:52:03,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {362#false} assume main_~node1__m1~1#1 != ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {362#false} assume !(main_~node1__m1~1#1 > ~id1~0); {362#false} is VALID [2022-02-20 18:52:03,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {362#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {362#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {362#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {362#false} is VALID [2022-02-20 18:52:03,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {362#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {362#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {362#false} assume main_~node3__m3~4#1 != ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,610 INFO L290 TraceCheckUtils]: 51: Hoare triple {362#false} assume !(main_~node3__m3~4#1 > ~id3~0); {362#false} is VALID [2022-02-20 18:52:03,611 INFO L290 TraceCheckUtils]: 52: Hoare triple {362#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,611 INFO L290 TraceCheckUtils]: 53: Hoare triple {362#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {362#false} is VALID [2022-02-20 18:52:03,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {362#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {362#false} is VALID [2022-02-20 18:52:03,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {362#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {362#false} is VALID [2022-02-20 18:52:03,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {362#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3735~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3735~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; {362#false} is VALID [2022-02-20 18:52:03,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {362#false} assume 0 == main_~assert__arg~11#1 % 256; {362#false} is VALID [2022-02-20 18:52:03,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-02-20 18:52:03,615 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:52:03,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:03,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725604211] [2022-02-20 18:52:03,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725604211] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:03,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:03,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:03,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348814154] [2022-02-20 18:52:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:03,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:03,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:03,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:03,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:03,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:03,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:03,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:03,695 INFO L87 Difference]: Start difference. First operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 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 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:04,617 INFO L93 Difference]: Finished difference Result 570 states and 974 transitions. [2022-02-20 18:52:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:52:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 974 transitions. [2022-02-20 18:52:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 974 transitions. [2022-02-20 18:52:04,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 974 transitions. [2022-02-20 18:52:05,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 974 edges. 974 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:05,304 INFO L225 Difference]: With dead ends: 570 [2022-02-20 18:52:05,304 INFO L226 Difference]: Without dead ends: 294 [2022-02-20 18:52:05,310 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:52:05,314 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 1455 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:05,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1455 Valid, 363 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-02-20 18:52:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-02-20 18:52:05,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:05,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 294 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,415 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 294 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,416 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 294 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:05,423 INFO L93 Difference]: Finished difference Result 294 states and 367 transitions. [2022-02-20 18:52:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2022-02-20 18:52:05,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:05,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:05,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 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 294 states. [2022-02-20 18:52:05,426 INFO L87 Difference]: Start difference. First operand has 294 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 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 294 states. [2022-02-20 18:52:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:05,432 INFO L93 Difference]: Finished difference Result 294 states and 367 transitions. [2022-02-20 18:52:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2022-02-20 18:52:05,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:05,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:05,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:05,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2022-02-20 18:52:05,441 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 59 [2022-02-20 18:52:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:05,442 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2022-02-20 18:52:05,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2022-02-20 18:52:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:52:05,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:05,443 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] [2022-02-20 18:52:05,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:05,444 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2133391140, now seen corresponding path program 1 times [2022-02-20 18:52:05,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:05,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433390494] [2022-02-20 18:52:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:05,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {1987#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1989#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {1989#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:05,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1989#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {1990#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:05,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {1990#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {1990#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:05,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {1990#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~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; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~12#1;main_~node4__m4~12#1 := ~nomsg~0; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {1991#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:05,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {1991#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~4#1 := ~p4_new~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~4#1 % 256 else main_~node4____CPAchecker_TMP_0~4#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~23#1; {1988#false} is VALID [2022-02-20 18:52:05,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {1988#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1988#false} is VALID [2022-02-20 18:52:05,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {1988#false} assume !(~r1~0 >= 4); {1988#false} is VALID [2022-02-20 18:52:05,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {1988#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {1988#false} is VALID [2022-02-20 18:52:05,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {1988#false} assume ~r1~0 < 4;main_~check__tmp~23#1 := 1;~__return_3970~0 := main_~check__tmp~23#1;main_~main__c1~0#1 := ~__return_3970~0;havoc main_~__tmp_20~0#1;main_~__tmp_20~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~19#1;main_~assert__arg~19#1 := main_~__tmp_20~0#1; {1988#false} is VALID [2022-02-20 18:52:05,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {1988#false} assume !(0 == main_~assert__arg~19#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_3029_0~0 := main_~main____CPAchecker_TMP_0~9#1; {1988#false} is VALID [2022-02-20 18:52:05,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {1988#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {1988#false} is VALID [2022-02-20 18:52:05,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {1988#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {1988#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {1988#false} assume main_~node1__m1~1#1 != ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {1988#false} assume !(main_~node1__m1~1#1 > ~id1~0); {1988#false} is VALID [2022-02-20 18:52:05,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {1988#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {1988#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {1988#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {1988#false} is VALID [2022-02-20 18:52:05,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {1988#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {1988#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {1988#false} assume main_~node3__m3~4#1 != ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {1988#false} assume !(main_~node3__m3~4#1 > ~id3~0); {1988#false} is VALID [2022-02-20 18:52:05,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {1988#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {1988#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1988#false} is VALID [2022-02-20 18:52:05,579 INFO L290 TraceCheckUtils]: 55: Hoare triple {1988#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {1988#false} is VALID [2022-02-20 18:52:05,581 INFO L290 TraceCheckUtils]: 56: Hoare triple {1988#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {1988#false} is VALID [2022-02-20 18:52:05,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {1988#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3735~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3735~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; {1988#false} is VALID [2022-02-20 18:52:05,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {1988#false} assume 0 == main_~assert__arg~11#1 % 256; {1988#false} is VALID [2022-02-20 18:52:05,590 INFO L290 TraceCheckUtils]: 59: Hoare triple {1988#false} assume !false; {1988#false} is VALID [2022-02-20 18:52:05,591 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:52:05,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:05,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433390494] [2022-02-20 18:52:05,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433390494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:05,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:05,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:05,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429693979] [2022-02-20 18:52:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:05,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:52:05,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:05,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:05,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:05,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:05,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:05,630 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:06,311 INFO L93 Difference]: Finished difference Result 497 states and 636 transitions. [2022-02-20 18:52:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:06,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:52:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2022-02-20 18:52:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2022-02-20 18:52:06,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 636 transitions. [2022-02-20 18:52:06,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:06,806 INFO L225 Difference]: With dead ends: 497 [2022-02-20 18:52:06,807 INFO L226 Difference]: Without dead ends: 274 [2022-02-20 18:52:06,807 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:52:06,808 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 932 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:06,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [932 Valid, 210 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-02-20 18:52:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-02-20 18:52:06,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:06,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 274 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,987 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 274 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,988 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 274 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:06,993 INFO L93 Difference]: Finished difference Result 274 states and 342 transitions. [2022-02-20 18:52:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2022-02-20 18:52:06,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:06,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:06,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 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 274 states. [2022-02-20 18:52:06,995 INFO L87 Difference]: Start difference. First operand has 274 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 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 274 states. [2022-02-20 18:52:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,000 INFO L93 Difference]: Finished difference Result 274 states and 342 transitions. [2022-02-20 18:52:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2022-02-20 18:52:07,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:07,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2022-02-20 18:52:07,019 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 60 [2022-02-20 18:52:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:07,021 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2022-02-20 18:52:07,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2022-02-20 18:52:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:52:07,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:07,022 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] [2022-02-20 18:52:07,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:07,023 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:07,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 626465560, now seen corresponding path program 1 times [2022-02-20 18:52:07,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:07,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171760365] [2022-02-20 18:52:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:07,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {3476#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {3478#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {3478#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {3478#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {3478#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {3478#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {3478#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {3478#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {3478#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {3478#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {3478#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {3478#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {3478#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {3479#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:07,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {3479#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {3479#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:07,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {3480#(<= (+ ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {3480#(<= (+ ~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; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3480#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:07,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {3480#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {3477#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {3477#false} is VALID [2022-02-20 18:52:07,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {3477#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~12#1;main_~node4__m4~12#1 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {3477#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {3477#false} is VALID [2022-02-20 18:52:07,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {3477#false} assume ~send4~0 != ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {3477#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~4#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~4#1 % 256 else main_~node4____CPAchecker_TMP_0~4#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~22#1; {3477#false} is VALID [2022-02-20 18:52:07,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {3477#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {3477#false} is VALID [2022-02-20 18:52:07,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {3477#false} assume !(~r1~0 >= 4); {3477#false} is VALID [2022-02-20 18:52:07,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {3477#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {3477#false} is VALID [2022-02-20 18:52:07,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {3477#false} assume ~r1~0 < 4;main_~check__tmp~22#1 := 1;~__return_4070~0 := main_~check__tmp~22#1;main_~main__c1~0#1 := ~__return_4070~0;havoc main_~__tmp_19~0#1;main_~__tmp_19~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~18#1;main_~assert__arg~18#1 := main_~__tmp_19~0#1; {3477#false} is VALID [2022-02-20 18:52:07,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {3477#false} assume !(0 == main_~assert__arg~18#1 % 256);main_~main____CPAchecker_TMP_0~8#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~8#1; {3477#false} is VALID [2022-02-20 18:52:07,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {3477#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {3477#false} is VALID [2022-02-20 18:52:07,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {3477#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {3477#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {3477#false} assume main_~node1__m1~1#1 != ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {3477#false} assume !(main_~node1__m1~1#1 > ~id1~0); {3477#false} is VALID [2022-02-20 18:52:07,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {3477#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,126 INFO L290 TraceCheckUtils]: 48: Hoare triple {3477#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {3477#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {3477#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {3477#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {3477#false} assume main_~node3__m3~4#1 != ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {3477#false} assume !(main_~node3__m3~4#1 > ~id3~0); {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {3477#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {3477#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {3477#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {3477#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {3477#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3735~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3735~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; {3477#false} is VALID [2022-02-20 18:52:07,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {3477#false} assume 0 == main_~assert__arg~11#1 % 256; {3477#false} is VALID [2022-02-20 18:52:07,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {3477#false} assume !false; {3477#false} is VALID [2022-02-20 18:52:07,128 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:52:07,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:07,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171760365] [2022-02-20 18:52:07,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171760365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:07,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:07,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:07,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134586185] [2022-02-20 18:52:07,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:07,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:07,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:07,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:07,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:07,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:07,169 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,831 INFO L93 Difference]: Finished difference Result 477 states and 610 transitions. [2022-02-20 18:52:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:07,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:52:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-02-20 18:52:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-02-20 18:52:07,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-02-20 18:52:08,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:08,237 INFO L225 Difference]: With dead ends: 477 [2022-02-20 18:52:08,237 INFO L226 Difference]: Without dead ends: 255 [2022-02-20 18:52:08,237 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:52:08,238 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 904 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:08,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [904 Valid, 199 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-02-20 18:52:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-02-20 18:52:08,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:08,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 255 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 254 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,427 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 255 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 254 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,427 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 255 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 254 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:08,431 INFO L93 Difference]: Finished difference Result 255 states and 320 transitions. [2022-02-20 18:52:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 320 transitions. [2022-02-20 18:52:08,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:08,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:08,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 254 states have internal predecessors, (320), 0 states have call successors, (0), 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 255 states. [2022-02-20 18:52:08,433 INFO L87 Difference]: Start difference. First operand has 255 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 254 states have internal predecessors, (320), 0 states have call successors, (0), 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 255 states. [2022-02-20 18:52:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:08,447 INFO L93 Difference]: Finished difference Result 255 states and 320 transitions. [2022-02-20 18:52:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 320 transitions. [2022-02-20 18:52:08,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:08,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:08,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:08,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 254 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 320 transitions. [2022-02-20 18:52:08,453 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 320 transitions. Word has length 61 [2022-02-20 18:52:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:08,453 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 320 transitions. [2022-02-20 18:52:08,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 320 transitions. [2022-02-20 18:52:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:08,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:08,454 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] [2022-02-20 18:52:08,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:52:08,454 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 55190193, now seen corresponding path program 1 times [2022-02-20 18:52:08,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:08,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197649267] [2022-02-20 18:52:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:08,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {4888#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {4890#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {4890#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:08,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {4890#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {4891#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:08,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {4891#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {4891#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:08,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {4891#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {4892#(<= (+ ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {4892#(<= (+ ~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; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {4892#(<= (+ ~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; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {4892#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4892#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:08,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {4892#(<= (+ ~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;havoc main_~node4__m4~10#1;main_~node4__m4~10#1 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {4889#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~2#1; {4889#false} is VALID [2022-02-20 18:52:08,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {4889#false} assume ~send4~0 != ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {4889#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~2#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~2#1 % 256 else main_~node4____CPAchecker_TMP_0~2#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~18#1; {4889#false} is VALID [2022-02-20 18:52:08,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {4889#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4889#false} is VALID [2022-02-20 18:52:08,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {4889#false} assume !(~r1~0 >= 4); {4889#false} is VALID [2022-02-20 18:52:08,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {4889#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4889#false} is VALID [2022-02-20 18:52:08,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {4889#false} assume ~r1~0 < 4;main_~check__tmp~18#1 := 1;~__return_4434~0 := main_~check__tmp~18#1;main_~main__c1~0#1 := ~__return_4434~0;havoc main_~__tmp_15~0#1;main_~__tmp_15~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~14#1;main_~assert__arg~14#1 := main_~__tmp_15~0#1; {4889#false} is VALID [2022-02-20 18:52:08,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {4889#false} assume !(0 == main_~assert__arg~14#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;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~4#1; {4889#false} is VALID [2022-02-20 18:52:08,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {4889#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {4889#false} is VALID [2022-02-20 18:52:08,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {4889#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {4889#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {4889#false} assume main_~node1__m1~1#1 != ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {4889#false} assume !(main_~node1__m1~1#1 > ~id1~0); {4889#false} is VALID [2022-02-20 18:52:08,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {4889#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {4889#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {4889#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {4889#false} is VALID [2022-02-20 18:52:08,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {4889#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {4889#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {4889#false} assume main_~node3__m3~4#1 != ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {4889#false} assume !(main_~node3__m3~4#1 > ~id3~0); {4889#false} is VALID [2022-02-20 18:52:08,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {4889#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {4889#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4889#false} is VALID [2022-02-20 18:52:08,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {4889#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {4889#false} is VALID [2022-02-20 18:52:08,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {4889#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {4889#false} is VALID [2022-02-20 18:52:08,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {4889#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3735~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3735~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; {4889#false} is VALID [2022-02-20 18:52:08,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {4889#false} assume 0 == main_~assert__arg~11#1 % 256; {4889#false} is VALID [2022-02-20 18:52:08,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {4889#false} assume !false; {4889#false} is VALID [2022-02-20 18:52:08,566 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:52:08,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:08,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197649267] [2022-02-20 18:52:08,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197649267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:08,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:08,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:08,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825229821] [2022-02-20 18:52:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:52:08,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:08,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:08,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:08,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:08,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:08,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:08,609 INFO L87 Difference]: Start difference. First operand 255 states and 320 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,271 INFO L93 Difference]: Finished difference Result 458 states and 587 transitions. [2022-02-20 18:52:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:09,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:52:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-02-20 18:52:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-02-20 18:52:09,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-02-20 18:52:09,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:09,640 INFO L225 Difference]: With dead ends: 458 [2022-02-20 18:52:09,641 INFO L226 Difference]: Without dead ends: 247 [2022-02-20 18:52:09,641 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:52:09,642 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 857 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:09,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [857 Valid, 195 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-02-20 18:52:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-02-20 18:52:09,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:09,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 247 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 246 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,916 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 247 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 246 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,917 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 247 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 246 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,921 INFO L93 Difference]: Finished difference Result 247 states and 310 transitions. [2022-02-20 18:52:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2022-02-20 18:52:09,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 246 states have internal predecessors, (310), 0 states have call successors, (0), 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 247 states. [2022-02-20 18:52:09,923 INFO L87 Difference]: Start difference. First operand has 247 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 246 states have internal predecessors, (310), 0 states have call successors, (0), 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 247 states. [2022-02-20 18:52:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,928 INFO L93 Difference]: Finished difference Result 247 states and 310 transitions. [2022-02-20 18:52:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2022-02-20 18:52:09,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:09,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:09,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:09,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 246 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2022-02-20 18:52:09,933 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 62 [2022-02-20 18:52:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:09,933 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2022-02-20 18:52:09,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2022-02-20 18:52:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:09,935 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:09,936 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] [2022-02-20 18:52:09,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:52:09,936 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:09,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:09,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1176799625, now seen corresponding path program 1 times [2022-02-20 18:52:09,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:09,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040060259] [2022-02-20 18:52:09,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:09,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:10,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {6257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {6259#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:10,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6259#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {6260#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {6261#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {6261#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {6261#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:10,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {6261#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {6262#(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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {6262#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {6262#(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; {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~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; {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:10,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {6263#(and (<= ~send3~0 127) (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6264#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p3_new~0 ~p1_new~0)))} is VALID [2022-02-20 18:52:10,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {6264#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p3_new~0 ~p1_new~0)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6264#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p3_new~0 ~p1_new~0)))} is VALID [2022-02-20 18:52:10,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {6264#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p3_new~0 ~p1_new~0)))} assume ~send4~0 != ~nomsg~0; {6264#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p3_new~0 ~p1_new~0)))} is VALID [2022-02-20 18:52:10,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {6264#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p3_new~0 ~p1_new~0)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume !(~r1~0 >= 4); {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:10,207 INFO L290 TraceCheckUtils]: 50: Hoare triple {6265#(or (not (= ~p3_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p1_old~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6266#(or (not (= ~p3_old~0 |ULTIMATE.start_main_~node2__m2~3#1|)) (not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|)))} is VALID [2022-02-20 18:52:10,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {6266#(or (not (= ~p3_old~0 |ULTIMATE.start_main_~node2__m2~3#1|)) (not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|)))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {6267#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:10,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {6267#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6267#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:10,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {6267#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6267#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:10,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {6267#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {6267#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:10,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {6267#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {6267#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:10,209 INFO L290 TraceCheckUtils]: 56: Hoare triple {6267#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {6267#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:10,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {6267#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6268#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} is VALID [2022-02-20 18:52:10,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {6268#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {6258#false} is VALID [2022-02-20 18:52:10,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {6258#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {6258#false} is VALID [2022-02-20 18:52:10,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {6258#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3735~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3735~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; {6258#false} is VALID [2022-02-20 18:52:10,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {6258#false} assume 0 == main_~assert__arg~11#1 % 256; {6258#false} is VALID [2022-02-20 18:52:10,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {6258#false} assume !false; {6258#false} is VALID [2022-02-20 18:52:10,214 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:52:10,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:10,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040060259] [2022-02-20 18:52:10,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040060259] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:10,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:10,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:52:10,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57647253] [2022-02-20 18:52:10,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:10,218 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:10,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:10,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:10,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:52:10,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:52:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:52:10,283 INFO L87 Difference]: Start difference. First operand 247 states and 310 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:13,634 INFO L93 Difference]: Finished difference Result 562 states and 736 transitions. [2022-02-20 18:52:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 18:52:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 736 transitions. [2022-02-20 18:52:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 736 transitions. [2022-02-20 18:52:13,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 736 transitions. [2022-02-20 18:52:14,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 736 edges. 736 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:14,207 INFO L225 Difference]: With dead ends: 562 [2022-02-20 18:52:14,207 INFO L226 Difference]: Without dead ends: 503 [2022-02-20 18:52:14,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2022-02-20 18:52:14,209 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 1035 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:14,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1035 Valid, 1445 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 18:52:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-02-20 18:52:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 254. [2022-02-20 18:52:14,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:14,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 254 states, 243 states have (on average 1.316872427983539) internal successors, (320), 253 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,549 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 254 states, 243 states have (on average 1.316872427983539) internal successors, (320), 253 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,550 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 254 states, 243 states have (on average 1.316872427983539) internal successors, (320), 253 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:14,560 INFO L93 Difference]: Finished difference Result 503 states and 651 transitions. [2022-02-20 18:52:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 651 transitions. [2022-02-20 18:52:14,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:14,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:14,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 243 states have (on average 1.316872427983539) internal successors, (320), 253 states have internal predecessors, (320), 0 states have call successors, (0), 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 503 states. [2022-02-20 18:52:14,562 INFO L87 Difference]: Start difference. First operand has 254 states, 243 states have (on average 1.316872427983539) internal successors, (320), 253 states have internal predecessors, (320), 0 states have call successors, (0), 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 503 states. [2022-02-20 18:52:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:14,573 INFO L93 Difference]: Finished difference Result 503 states and 651 transitions. [2022-02-20 18:52:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 651 transitions. [2022-02-20 18:52:14,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:14,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:14,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:14,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 243 states have (on average 1.316872427983539) internal successors, (320), 253 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 320 transitions. [2022-02-20 18:52:14,578 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 320 transitions. Word has length 63 [2022-02-20 18:52:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:14,579 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 320 transitions. [2022-02-20 18:52:14,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 320 transitions. [2022-02-20 18:52:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:14,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:14,580 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] [2022-02-20 18:52:14,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:14,580 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:14,581 INFO L85 PathProgramCache]: Analyzing trace with hash 735397477, now seen corresponding path program 1 times [2022-02-20 18:52:14,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:14,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248255532] [2022-02-20 18:52:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:14,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {8349#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {8351#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:14,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {8351#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:14,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:14,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:14,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:14,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:14,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:14,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {8352#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {8353#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:14,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {8353#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {8353#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:14,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {8353#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:14,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {8354#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8355#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} is VALID [2022-02-20 18:52:14,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {8355#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8355#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} is VALID [2022-02-20 18:52:14,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {8355#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} assume ~send2~0 != ~nomsg~0; {8355#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} is VALID [2022-02-20 18:52:14,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {8355#(and (or (not (= ~nomsg~0 ~p1_new~0)) (<= (+ ~p1_new~0 1) 0)) (<= 0 ~send2~0) (<= ~send2~0 127))} 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; {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:52:14,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:52:14,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~send3~0 != ~nomsg~0; {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:52:14,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:52:14,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:52:14,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~send4~0 != ~nomsg~0; {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:52:14,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {8356#(or (not (= ~nomsg~0 ~p1_new~0)) (not (= ~p1_new~0 ~p2_new~0)))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(~r1~0 >= 4); {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} is VALID [2022-02-20 18:52:14,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {8357#(or (not (= ~nomsg~0 ~p1_old~0)) (not (= ~p1_old~0 ~p2_old~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8358#(or (not (= |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0)) (not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|)))} is VALID [2022-02-20 18:52:14,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {8358#(or (not (= |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0)) (not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|)))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {8359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:14,784 INFO L290 TraceCheckUtils]: 52: Hoare triple {8359#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {8359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:14,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {8359#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8360#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:52:14,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {8360#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {8350#false} is VALID [2022-02-20 18:52:14,785 INFO L290 TraceCheckUtils]: 55: Hoare triple {8350#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {8350#false} is VALID [2022-02-20 18:52:14,785 INFO L290 TraceCheckUtils]: 56: Hoare triple {8350#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8350#false} is VALID [2022-02-20 18:52:14,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {8350#false} assume main_~node4__m4~6#1 != ~nomsg~0; {8350#false} is VALID [2022-02-20 18:52:14,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {8350#false} assume !(main_~node4__m4~6#1 > ~id4~0); {8350#false} is VALID [2022-02-20 18:52:14,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {8350#false} assume main_~node4__m4~6#1 == ~id4~0;~st4~0 := 1;~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~11#1; {8350#false} is VALID [2022-02-20 18:52:14,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {8350#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_3532~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_3532~0;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~10#1;main_~assert__arg~10#1 := main_~__tmp_11~0#1; {8350#false} is VALID [2022-02-20 18:52:14,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {8350#false} assume 0 == main_~assert__arg~10#1 % 256; {8350#false} is VALID [2022-02-20 18:52:14,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {8350#false} assume !false; {8350#false} is VALID [2022-02-20 18:52:14,786 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:52:14,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:14,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248255532] [2022-02-20 18:52:14,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248255532] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:14,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:14,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:52:14,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041645583] [2022-02-20 18:52:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:14,788 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:14,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:14,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:14,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:14,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:52:14,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:14,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:52:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:52:14,840 INFO L87 Difference]: Start difference. First operand 254 states and 320 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,176 INFO L93 Difference]: Finished difference Result 605 states and 792 transitions. [2022-02-20 18:52:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 18:52:18,176 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 786 transitions. [2022-02-20 18:52:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 786 transitions. [2022-02-20 18:52:18,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 786 transitions. [2022-02-20 18:52:18,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 786 edges. 786 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:18,919 INFO L225 Difference]: With dead ends: 605 [2022-02-20 18:52:18,919 INFO L226 Difference]: Without dead ends: 534 [2022-02-20 18:52:18,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:52:18,920 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1959 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1959 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:18,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1959 Valid, 1135 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:52:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-02-20 18:52:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 254. [2022-02-20 18:52:19,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:19,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 534 states. Second operand has 254 states, 243 states have (on average 1.3127572016460904) internal successors, (319), 253 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,307 INFO L74 IsIncluded]: Start isIncluded. First operand 534 states. Second operand has 254 states, 243 states have (on average 1.3127572016460904) internal successors, (319), 253 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,311 INFO L87 Difference]: Start difference. First operand 534 states. Second operand has 254 states, 243 states have (on average 1.3127572016460904) internal successors, (319), 253 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,321 INFO L93 Difference]: Finished difference Result 534 states and 693 transitions. [2022-02-20 18:52:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 693 transitions. [2022-02-20 18:52:19,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:19,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:19,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 243 states have (on average 1.3127572016460904) internal successors, (319), 253 states have internal predecessors, (319), 0 states have call successors, (0), 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 534 states. [2022-02-20 18:52:19,324 INFO L87 Difference]: Start difference. First operand has 254 states, 243 states have (on average 1.3127572016460904) internal successors, (319), 253 states have internal predecessors, (319), 0 states have call successors, (0), 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 534 states. [2022-02-20 18:52:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:19,336 INFO L93 Difference]: Finished difference Result 534 states and 693 transitions. [2022-02-20 18:52:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 693 transitions. [2022-02-20 18:52:19,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:19,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:19,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:19,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 243 states have (on average 1.3127572016460904) internal successors, (319), 253 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 319 transitions. [2022-02-20 18:52:19,347 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 319 transitions. Word has length 63 [2022-02-20 18:52:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:19,347 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 319 transitions. [2022-02-20 18:52:19,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 319 transitions. [2022-02-20 18:52:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:19,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:19,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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:19,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:19,348 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:19,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1585644853, now seen corresponding path program 1 times [2022-02-20 18:52:19,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:19,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957702966] [2022-02-20 18:52:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:19,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {10547#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {10549#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:19,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {10549#(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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {10550#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {10551#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {10551#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {10551#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {10551#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {10552#(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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {10552#(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; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {10552#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:19,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {10552#(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; {10553#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:19,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {10553#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10553#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:19,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {10553#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {10553#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:19,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {10553#(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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {10553#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:19,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {10553#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10553#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:19,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {10553#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {10553#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:19,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {10553#(not (= ~nomsg~0 ~p2_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {10554#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {10554#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:19,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {10554#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10555#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:52:19,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {10555#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {10548#false} is VALID [2022-02-20 18:52:19,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {10548#false} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {10548#false} is VALID [2022-02-20 18:52:19,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {10548#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10548#false} is VALID [2022-02-20 18:52:19,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {10548#false} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {10548#false} is VALID [2022-02-20 18:52:19,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {10548#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~14#1; {10548#false} is VALID [2022-02-20 18:52:19,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {10548#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~14#1 := 0;~__return_4132~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_4132~0;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~12#1;main_~assert__arg~12#1 := main_~__tmp_13~0#1; {10548#false} is VALID [2022-02-20 18:52:19,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {10548#false} assume 0 == main_~assert__arg~12#1 % 256; {10548#false} is VALID [2022-02-20 18:52:19,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {10548#false} assume !false; {10548#false} is VALID [2022-02-20 18:52:19,523 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:52:19,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:19,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957702966] [2022-02-20 18:52:19,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957702966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:19,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:19,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:19,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887551067] [2022-02-20 18:52:19,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:19,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:19,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:19,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:19,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:19,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:19,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:19,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:19,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:19,564 INFO L87 Difference]: Start difference. First operand 254 states and 319 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:22,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,756 INFO L93 Difference]: Finished difference Result 562 states and 744 transitions. [2022-02-20 18:52:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:22,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 735 transitions. [2022-02-20 18:52:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 735 transitions. [2022-02-20 18:52:22,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 735 transitions. [2022-02-20 18:52:23,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 735 edges. 735 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:23,308 INFO L225 Difference]: With dead ends: 562 [2022-02-20 18:52:23,308 INFO L226 Difference]: Without dead ends: 496 [2022-02-20 18:52:23,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:23,309 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 1948 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1948 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:23,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1948 Valid, 904 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-02-20 18:52:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 254. [2022-02-20 18:52:23,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:23,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 254 states, 243 states have (on average 1.308641975308642) internal successors, (318), 253 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,746 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 254 states, 243 states have (on average 1.308641975308642) internal successors, (318), 253 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,747 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 254 states, 243 states have (on average 1.308641975308642) internal successors, (318), 253 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,756 INFO L93 Difference]: Finished difference Result 496 states and 650 transitions. [2022-02-20 18:52:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 650 transitions. [2022-02-20 18:52:23,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:23,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:23,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 243 states have (on average 1.308641975308642) internal successors, (318), 253 states have internal predecessors, (318), 0 states have call successors, (0), 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 496 states. [2022-02-20 18:52:23,761 INFO L87 Difference]: Start difference. First operand has 254 states, 243 states have (on average 1.308641975308642) internal successors, (318), 253 states have internal predecessors, (318), 0 states have call successors, (0), 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 496 states. [2022-02-20 18:52:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,771 INFO L93 Difference]: Finished difference Result 496 states and 650 transitions. [2022-02-20 18:52:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 650 transitions. [2022-02-20 18:52:23,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:23,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:23,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:23,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 243 states have (on average 1.308641975308642) internal successors, (318), 253 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2022-02-20 18:52:23,778 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 63 [2022-02-20 18:52:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:23,778 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2022-02-20 18:52:23,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2022-02-20 18:52:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:23,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:23,779 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] [2022-02-20 18:52:23,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:23,779 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash 202563885, now seen corresponding path program 1 times [2022-02-20 18:52:23,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:23,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582917332] [2022-02-20 18:52:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:23,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:23,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {12611#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {12613#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {12613#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {12614#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {12615#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} is VALID [2022-02-20 18:52:23,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {12615#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} assume 0 == ~st4~0; {12615#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} is VALID [2022-02-20 18:52:23,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {12615#(and (<= ~id4~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~id4~0))} assume ~send4~0 == ~id4~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 != ~nomsg~0; {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:23,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {12616#(and (<= 0 ~send4~0) (<= ~send4~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12617#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:23,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {12617#(not (= ~nomsg~0 ~p4_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {12617#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:23,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {12617#(not (= ~nomsg~0 ~p4_old~0))} assume !(~r1~0 >= 4); {12617#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:23,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {12617#(not (= ~nomsg~0 ~p4_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {12617#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:23,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {12617#(not (= ~nomsg~0 ~p4_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {12617#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:23,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {12617#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {12617#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:23,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {12617#(not (= ~nomsg~0 ~p4_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {12617#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:23,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {12617#(not (= ~nomsg~0 ~p4_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12617#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:23,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {12617#(not (= ~nomsg~0 ~p4_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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12618#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:23,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {12618#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {12612#false} is VALID [2022-02-20 18:52:23,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {12612#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12612#false} is VALID [2022-02-20 18:52:23,903 INFO L290 TraceCheckUtils]: 49: Hoare triple {12612#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12612#false} is VALID [2022-02-20 18:52:23,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {12612#false} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {12612#false} is VALID [2022-02-20 18:52:23,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {12612#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12612#false} is VALID [2022-02-20 18:52:23,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {12612#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12612#false} is VALID [2022-02-20 18:52:23,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {12612#false} assume main_~node3__m3~1#1 != ~nomsg~0; {12612#false} is VALID [2022-02-20 18:52:23,904 INFO L290 TraceCheckUtils]: 54: Hoare triple {12612#false} assume !(main_~node3__m3~1#1 > ~id3~0); {12612#false} is VALID [2022-02-20 18:52:23,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {12612#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {12612#false} is VALID [2022-02-20 18:52:23,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {12612#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12612#false} is VALID [2022-02-20 18:52:23,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {12612#false} assume main_~node4__m4~3#1 != ~nomsg~0; {12612#false} is VALID [2022-02-20 18:52:23,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {12612#false} assume !(main_~node4__m4~3#1 > ~id4~0); {12612#false} is VALID [2022-02-20 18:52:23,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {12612#false} assume main_~node4__m4~3#1 == ~id4~0;~st4~0 := 1;~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {12612#false} is VALID [2022-02-20 18:52:23,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {12612#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_3824~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_3824~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; {12612#false} is VALID [2022-02-20 18:52:23,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {12612#false} assume 0 == main_~assert__arg~5#1 % 256; {12612#false} is VALID [2022-02-20 18:52:23,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {12612#false} assume !false; {12612#false} is VALID [2022-02-20 18:52:23,905 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:52:23,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:23,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582917332] [2022-02-20 18:52:23,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582917332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:23,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:23,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:23,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969536543] [2022-02-20 18:52:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:23,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:23,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:23,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:23,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:23,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:52:23,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:52:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:23,942 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:25,890 INFO L93 Difference]: Finished difference Result 493 states and 618 transitions. [2022-02-20 18:52:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:52:25,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:52:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2022-02-20 18:52:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2022-02-20 18:52:25,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 609 transitions. [2022-02-20 18:52:26,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:26,309 INFO L225 Difference]: With dead ends: 493 [2022-02-20 18:52:26,309 INFO L226 Difference]: Without dead ends: 360 [2022-02-20 18:52:26,310 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:52:26,310 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 1846 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:26,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1846 Valid, 456 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-02-20 18:52:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 254. [2022-02-20 18:52:26,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:26,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 254 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 253 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,829 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 254 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 253 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,829 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 254 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 253 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,835 INFO L93 Difference]: Finished difference Result 360 states and 443 transitions. [2022-02-20 18:52:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 443 transitions. [2022-02-20 18:52:26,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 253 states have internal predecessors, (317), 0 states have call successors, (0), 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:52:26,837 INFO L87 Difference]: Start difference. First operand has 254 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 253 states have internal predecessors, (317), 0 states have call successors, (0), 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:52:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,853 INFO L93 Difference]: Finished difference Result 360 states and 443 transitions. [2022-02-20 18:52:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 443 transitions. [2022-02-20 18:52:26,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:26,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:26,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:26,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 253 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 317 transitions. [2022-02-20 18:52:26,858 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 317 transitions. Word has length 63 [2022-02-20 18:52:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:26,858 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 317 transitions. [2022-02-20 18:52:26,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 317 transitions. [2022-02-20 18:52:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:26,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:26,865 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] [2022-02-20 18:52:26,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:26,866 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1108427284, now seen corresponding path program 1 times [2022-02-20 18:52:26,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:26,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922072041] [2022-02-20 18:52:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:26,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {14283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {14285#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:26,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {14285#(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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {14286#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {14286#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {14286#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {14286#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {14287#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {14287#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {14287#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {14287#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:26,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:27,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:27,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:27,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:27,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:27,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:27,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:27,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {14288#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 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; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {14289#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {14289#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {14289#(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; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {14289#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {14289#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {14289#(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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {14289#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {14289#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {14289#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {14289#(not (= ~nomsg~0 ~p1_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 4); {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,007 INFO L290 TraceCheckUtils]: 46: Hoare triple {14290#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {14290#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {14290#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14291#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:52:27,009 INFO L290 TraceCheckUtils]: 51: Hoare triple {14291#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {14284#false} is VALID [2022-02-20 18:52:27,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {14284#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {14284#false} is VALID [2022-02-20 18:52:27,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {14284#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14284#false} is VALID [2022-02-20 18:52:27,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {14284#false} assume main_~node3__m3~4#1 != ~nomsg~0; {14284#false} is VALID [2022-02-20 18:52:27,009 INFO L290 TraceCheckUtils]: 55: Hoare triple {14284#false} assume main_~node3__m3~4#1 > ~id3~0;~send3~0 := main_~node3__m3~4#1; {14284#false} is VALID [2022-02-20 18:52:27,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {14284#false} ~mode3~0 := 0; {14284#false} is VALID [2022-02-20 18:52:27,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {14284#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {14284#false} is VALID [2022-02-20 18:52:27,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {14284#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14284#false} is VALID [2022-02-20 18:52:27,010 INFO L290 TraceCheckUtils]: 59: Hoare triple {14284#false} assume main_~node4__m4~6#1 != ~nomsg~0; {14284#false} is VALID [2022-02-20 18:52:27,010 INFO L290 TraceCheckUtils]: 60: Hoare triple {14284#false} assume !(main_~node4__m4~6#1 > ~id4~0); {14284#false} is VALID [2022-02-20 18:52:27,010 INFO L290 TraceCheckUtils]: 61: Hoare triple {14284#false} assume main_~node4__m4~6#1 == ~id4~0;~st4~0 := 1;~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~11#1; {14284#false} is VALID [2022-02-20 18:52:27,010 INFO L290 TraceCheckUtils]: 62: Hoare triple {14284#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_3532~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_3532~0;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~10#1;main_~assert__arg~10#1 := main_~__tmp_11~0#1; {14284#false} is VALID [2022-02-20 18:52:27,010 INFO L290 TraceCheckUtils]: 63: Hoare triple {14284#false} assume 0 == main_~assert__arg~10#1 % 256; {14284#false} is VALID [2022-02-20 18:52:27,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {14284#false} assume !false; {14284#false} is VALID [2022-02-20 18:52:27,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:52:27,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:27,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922072041] [2022-02-20 18:52:27,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922072041] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:27,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:27,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:27,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515818179] [2022-02-20 18:52:27,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:27,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:27,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:27,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:27,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:27,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:27,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:27,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:27,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:27,072 INFO L87 Difference]: Start difference. First operand 254 states and 317 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,532 INFO L93 Difference]: Finished difference Result 581 states and 764 transitions. [2022-02-20 18:52:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:30,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 764 transitions. [2022-02-20 18:52:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 764 transitions. [2022-02-20 18:52:30,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 764 transitions. [2022-02-20 18:52:31,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 764 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:31,072 INFO L225 Difference]: With dead ends: 581 [2022-02-20 18:52:31,072 INFO L226 Difference]: Without dead ends: 493 [2022-02-20 18:52:31,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:31,073 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 1395 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:31,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1395 Valid, 1385 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-02-20 18:52:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 247. [2022-02-20 18:52:31,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:31,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 493 states. Second operand has 247 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 246 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,609 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand has 247 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 246 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,609 INFO L87 Difference]: Start difference. First operand 493 states. Second operand has 247 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 246 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,627 INFO L93 Difference]: Finished difference Result 493 states and 644 transitions. [2022-02-20 18:52:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 644 transitions. [2022-02-20 18:52:31,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 246 states have internal predecessors, (307), 0 states have call successors, (0), 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 493 states. [2022-02-20 18:52:31,628 INFO L87 Difference]: Start difference. First operand has 247 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 246 states have internal predecessors, (307), 0 states have call successors, (0), 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 493 states. [2022-02-20 18:52:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,645 INFO L93 Difference]: Finished difference Result 493 states and 644 transitions. [2022-02-20 18:52:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 644 transitions. [2022-02-20 18:52:31,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:31,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 246 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2022-02-20 18:52:31,666 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 65 [2022-02-20 18:52:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:31,666 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2022-02-20 18:52:31,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2022-02-20 18:52:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:31,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:31,667 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] [2022-02-20 18:52:31,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:31,674 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:31,674 INFO L85 PathProgramCache]: Analyzing trace with hash -620136770, now seen corresponding path program 1 times [2022-02-20 18:52:31,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:31,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950420507] [2022-02-20 18:52:31,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:31,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {16353#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {16355#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:31,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {16355#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {16356#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {16357#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {16357#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {16357#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:31,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {16357#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {16358#(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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {16358#(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; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {16358#(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; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {16358#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:31,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {16358#(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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {16359#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {16359#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {16359#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {16359#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {16359#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {16359#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {16360#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} ~mode2~0 := 0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,830 INFO L290 TraceCheckUtils]: 54: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,831 INFO L290 TraceCheckUtils]: 55: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,831 INFO L290 TraceCheckUtils]: 56: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,831 INFO L290 TraceCheckUtils]: 57: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~7#1;main_~node4__m4~7#1 := ~nomsg~0; {16360#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:31,832 INFO L290 TraceCheckUtils]: 59: Hoare triple {16360#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16361#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} is VALID [2022-02-20 18:52:31,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {16361#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {16354#false} is VALID [2022-02-20 18:52:31,832 INFO L290 TraceCheckUtils]: 61: Hoare triple {16354#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {16354#false} is VALID [2022-02-20 18:52:31,833 INFO L290 TraceCheckUtils]: 62: Hoare triple {16354#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3735~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3735~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; {16354#false} is VALID [2022-02-20 18:52:31,833 INFO L290 TraceCheckUtils]: 63: Hoare triple {16354#false} assume 0 == main_~assert__arg~11#1 % 256; {16354#false} is VALID [2022-02-20 18:52:31,833 INFO L290 TraceCheckUtils]: 64: Hoare triple {16354#false} assume !false; {16354#false} is VALID [2022-02-20 18:52:31,833 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:52:31,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:31,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950420507] [2022-02-20 18:52:31,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950420507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:31,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:31,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:31,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513076938] [2022-02-20 18:52:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:31,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:31,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:31,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:31,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:31,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:31,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:31,875 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:35,054 INFO L93 Difference]: Finished difference Result 540 states and 707 transitions. [2022-02-20 18:52:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 707 transitions. [2022-02-20 18:52:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 707 transitions. [2022-02-20 18:52:35,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 707 transitions. [2022-02-20 18:52:35,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:35,622 INFO L225 Difference]: With dead ends: 540 [2022-02-20 18:52:35,622 INFO L226 Difference]: Without dead ends: 481 [2022-02-20 18:52:35,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:35,624 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 1769 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:35,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1769 Valid, 953 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-20 18:52:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 247. [2022-02-20 18:52:36,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:36,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,154 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,154 INFO L87 Difference]: Start difference. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,162 INFO L93 Difference]: Finished difference Result 481 states and 622 transitions. [2022-02-20 18:52:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 622 transitions. [2022-02-20 18:52:36,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:52:36,163 INFO L87 Difference]: Start difference. First operand has 247 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:52:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:36,171 INFO L93 Difference]: Finished difference Result 481 states and 622 transitions. [2022-02-20 18:52:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 622 transitions. [2022-02-20 18:52:36,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:36,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:36,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:36,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 306 transitions. [2022-02-20 18:52:36,175 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 306 transitions. Word has length 65 [2022-02-20 18:52:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:36,175 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 306 transitions. [2022-02-20 18:52:36,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 306 transitions. [2022-02-20 18:52:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:36,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:36,176 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] [2022-02-20 18:52:36,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:36,177 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1292060332, now seen corresponding path program 1 times [2022-02-20 18:52:36,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:36,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124105588] [2022-02-20 18:52:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:36,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {18352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {18354#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:36,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {18354#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {18355#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {18356#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {18356#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st2~0; {18356#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:36,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {18356#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {18357#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {18358#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {18358#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18358#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {18358#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {18358#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {18358#(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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {18358#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {18358#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18358#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {18358#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {18358#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:36,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {18358#(not (= ~nomsg~0 ~p2_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {18359#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,288 INFO L290 TraceCheckUtils]: 47: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,288 INFO L290 TraceCheckUtils]: 49: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,289 INFO L290 TraceCheckUtils]: 50: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,289 INFO L290 TraceCheckUtils]: 51: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,290 INFO L290 TraceCheckUtils]: 53: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,290 INFO L290 TraceCheckUtils]: 54: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {18359#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:36,290 INFO L290 TraceCheckUtils]: 55: Hoare triple {18359#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18360#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:52:36,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {18360#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {18353#false} is VALID [2022-02-20 18:52:36,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {18353#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {18353#false} is VALID [2022-02-20 18:52:36,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {18353#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18353#false} is VALID [2022-02-20 18:52:36,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {18353#false} assume main_~node4__m4~6#1 != ~nomsg~0; {18353#false} is VALID [2022-02-20 18:52:36,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {18353#false} assume !(main_~node4__m4~6#1 > ~id4~0); {18353#false} is VALID [2022-02-20 18:52:36,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {18353#false} assume main_~node4__m4~6#1 == ~id4~0;~st4~0 := 1;~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~11#1; {18353#false} is VALID [2022-02-20 18:52:36,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {18353#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_3532~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_3532~0;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~10#1;main_~assert__arg~10#1 := main_~__tmp_11~0#1; {18353#false} is VALID [2022-02-20 18:52:36,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {18353#false} assume 0 == main_~assert__arg~10#1 % 256; {18353#false} is VALID [2022-02-20 18:52:36,293 INFO L290 TraceCheckUtils]: 64: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-02-20 18:52:36,293 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:52:36,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:36,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124105588] [2022-02-20 18:52:36,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124105588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:36,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:36,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:36,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802785138] [2022-02-20 18:52:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:36,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:36,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:36,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:36,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:36,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:36,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:36,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:36,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:36,338 INFO L87 Difference]: Start difference. First operand 247 states and 306 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:39,520 INFO L93 Difference]: Finished difference Result 560 states and 735 transitions. [2022-02-20 18:52:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 735 transitions. [2022-02-20 18:52:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 735 transitions. [2022-02-20 18:52:39,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 735 transitions. [2022-02-20 18:52:40,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 735 edges. 735 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:40,029 INFO L225 Difference]: With dead ends: 560 [2022-02-20 18:52:40,029 INFO L226 Difference]: Without dead ends: 489 [2022-02-20 18:52:40,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:40,030 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 1351 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:40,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1351 Valid, 1116 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-02-20 18:52:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 247. [2022-02-20 18:52:40,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:40,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 489 states. Second operand has 247 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 246 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,558 INFO L74 IsIncluded]: Start isIncluded. First operand 489 states. Second operand has 247 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 246 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,558 INFO L87 Difference]: Start difference. First operand 489 states. Second operand has 247 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 246 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:40,566 INFO L93 Difference]: Finished difference Result 489 states and 635 transitions. [2022-02-20 18:52:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 635 transitions. [2022-02-20 18:52:40,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:40,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:40,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 246 states have internal predecessors, (305), 0 states have call successors, (0), 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 489 states. [2022-02-20 18:52:40,567 INFO L87 Difference]: Start difference. First operand has 247 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 246 states have internal predecessors, (305), 0 states have call successors, (0), 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 489 states. [2022-02-20 18:52:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:40,575 INFO L93 Difference]: Finished difference Result 489 states and 635 transitions. [2022-02-20 18:52:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 635 transitions. [2022-02-20 18:52:40,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:40,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:40,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:40,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 246 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 305 transitions. [2022-02-20 18:52:40,578 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 305 transitions. Word has length 65 [2022-02-20 18:52:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:40,578 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 305 transitions. [2022-02-20 18:52:40,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 305 transitions. [2022-02-20 18:52:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:40,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:40,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:40,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:40,580 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:40,580 INFO L85 PathProgramCache]: Analyzing trace with hash -109241464, now seen corresponding path program 1 times [2022-02-20 18:52:40,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:40,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172723153] [2022-02-20 18:52:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:40,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:40,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {20389#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {20391#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {20391#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {20392#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {20393#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {20393#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {20393#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {20393#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {20394#(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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {20394#(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; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {20394#(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; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {20394#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {20394#(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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {20395#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {20395#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {20395#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {20395#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {20395#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {20395#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,706 INFO L290 TraceCheckUtils]: 42: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {20396#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,710 INFO L290 TraceCheckUtils]: 55: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 != ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~5#1 > ~id3~0); {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~9#1;main_~node4__m4~9#1 := ~nomsg~0; {20396#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {20396#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20397#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~9#1|))} is VALID [2022-02-20 18:52:40,711 INFO L290 TraceCheckUtils]: 59: Hoare triple {20397#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~9#1|))} assume !(main_~node4__m4~9#1 != ~nomsg~0);~mode4~0 := 0; {20390#false} is VALID [2022-02-20 18:52:40,712 INFO L290 TraceCheckUtils]: 60: Hoare triple {20390#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~16#1; {20390#false} is VALID [2022-02-20 18:52:40,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {20390#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~16#1 := 0;~__return_4484~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_4484~0;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {20390#false} is VALID [2022-02-20 18:52:40,712 INFO L290 TraceCheckUtils]: 62: Hoare triple {20390#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_3187_0~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; {20390#false} is VALID [2022-02-20 18:52:40,712 INFO L290 TraceCheckUtils]: 63: Hoare triple {20390#false} assume 0 == main_~assert__arg~2#1 % 256; {20390#false} is VALID [2022-02-20 18:52:40,712 INFO L290 TraceCheckUtils]: 64: Hoare triple {20390#false} assume !false; {20390#false} is VALID [2022-02-20 18:52:40,712 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:52:40,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:40,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172723153] [2022-02-20 18:52:40,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172723153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:40,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:40,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:40,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83221264] [2022-02-20 18:52:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:40,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:40,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:40,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:40,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:40,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:40,753 INFO L87 Difference]: Start difference. First operand 247 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:43,868 INFO L93 Difference]: Finished difference Result 537 states and 702 transitions. [2022-02-20 18:52:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:43,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 702 transitions. [2022-02-20 18:52:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 702 transitions. [2022-02-20 18:52:43,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 702 transitions. [2022-02-20 18:52:44,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 702 edges. 702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:44,326 INFO L225 Difference]: With dead ends: 537 [2022-02-20 18:52:44,326 INFO L226 Difference]: Without dead ends: 481 [2022-02-20 18:52:44,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:44,327 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1750 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:44,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1750 Valid, 973 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-20 18:52:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 247. [2022-02-20 18:52:44,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:44,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,878 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,878 INFO L87 Difference]: Start difference. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,885 INFO L93 Difference]: Finished difference Result 481 states and 620 transitions. [2022-02-20 18:52:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 620 transitions. [2022-02-20 18:52:44,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:44,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:44,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:52:44,887 INFO L87 Difference]: Start difference. First operand has 247 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:52:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,894 INFO L93 Difference]: Finished difference Result 481 states and 620 transitions. [2022-02-20 18:52:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 620 transitions. [2022-02-20 18:52:44,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:44,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:44,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:44,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2022-02-20 18:52:44,898 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 65 [2022-02-20 18:52:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:44,898 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2022-02-20 18:52:44,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2022-02-20 18:52:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:44,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:44,899 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] [2022-02-20 18:52:44,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:52:44,900 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1375273345, now seen corresponding path program 1 times [2022-02-20 18:52:44,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:44,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746047861] [2022-02-20 18:52:44,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:44,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {22385#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {22387#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:44,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {22387#(<= (+ ~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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {22388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {22389#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {22389#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {22389#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:44,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {22389#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:44,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:44,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:44,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:44,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:44,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:45,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {22390#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {22391#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {22391#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {22391#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {22391#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {22391#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {22391#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {22392#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 != ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 > ~id3~0;~send3~0 := main_~node3__m3~5#1; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} ~mode3~0 := 0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {22392#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:45,013 INFO L290 TraceCheckUtils]: 59: Hoare triple {22392#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22393#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~8#1|))} is VALID [2022-02-20 18:52:45,013 INFO L290 TraceCheckUtils]: 60: Hoare triple {22393#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~8#1|))} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {22386#false} is VALID [2022-02-20 18:52:45,013 INFO L290 TraceCheckUtils]: 61: Hoare triple {22386#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~14#1; {22386#false} is VALID [2022-02-20 18:52:45,013 INFO L290 TraceCheckUtils]: 62: Hoare triple {22386#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~14#1 := 0;~__return_4132~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_4132~0;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~12#1;main_~assert__arg~12#1 := main_~__tmp_13~0#1; {22386#false} is VALID [2022-02-20 18:52:45,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {22386#false} assume 0 == main_~assert__arg~12#1 % 256; {22386#false} is VALID [2022-02-20 18:52:45,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {22386#false} assume !false; {22386#false} is VALID [2022-02-20 18:52:45,014 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:52:45,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:45,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746047861] [2022-02-20 18:52:45,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746047861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:45,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:45,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:45,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740651471] [2022-02-20 18:52:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:45,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:45,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:45,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:45,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:45,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:45,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:45,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:45,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:45,055 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,365 INFO L93 Difference]: Finished difference Result 486 states and 624 transitions. [2022-02-20 18:52:48,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:48,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 624 transitions. [2022-02-20 18:52:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 624 transitions. [2022-02-20 18:52:48,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 624 transitions. [2022-02-20 18:52:48,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:48,795 INFO L225 Difference]: With dead ends: 486 [2022-02-20 18:52:48,795 INFO L226 Difference]: Without dead ends: 481 [2022-02-20 18:52:48,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:48,796 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 1635 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:48,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1635 Valid, 1118 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-20 18:52:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 247. [2022-02-20 18:52:49,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:49,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2838983050847457) internal successors, (303), 246 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,335 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2838983050847457) internal successors, (303), 246 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,335 INFO L87 Difference]: Start difference. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2838983050847457) internal successors, (303), 246 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:49,343 INFO L93 Difference]: Finished difference Result 481 states and 618 transitions. [2022-02-20 18:52:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 618 transitions. [2022-02-20 18:52:49,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:49,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:49,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 236 states have (on average 1.2838983050847457) internal successors, (303), 246 states have internal predecessors, (303), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:52:49,344 INFO L87 Difference]: Start difference. First operand has 247 states, 236 states have (on average 1.2838983050847457) internal successors, (303), 246 states have internal predecessors, (303), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:52:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:49,352 INFO L93 Difference]: Finished difference Result 481 states and 618 transitions. [2022-02-20 18:52:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 618 transitions. [2022-02-20 18:52:49,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:49,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:49,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:49,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2838983050847457) internal successors, (303), 246 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 303 transitions. [2022-02-20 18:52:49,356 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 303 transitions. Word has length 65 [2022-02-20 18:52:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:49,356 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 303 transitions. [2022-02-20 18:52:49,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 303 transitions. [2022-02-20 18:52:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:49,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:49,357 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] [2022-02-20 18:52:49,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:52:49,358 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:49,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash -636059456, now seen corresponding path program 1 times [2022-02-20 18:52:49,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:49,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743969338] [2022-02-20 18:52:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:49,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {24308#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {24310#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:49,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {24310#(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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {24311#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {24311#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {24311#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {24311#(and (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {24312#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {24312#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {24312#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {24312#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:49,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {24313#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 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; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {24314#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {24314#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {24314#(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; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {24314#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {24314#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {24314#(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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {24314#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {24314#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {24314#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:49,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {24314#(not (= ~nomsg~0 ~p1_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 4); {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {24315#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {24315#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:49,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {24315#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {24316#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:52:49,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {24316#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {24309#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {24309#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {24309#false} assume main_~node3__m3~1#1 != ~nomsg~0; {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {24309#false} assume !(main_~node3__m3~1#1 > ~id3~0); {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {24309#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~3#1;main_~node4__m4~3#1 := ~nomsg~0; {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {24309#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {24309#false} assume main_~node4__m4~3#1 != ~nomsg~0; {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {24309#false} assume !(main_~node4__m4~3#1 > ~id4~0); {24309#false} is VALID [2022-02-20 18:52:49,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {24309#false} assume main_~node4__m4~3#1 == ~id4~0;~st4~0 := 1;~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {24309#false} is VALID [2022-02-20 18:52:49,476 INFO L290 TraceCheckUtils]: 62: Hoare triple {24309#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_3824~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_3824~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; {24309#false} is VALID [2022-02-20 18:52:49,476 INFO L290 TraceCheckUtils]: 63: Hoare triple {24309#false} assume 0 == main_~assert__arg~5#1 % 256; {24309#false} is VALID [2022-02-20 18:52:49,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {24309#false} assume !false; {24309#false} is VALID [2022-02-20 18:52:49,476 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:52:49,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:49,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743969338] [2022-02-20 18:52:49,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743969338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:49,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:49,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:49,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953591177] [2022-02-20 18:52:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:49,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:49,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:49,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:49,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:49,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:49,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:49,518 INFO L87 Difference]: Start difference. First operand 247 states and 303 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,940 INFO L93 Difference]: Finished difference Result 587 states and 766 transitions. [2022-02-20 18:52:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 766 transitions. [2022-02-20 18:52:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 766 transitions. [2022-02-20 18:52:52,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 766 transitions. [2022-02-20 18:52:53,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 766 edges. 766 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:53,461 INFO L225 Difference]: With dead ends: 587 [2022-02-20 18:52:53,461 INFO L226 Difference]: Without dead ends: 493 [2022-02-20 18:52:53,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:53,462 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 1239 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:53,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1239 Valid, 1386 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-02-20 18:52:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 247. [2022-02-20 18:52:54,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:54,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 493 states. Second operand has 247 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 246 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,008 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand has 247 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 246 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,008 INFO L87 Difference]: Start difference. First operand 493 states. Second operand has 247 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 246 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:54,016 INFO L93 Difference]: Finished difference Result 493 states and 638 transitions. [2022-02-20 18:52:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 638 transitions. [2022-02-20 18:52:54,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:54,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:54,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 246 states have internal predecessors, (302), 0 states have call successors, (0), 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 493 states. [2022-02-20 18:52:54,017 INFO L87 Difference]: Start difference. First operand has 247 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 246 states have internal predecessors, (302), 0 states have call successors, (0), 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 493 states. [2022-02-20 18:52:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:54,025 INFO L93 Difference]: Finished difference Result 493 states and 638 transitions. [2022-02-20 18:52:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 638 transitions. [2022-02-20 18:52:54,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:54,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:54,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:54,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 246 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 302 transitions. [2022-02-20 18:52:54,029 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 302 transitions. Word has length 65 [2022-02-20 18:52:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:54,029 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 302 transitions. [2022-02-20 18:52:54,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 302 transitions. [2022-02-20 18:52:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:54,030 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:54,030 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] [2022-02-20 18:52:54,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:52:54,030 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:54,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:54,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2058271748, now seen corresponding path program 1 times [2022-02-20 18:52:54,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:54,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961978314] [2022-02-20 18:52:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:54,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {26384#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {26386#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:54,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {26386#(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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:54,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {26387#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {26388#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:54,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {26388#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {26388#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:54,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {26388#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode3~0 % 256; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id4~0 >= 0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~st4~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send4~0 == ~id4~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode4~0 % 256; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id2~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id3~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id4~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id3~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id4~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send1~0 != ~nomsg~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~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; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send2~0 != ~nomsg~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~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; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send3~0 != ~nomsg~0; {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:52:54,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {26389#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {26390#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {26390#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {26390#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {26390#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {26390#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {26390#(not (= ~p3_new~0 ~nomsg~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 4); {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {26391#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} ~mode1~0 := 0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~3#1 != ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~3#1 > ~id3~0); {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;havoc main_~node4__m4~5#1;main_~node4__m4~5#1 := ~nomsg~0; {26391#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:54,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {26391#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26392#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~5#1|))} is VALID [2022-02-20 18:52:54,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {26392#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~5#1|))} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0; {26385#false} is VALID [2022-02-20 18:52:54,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {26385#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {26385#false} is VALID [2022-02-20 18:52:54,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {26385#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~8#1 := 0;~__return_4399~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_4399~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; {26385#false} is VALID [2022-02-20 18:52:54,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {26385#false} assume 0 == main_~assert__arg~8#1 % 256; {26385#false} is VALID [2022-02-20 18:52:54,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {26385#false} assume !false; {26385#false} is VALID [2022-02-20 18:52:54,158 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:52:54,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:54,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961978314] [2022-02-20 18:52:54,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961978314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:54,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:54,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:54,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930515229] [2022-02-20 18:52:54,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:54,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:54,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:54,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:54,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:54,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:54,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:54,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:54,206 INFO L87 Difference]: Start difference. First operand 247 states and 302 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:57,710 INFO L93 Difference]: Finished difference Result 486 states and 621 transitions. [2022-02-20 18:52:57,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:57,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 621 transitions. [2022-02-20 18:52:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 621 transitions. [2022-02-20 18:52:57,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 621 transitions. [2022-02-20 18:52:58,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:58,159 INFO L225 Difference]: With dead ends: 486 [2022-02-20 18:52:58,159 INFO L226 Difference]: Without dead ends: 481 [2022-02-20 18:52:58,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:58,160 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1504 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:58,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1504 Valid, 1124 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-20 18:52:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 247. [2022-02-20 18:52:58,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:58,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2754237288135593) internal successors, (301), 246 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,743 INFO L74 IsIncluded]: Start isIncluded. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2754237288135593) internal successors, (301), 246 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,744 INFO L87 Difference]: Start difference. First operand 481 states. Second operand has 247 states, 236 states have (on average 1.2754237288135593) internal successors, (301), 246 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,751 INFO L93 Difference]: Finished difference Result 481 states and 616 transitions. [2022-02-20 18:52:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 616 transitions. [2022-02-20 18:52:58,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:58,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:58,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 236 states have (on average 1.2754237288135593) internal successors, (301), 246 states have internal predecessors, (301), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:52:58,752 INFO L87 Difference]: Start difference. First operand has 247 states, 236 states have (on average 1.2754237288135593) internal successors, (301), 246 states have internal predecessors, (301), 0 states have call successors, (0), 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 481 states. [2022-02-20 18:52:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:58,759 INFO L93 Difference]: Finished difference Result 481 states and 616 transitions. [2022-02-20 18:52:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 616 transitions. [2022-02-20 18:52:58,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:58,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:58,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:58,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2754237288135593) internal successors, (301), 246 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 301 transitions. [2022-02-20 18:52:58,771 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 301 transitions. Word has length 65 [2022-02-20 18:52:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:58,772 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 301 transitions. [2022-02-20 18:52:58,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 301 transitions. [2022-02-20 18:52:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:58,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:58,773 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] [2022-02-20 18:52:58,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 18:52:58,773 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:52:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash -324498446, now seen corresponding path program 1 times [2022-02-20 18:52:58,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:58,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45484588] [2022-02-20 18:52:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:58,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {28309#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2928~0 := 0;~__return_4594~0 := 0;~__tmp_3029_0~0 := 0;~__return_3100~0 := 0;~__tmp_3109_0~0 := 0;~__tmp_3178_0~0 := 0;~__return_3186~0 := 0;~__tmp_3187_0~0 := 0;~__tmp_3193_0~0 := 0;~__return_3113~0 := 0;~__return_3459~0 := 0;~__return_3650~0 := 0;~__return_3824~0 := 0;~__return_4035~0 := 0;~__return_4219~0 := 0;~__return_4399~0 := 0;~__return_4565~0 := 0;~__return_3369~0 := 0;~__return_3532~0 := 0;~__return_3735~0 := 0;~__return_3899~0 := 0;~__return_4132~0 := 0;~__return_4292~0 := 0;~__return_4484~0 := 0;~__return_4527~0 := 0;~__return_4434~0 := 0;~__return_4349~0 := 0;~__return_4254~0 := 0;~__return_4181~0 := 0;~__return_4070~0 := 0;~__return_3970~0 := 0;~__return_3861~0 := 0;~__return_3786~0 := 0;~__return_3685~0 := 0;~__return_3597~0 := 0;~__return_3494~0 := 0;~__return_3418~0 := 0;~__return_3292~0 := 0;~__return_3019~0 := 0; {28311#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:58,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {28311#(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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {28312#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {28313#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {28313#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {28313#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {28313#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2928~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2928~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {28314#(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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {28314#(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; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {28314#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:58,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {28314#(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; {28315#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:58,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {28315#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {28315#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:58,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {28315#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {28315#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:58,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {28315#(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;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {28315#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:58,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {28315#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {28315#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:58,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {28315#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {28315#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:58,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {28315#(not (= ~nomsg~0 ~p2_new~0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0;~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 >= 4); {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_4594~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4594~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; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1;~__tmp_3029_0~0 := main_~main____CPAchecker_TMP_0~0#1; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3029_0~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {28316#(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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {28316#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:58,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {28316#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28317#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:52:58,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {28317#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} assume !(main_~node3__m3~3#1 != ~nomsg~0);~mode3~0 := 0; {28310#false} is VALID [2022-02-20 18:52:58,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {28310#false} havoc main_~node4__m4~4#1;main_~node4__m4~4#1 := ~nomsg~0; {28310#false} is VALID [2022-02-20 18:52:58,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {28310#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~4#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28310#false} is VALID [2022-02-20 18:52:58,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {28310#false} assume main_~node4__m4~4#1 != ~nomsg~0; {28310#false} is VALID [2022-02-20 18:52:58,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {28310#false} assume !(main_~node4__m4~4#1 > ~id4~0); {28310#false} is VALID [2022-02-20 18:52:58,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {28310#false} assume main_~node4__m4~4#1 == ~id4~0;~st4~0 := 1;~mode4~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {28310#false} is VALID [2022-02-20 18:52:58,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {28310#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_4219~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_4219~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {28310#false} is VALID [2022-02-20 18:52:58,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {28310#false} assume 0 == main_~assert__arg~7#1 % 256; {28310#false} is VALID [2022-02-20 18:52:58,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {28310#false} assume !false; {28310#false} is VALID [2022-02-20 18:52:58,896 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:52:58,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:58,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45484588] [2022-02-20 18:52:58,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45484588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:58,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:58,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:58,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228303128] [2022-02-20 18:52:58,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:58,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:58,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:58,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:58,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:58,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:58,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:58,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:58,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:58,948 INFO L87 Difference]: Start difference. First operand 247 states and 301 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)