./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.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.UNBOUNDED.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 6fcbb6774587cda7a5d573623a9a47b3e351563c8bea7eebdf86bc25d20b8061 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:52:15,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:52:15,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:52:16,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:52:16,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:52:16,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:52:16,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:52:16,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:52:16,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:52:16,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:52:16,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:52:16,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:52:16,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:52:16,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:52:16,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:52:16,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:52:16,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:52:16,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:52:16,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:52:16,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:52:16,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:52:16,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:52:16,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:52:16,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:52:16,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:52:16,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:52:16,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:52:16,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:52:16,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:52:16,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:52:16,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:52:16,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:52:16,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:52:16,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:52:16,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:52:16,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:52:16,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:52:16,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:52:16,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:52:16,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:52:16,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:52:16,066 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:16,095 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:52:16,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:52:16,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:52:16,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:52:16,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:52:16,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:52:16,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:52:16,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:52:16,098 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:52:16,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:52:16,103 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:52:16,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:52:16,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:52:16,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:52:16,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:52:16,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:52:16,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:52:16,104 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:52:16,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:52:16,105 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:52:16,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:52:16,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:52:16,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:52:16,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:52:16,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:16,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:52:16,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:52:16,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:52:16,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:52:16,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:52:16,108 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:52:16,108 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:52:16,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:52:16,109 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 -> 6fcbb6774587cda7a5d573623a9a47b3e351563c8bea7eebdf86bc25d20b8061 [2022-02-20 18:52:16,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:52:16,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:52:16,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:52:16,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:52:16,389 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:52:16,390 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:52:16,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6503779/8963ce40056a43d4a52d627915f88c21/FLAG97392885b [2022-02-20 18:52:16,882 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:52:16,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:52:16,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6503779/8963ce40056a43d4a52d627915f88c21/FLAG97392885b [2022-02-20 18:52:17,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b6503779/8963ce40056a43d4a52d627915f88c21 [2022-02-20 18:52:17,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:52:17,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:52:17,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:17,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:52:17,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:52:17,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:17" (1/1) ... [2022-02-20 18:52:17,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3081e58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:17, skipping insertion in model container [2022-02-20 18:52:17,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:52:17" (1/1) ... [2022-02-20 18:52:17,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:52:17,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:52:17,514 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.UNBOUNDED.pals.c.v+lhb-reducer.c[8891,8904] [2022-02-20 18:52:17,531 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.UNBOUNDED.pals.c.v+lhb-reducer.c[12143,12156] [2022-02-20 18:52:17,538 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13299,13312] [2022-02-20 18:52:17,543 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13955,13968] [2022-02-20 18:52:17,551 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.UNBOUNDED.pals.c.v+lhb-reducer.c[15434,15447] [2022-02-20 18:52:17,555 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.UNBOUNDED.pals.c.v+lhb-reducer.c[16090,16103] [2022-02-20 18:52:17,561 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.UNBOUNDED.pals.c.v+lhb-reducer.c[17074,17087] [2022-02-20 18:52:17,573 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.UNBOUNDED.pals.c.v+lhb-reducer.c[19370,19383] [2022-02-20 18:52:17,577 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.UNBOUNDED.pals.c.v+lhb-reducer.c[20029,20042] [2022-02-20 18:52:17,582 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21011,21024] [2022-02-20 18:52:17,590 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.UNBOUNDED.pals.c.v+lhb-reducer.c[22802,22815] [2022-02-20 18:52:17,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:17,685 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:52:17,742 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.UNBOUNDED.pals.c.v+lhb-reducer.c[8891,8904] [2022-02-20 18:52:17,752 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.UNBOUNDED.pals.c.v+lhb-reducer.c[12143,12156] [2022-02-20 18:52:17,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13299,13312] [2022-02-20 18:52:17,759 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13955,13968] [2022-02-20 18:52:17,764 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.UNBOUNDED.pals.c.v+lhb-reducer.c[15434,15447] [2022-02-20 18:52:17,767 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.UNBOUNDED.pals.c.v+lhb-reducer.c[16090,16103] [2022-02-20 18:52:17,771 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.UNBOUNDED.pals.c.v+lhb-reducer.c[17074,17087] [2022-02-20 18:52:17,777 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.UNBOUNDED.pals.c.v+lhb-reducer.c[19370,19383] [2022-02-20 18:52:17,780 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.UNBOUNDED.pals.c.v+lhb-reducer.c[20029,20042] [2022-02-20 18:52:17,783 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.UNBOUNDED.pals.c.v+lhb-reducer.c[21011,21024] [2022-02-20 18:52:17,789 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.UNBOUNDED.pals.c.v+lhb-reducer.c[22802,22815] [2022-02-20 18:52:17,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:52:17,841 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:52:17,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:17 WrapperNode [2022-02-20 18:52:17,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:52:17,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:17,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:52:17,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:52:17,850 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:17" (1/1) ... [2022-02-20 18:52:17,879 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:17" (1/1) ... [2022-02-20 18:52:17,957 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1788 [2022-02-20 18:52:17,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:52:17,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:52:17,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:52:17,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:52:17,966 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:17" (1/1) ... [2022-02-20 18:52:17,966 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:17" (1/1) ... [2022-02-20 18:52:17,972 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:17" (1/1) ... [2022-02-20 18:52:17,972 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:17" (1/1) ... [2022-02-20 18:52:17,989 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:17" (1/1) ... [2022-02-20 18:52:18,012 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:17" (1/1) ... [2022-02-20 18:52:18,018 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:17" (1/1) ... [2022-02-20 18:52:18,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:52:18,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:52:18,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:52:18,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:52:18,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:17" (1/1) ... [2022-02-20 18:52:18,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:52:18,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:52:18,068 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:18,092 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:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:52:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:52:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:52:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:52:18,296 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:52:18,297 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:52:19,527 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:52:19,542 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:52:19,543 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:52:19,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:19 BoogieIcfgContainer [2022-02-20 18:52:19,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:52:19,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:52:19,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:52:19,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:52:19,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:52:17" (1/3) ... [2022-02-20 18:52:19,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bed014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:19, skipping insertion in model container [2022-02-20 18:52:19,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:52:17" (2/3) ... [2022-02-20 18:52:19,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bed014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:52:19, skipping insertion in model container [2022-02-20 18:52:19,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:52:19" (3/3) ... [2022-02-20 18:52:19,552 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:52:19,558 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:52:19,558 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 18:52:19,606 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:52:19,611 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:19,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 18:52:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call 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,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:52:19,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:19,663 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] [2022-02-20 18:52:19,663 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:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1863160701, now seen corresponding path program 1 times [2022-02-20 18:52:19,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:19,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838659752] [2022-02-20 18:52:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:19,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:20,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {362#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:20,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {362#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:20,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {362#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:20,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {363#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:20,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {363#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {363#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:20,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {364#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {364#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {364#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:20,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {364#(<= (+ ~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; {361#false} is VALID [2022-02-20 18:52:20,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {361#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {361#false} is VALID [2022-02-20 18:52:20,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:52:20,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {361#false} is VALID [2022-02-20 18:52:20,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:52:20,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {361#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~8#1; {361#false} is VALID [2022-02-20 18:52:20,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:52:20,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {361#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {361#false} is VALID [2022-02-20 18:52:20,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#false} assume !(~r1~0 % 256 >= 4); {361#false} is VALID [2022-02-20 18:52:20,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {361#false} is VALID [2022-02-20 18:52:20,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {361#false} assume ~r1~0 % 256 < 4;main_~check__tmp~31#1 := 1;~__return_2986~0 := main_~check__tmp~31#1;main_~main__c1~0#1 := ~__return_2986~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; {361#false} is VALID [2022-02-20 18:52:20,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {361#false} assume !(0 == main_~assert__arg~27#1 % 256); {361#false} is VALID [2022-02-20 18:52:20,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {361#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:52:20,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {361#false} assume !(0 == ~mode1~0 % 256); {361#false} is VALID [2022-02-20 18:52:20,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {361#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:52:20,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {361#false} assume main_~node1__m1~1#1 != ~nomsg~0; {361#false} is VALID [2022-02-20 18:52:20,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {361#false} assume !(main_~node1__m1~1#1 > ~id1~0); {361#false} is VALID [2022-02-20 18:52:20,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:52:20,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {361#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:52:20,090 INFO L290 TraceCheckUtils]: 46: Hoare triple {361#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {361#false} is VALID [2022-02-20 18:52:20,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {361#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:52:20,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {361#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:52:20,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {361#false} assume main_~node3__m3~4#1 != ~nomsg~0; {361#false} is VALID [2022-02-20 18:52:20,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {361#false} assume !(main_~node3__m3~4#1 > ~id3~0); {361#false} is VALID [2022-02-20 18:52:20,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:52:20,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {361#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {361#false} is VALID [2022-02-20 18:52:20,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {361#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {361#false} is VALID [2022-02-20 18:52:20,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {361#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; {361#false} is VALID [2022-02-20 18:52:20,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {361#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3681~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3681~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; {361#false} is VALID [2022-02-20 18:52:20,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {361#false} assume 0 == main_~assert__arg~11#1 % 256; {361#false} is VALID [2022-02-20 18:52:20,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 18:52:20,094 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:20,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:20,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838659752] [2022-02-20 18:52:20,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838659752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:20,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:20,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:20,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878102097] [2022-02-20 18:52:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:20,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:52:20,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:20,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:20,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:20,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:20,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:20,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:20,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:20,192 INFO L87 Difference]: Start difference. First operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 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.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:21,292 INFO L93 Difference]: Finished difference Result 569 states and 972 transitions. [2022-02-20 18:52:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:21,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:52:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 972 transitions. [2022-02-20 18:52:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 972 transitions. [2022-02-20 18:52:21,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 972 transitions. [2022-02-20 18:52:22,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 972 edges. 972 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:22,135 INFO L225 Difference]: With dead ends: 569 [2022-02-20 18:52:22,135 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 18:52:22,139 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:22,142 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 1450 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:22,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1450 Valid, 362 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:52:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 18:52:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-02-20 18:52:22,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:22,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 292 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:22,258 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 292 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:22,258 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 292 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:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,267 INFO L93 Difference]: Finished difference Result 293 states and 367 transitions. [2022-02-20 18:52:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 367 transitions. [2022-02-20 18:52:22,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 292 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 293 states. [2022-02-20 18:52:22,271 INFO L87 Difference]: Start difference. First operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 292 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 293 states. [2022-02-20 18:52:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,280 INFO L93 Difference]: Finished difference Result 293 states and 367 transitions. [2022-02-20 18:52:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 367 transitions. [2022-02-20 18:52:22,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:22,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:22,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:22,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 292 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:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 367 transitions. [2022-02-20 18:52:22,292 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 367 transitions. Word has length 58 [2022-02-20 18:52:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:22,293 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 367 transitions. [2022-02-20 18:52:22,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call 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,293 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 367 transitions. [2022-02-20 18:52:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:52:22,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:22,295 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:22,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:52:22,295 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:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1094505509, now seen corresponding path program 1 times [2022-02-20 18:52:22,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:22,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905761808] [2022-02-20 18:52:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:22,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {1982#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {1984#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:22,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {1984#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {1985#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:22,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {1985#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {1985#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:22,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {1985#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {1986#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {1986#(<= (+ ~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; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {1986#(<= (+ ~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; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {1986#(<= (+ ~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; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {1986#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {1986#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:22,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {1986#(<= (+ ~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; {1983#false} is VALID [2022-02-20 18:52:22,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {1983#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1983#false} is VALID [2022-02-20 18:52:22,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {1983#false} assume !(~r1~0 % 256 >= 4); {1983#false} is VALID [2022-02-20 18:52:22,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {1983#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {1983#false} is VALID [2022-02-20 18:52:22,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {1983#false} assume ~r1~0 % 256 < 4;main_~check__tmp~23#1 := 1;~__return_3910~0 := main_~check__tmp~23#1;main_~main__c1~0#1 := ~__return_3910~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; {1983#false} is VALID [2022-02-20 18:52:22,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {1983#false} assume !(0 == main_~assert__arg~19#1 % 256); {1983#false} is VALID [2022-02-20 18:52:22,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {1983#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1983#false} is VALID [2022-02-20 18:52:22,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {1983#false} assume !(0 == ~mode1~0 % 256); {1983#false} is VALID [2022-02-20 18:52:22,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {1983#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1983#false} is VALID [2022-02-20 18:52:22,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {1983#false} assume main_~node1__m1~1#1 != ~nomsg~0; {1983#false} is VALID [2022-02-20 18:52:22,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {1983#false} assume !(main_~node1__m1~1#1 > ~id1~0); {1983#false} is VALID [2022-02-20 18:52:22,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {1983#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; {1983#false} is VALID [2022-02-20 18:52:22,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {1983#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1983#false} is VALID [2022-02-20 18:52:22,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {1983#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {1983#false} is VALID [2022-02-20 18:52:22,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {1983#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {1983#false} is VALID [2022-02-20 18:52:22,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {1983#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1983#false} is VALID [2022-02-20 18:52:22,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {1983#false} assume main_~node3__m3~4#1 != ~nomsg~0; {1983#false} is VALID [2022-02-20 18:52:22,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {1983#false} assume !(main_~node3__m3~4#1 > ~id3~0); {1983#false} is VALID [2022-02-20 18:52:22,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {1983#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; {1983#false} is VALID [2022-02-20 18:52:22,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {1983#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1983#false} is VALID [2022-02-20 18:52:22,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {1983#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {1983#false} is VALID [2022-02-20 18:52:22,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {1983#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; {1983#false} is VALID [2022-02-20 18:52:22,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {1983#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3681~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3681~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; {1983#false} is VALID [2022-02-20 18:52:22,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {1983#false} assume 0 == main_~assert__arg~11#1 % 256; {1983#false} is VALID [2022-02-20 18:52:22,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {1983#false} assume !false; {1983#false} is VALID [2022-02-20 18:52:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:22,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:22,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905761808] [2022-02-20 18:52:22,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905761808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:22,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:22,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:22,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399612330] [2022-02-20 18:52:22,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:22,446 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:22,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:22,447 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:22,488 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:22,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:22,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:22,490 INFO L87 Difference]: Start difference. First operand 293 states and 367 transitions. 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:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,304 INFO L93 Difference]: Finished difference Result 496 states and 637 transitions. [2022-02-20 18:52:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:23,305 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:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:23,305 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:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2022-02-20 18:52:23,311 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:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2022-02-20 18:52:23,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 637 transitions. [2022-02-20 18:52:23,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:23,817 INFO L225 Difference]: With dead ends: 496 [2022-02-20 18:52:23,817 INFO L226 Difference]: Without dead ends: 273 [2022-02-20 18:52:23,818 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:23,819 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 933 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:23,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 211 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-02-20 18:52:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-02-20 18:52:23,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:23,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 273 states, 262 states have (on average 1.3053435114503817) internal successors, (342), 272 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:23,975 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 273 states, 262 states have (on average 1.3053435114503817) internal successors, (342), 272 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:23,976 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 273 states, 262 states have (on average 1.3053435114503817) internal successors, (342), 272 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:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,983 INFO L93 Difference]: Finished difference Result 273 states and 342 transitions. [2022-02-20 18:52:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2022-02-20 18:52:23,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:23,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:23,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 262 states have (on average 1.3053435114503817) internal successors, (342), 272 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 273 states. [2022-02-20 18:52:23,985 INFO L87 Difference]: Start difference. First operand has 273 states, 262 states have (on average 1.3053435114503817) internal successors, (342), 272 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 273 states. [2022-02-20 18:52:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,993 INFO L93 Difference]: Finished difference Result 273 states and 342 transitions. [2022-02-20 18:52:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2022-02-20 18:52:23,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:23,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:23,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:23,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 262 states have (on average 1.3053435114503817) internal successors, (342), 272 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:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2022-02-20 18:52:24,013 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 59 [2022-02-20 18:52:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:24,013 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2022-02-20 18:52:24,014 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:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2022-02-20 18:52:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:52:24,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:24,015 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:24,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:52:24,015 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:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash 568036411, now seen corresponding path program 1 times [2022-02-20 18:52:24,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:24,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737253965] [2022-02-20 18:52:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:24,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {3467#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {3469#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:24,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {3469#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {3469#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:24,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {3469#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {3469#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:24,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {3469#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {3469#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:24,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {3469#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {3469#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:24,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {3469#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {3469#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:24,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {3469#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {3469#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:24,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {3469#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {3470#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:24,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {3470#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {3470#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:24,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {3470#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {3471#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {3471#(<= (+ ~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; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {3471#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3471#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:24,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {3471#(<= (+ ~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; {3468#false} is VALID [2022-02-20 18:52:24,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {3468#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {3468#false} is VALID [2022-02-20 18:52:24,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {3468#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; {3468#false} is VALID [2022-02-20 18:52:24,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {3468#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~4#1; {3468#false} is VALID [2022-02-20 18:52:24,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {3468#false} assume ~send4~0 != ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {3468#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; {3468#false} is VALID [2022-02-20 18:52:24,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {3468#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {3468#false} is VALID [2022-02-20 18:52:24,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {3468#false} assume !(~r1~0 % 256 >= 4); {3468#false} is VALID [2022-02-20 18:52:24,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {3468#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {3468#false} is VALID [2022-02-20 18:52:24,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {3468#false} assume ~r1~0 % 256 < 4;main_~check__tmp~22#1 := 1;~__return_4007~0 := main_~check__tmp~22#1;main_~main__c1~0#1 := ~__return_4007~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; {3468#false} is VALID [2022-02-20 18:52:24,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {3468#false} assume !(0 == main_~assert__arg~18#1 % 256); {3468#false} is VALID [2022-02-20 18:52:24,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {3468#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {3468#false} assume !(0 == ~mode1~0 % 256); {3468#false} is VALID [2022-02-20 18:52:24,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {3468#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {3468#false} assume main_~node1__m1~1#1 != ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {3468#false} assume !(main_~node1__m1~1#1 > ~id1~0); {3468#false} is VALID [2022-02-20 18:52:24,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {3468#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; {3468#false} is VALID [2022-02-20 18:52:24,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {3468#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {3468#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {3468#false} is VALID [2022-02-20 18:52:24,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {3468#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {3468#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {3468#false} assume main_~node3__m3~4#1 != ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {3468#false} assume !(main_~node3__m3~4#1 > ~id3~0); {3468#false} is VALID [2022-02-20 18:52:24,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {3468#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; {3468#false} is VALID [2022-02-20 18:52:24,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {3468#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3468#false} is VALID [2022-02-20 18:52:24,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {3468#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {3468#false} is VALID [2022-02-20 18:52:24,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {3468#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; {3468#false} is VALID [2022-02-20 18:52:24,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {3468#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3681~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3681~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; {3468#false} is VALID [2022-02-20 18:52:24,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {3468#false} assume 0 == main_~assert__arg~11#1 % 256; {3468#false} is VALID [2022-02-20 18:52:24,131 INFO L290 TraceCheckUtils]: 59: Hoare triple {3468#false} assume !false; {3468#false} is VALID [2022-02-20 18:52:24,132 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:24,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:24,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737253965] [2022-02-20 18:52:24,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737253965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:24,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:24,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:24,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962007633] [2022-02-20 18:52:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:24,134 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:24,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:24,134 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:24,183 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:24,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:24,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:24,188 INFO L87 Difference]: Start difference. First operand 273 states and 342 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:24,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:24,923 INFO L93 Difference]: Finished difference Result 476 states and 611 transitions. [2022-02-20 18:52:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:24,924 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:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:24,924 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:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-02-20 18:52:24,934 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:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-02-20 18:52:24,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 611 transitions. [2022-02-20 18:52:25,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:25,366 INFO L225 Difference]: With dead ends: 476 [2022-02-20 18:52:25,366 INFO L226 Difference]: Without dead ends: 254 [2022-02-20 18:52:25,367 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:25,368 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 905 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:25,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [905 Valid, 200 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-02-20 18:52:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-02-20 18:52:25,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:25,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 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:25,566 INFO L74 IsIncluded]: Start isIncluded. First operand 254 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:25,566 INFO L87 Difference]: Start difference. First operand 254 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:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:25,572 INFO L93 Difference]: Finished difference Result 254 states and 320 transitions. [2022-02-20 18:52:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 320 transitions. [2022-02-20 18:52:25,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:25,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:25,573 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 254 states. [2022-02-20 18:52:25,574 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 254 states. [2022-02-20 18:52:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:25,579 INFO L93 Difference]: Finished difference Result 254 states and 320 transitions. [2022-02-20 18:52:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 320 transitions. [2022-02-20 18:52:25,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:25,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:25,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:25,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:25,580 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:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 320 transitions. [2022-02-20 18:52:25,586 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 320 transitions. Word has length 60 [2022-02-20 18:52:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:25,586 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 320 transitions. [2022-02-20 18:52:25,586 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:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 320 transitions. [2022-02-20 18:52:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:52:25,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:25,587 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:25,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:52:25,588 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:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash -715476529, now seen corresponding path program 1 times [2022-02-20 18:52:25,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:25,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037795884] [2022-02-20 18:52:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:25,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:25,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {4875#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {4877#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {4877#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:25,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {4877#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {4878#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:25,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {4878#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {4878#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:25,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {4878#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {4879#(<= (+ ~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; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#(<= (+ ~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; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4879#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:25,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#(<= (+ ~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; {4876#false} is VALID [2022-02-20 18:52:25,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {4876#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~2#1; {4876#false} is VALID [2022-02-20 18:52:25,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {4876#false} assume ~send4~0 != ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {4876#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; {4876#false} is VALID [2022-02-20 18:52:25,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {4876#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4876#false} is VALID [2022-02-20 18:52:25,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {4876#false} assume !(~r1~0 % 256 >= 4); {4876#false} is VALID [2022-02-20 18:52:25,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {4876#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4876#false} is VALID [2022-02-20 18:52:25,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {4876#false} assume ~r1~0 % 256 < 4;main_~check__tmp~18#1 := 1;~__return_4359~0 := main_~check__tmp~18#1;main_~main__c1~0#1 := ~__return_4359~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; {4876#false} is VALID [2022-02-20 18:52:25,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {4876#false} assume !(0 == main_~assert__arg~14#1 % 256); {4876#false} is VALID [2022-02-20 18:52:25,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {4876#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {4876#false} assume !(0 == ~mode1~0 % 256); {4876#false} is VALID [2022-02-20 18:52:25,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {4876#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {4876#false} assume main_~node1__m1~1#1 != ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {4876#false} assume !(main_~node1__m1~1#1 > ~id1~0); {4876#false} is VALID [2022-02-20 18:52:25,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {4876#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; {4876#false} is VALID [2022-02-20 18:52:25,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {4876#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {4876#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {4876#false} is VALID [2022-02-20 18:52:25,694 INFO L290 TraceCheckUtils]: 50: Hoare triple {4876#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,694 INFO L290 TraceCheckUtils]: 51: Hoare triple {4876#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,694 INFO L290 TraceCheckUtils]: 52: Hoare triple {4876#false} assume main_~node3__m3~4#1 != ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {4876#false} assume !(main_~node3__m3~4#1 > ~id3~0); {4876#false} is VALID [2022-02-20 18:52:25,694 INFO L290 TraceCheckUtils]: 54: Hoare triple {4876#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; {4876#false} is VALID [2022-02-20 18:52:25,695 INFO L290 TraceCheckUtils]: 55: Hoare triple {4876#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4876#false} is VALID [2022-02-20 18:52:25,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {4876#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {4876#false} is VALID [2022-02-20 18:52:25,695 INFO L290 TraceCheckUtils]: 57: Hoare triple {4876#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; {4876#false} is VALID [2022-02-20 18:52:25,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {4876#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3681~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3681~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; {4876#false} is VALID [2022-02-20 18:52:25,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {4876#false} assume 0 == main_~assert__arg~11#1 % 256; {4876#false} is VALID [2022-02-20 18:52:25,696 INFO L290 TraceCheckUtils]: 60: Hoare triple {4876#false} assume !false; {4876#false} is VALID [2022-02-20 18:52:25,696 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:25,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:25,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037795884] [2022-02-20 18:52:25,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037795884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:25,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:25,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:25,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015877812] [2022-02-20 18:52:25,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:25,698 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:25,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:25,702 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:25,744 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:25,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:25,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:25,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:25,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:25,746 INFO L87 Difference]: Start difference. First operand 254 states and 320 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:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:26,544 INFO L93 Difference]: Finished difference Result 457 states and 588 transitions. [2022-02-20 18:52:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:26,545 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:26,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:26,545 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:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-02-20 18:52:26,549 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:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-02-20 18:52:26,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-02-20 18:52:26,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:26,945 INFO L225 Difference]: With dead ends: 457 [2022-02-20 18:52:26,945 INFO L226 Difference]: Without dead ends: 246 [2022-02-20 18:52:26,946 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:26,947 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 858 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:26,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 196 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-02-20 18:52:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-02-20 18:52:27,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:27,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 246 states, 235 states have (on average 1.3191489361702127) internal successors, (310), 245 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:27,196 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 246 states, 235 states have (on average 1.3191489361702127) internal successors, (310), 245 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:27,197 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 246 states, 235 states have (on average 1.3191489361702127) internal successors, (310), 245 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:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:27,201 INFO L93 Difference]: Finished difference Result 246 states and 310 transitions. [2022-02-20 18:52:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2022-02-20 18:52:27,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:27,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:27,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.3191489361702127) internal successors, (310), 245 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 246 states. [2022-02-20 18:52:27,203 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.3191489361702127) internal successors, (310), 245 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 246 states. [2022-02-20 18:52:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:27,208 INFO L93 Difference]: Finished difference Result 246 states and 310 transitions. [2022-02-20 18:52:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2022-02-20 18:52:27,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:27,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:27,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:27,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3191489361702127) internal successors, (310), 245 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:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2022-02-20 18:52:27,215 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 61 [2022-02-20 18:52:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:27,215 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2022-02-20 18:52:27,215 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:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2022-02-20 18:52:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:27,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:27,228 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:27,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:52:27,229 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:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 207205371, now seen corresponding path program 1 times [2022-02-20 18:52:27,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:27,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90401760] [2022-02-20 18:52:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:27,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {6240#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {6242#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {6242#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {6243#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:27,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {6243#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {6243#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:27,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {6243#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {6244#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:27,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {6244#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {6244#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:27,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {6244#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {6245#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {6246#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {6246#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {6246#(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; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {6246#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {6246#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {6246#(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; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {6246#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {6246#(not (= ~nomsg~0 ~p1_new~0))} assume ~send4~0 != ~nomsg~0; {6246#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:52:27,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {6246#(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; {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 4); {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {6247#(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; {6247#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:27,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {6247#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6248#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:52:27,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {6248#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {6241#false} is VALID [2022-02-20 18:52:27,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {6241#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6241#false} is VALID [2022-02-20 18:52:27,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {6241#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6241#false} is VALID [2022-02-20 18:52:27,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {6241#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6241#false} is VALID [2022-02-20 18:52:27,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {6241#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6241#false} is VALID [2022-02-20 18:52:27,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {6241#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; {6241#false} is VALID [2022-02-20 18:52:27,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {6241#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6241#false} is VALID [2022-02-20 18:52:27,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {6241#false} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {6241#false} is VALID [2022-02-20 18:52:27,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {6241#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; {6241#false} is VALID [2022-02-20 18:52:27,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {6241#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3681~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3681~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; {6241#false} is VALID [2022-02-20 18:52:27,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {6241#false} assume 0 == main_~assert__arg~11#1 % 256; {6241#false} is VALID [2022-02-20 18:52:27,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {6241#false} assume !false; {6241#false} is VALID [2022-02-20 18:52:27,507 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,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:27,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90401760] [2022-02-20 18:52:27,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90401760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:27,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:27,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:27,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992022025] [2022-02-20 18:52:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:27,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:27,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:27,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:27,564 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:27,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:27,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:27,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:27,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:27,568 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:30,301 INFO L93 Difference]: Finished difference Result 580 states and 772 transitions. [2022-02-20 18:52:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:30,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 772 transitions. [2022-02-20 18:52:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 772 transitions. [2022-02-20 18:52:30,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 772 transitions. [2022-02-20 18:52:30,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 772 edges. 772 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:30,892 INFO L225 Difference]: With dead ends: 580 [2022-02-20 18:52:30,893 INFO L226 Difference]: Without dead ends: 492 [2022-02-20 18:52:30,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:30,894 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 1277 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:30,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 877 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-02-20 18:52:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 246. [2022-02-20 18:52:31,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:31,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call 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,279 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call 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,279 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call 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,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,297 INFO L93 Difference]: Finished difference Result 492 states and 649 transitions. [2022-02-20 18:52:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 649 transitions. [2022-02-20 18:52:31,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 0 states have call successors, (0), 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 492 states. [2022-02-20 18:52:31,300 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 0 states have call successors, (0), 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 492 states. [2022-02-20 18:52:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:31,314 INFO L93 Difference]: Finished difference Result 492 states and 649 transitions. [2022-02-20 18:52:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 649 transitions. [2022-02-20 18:52:31,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:31,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:31,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:31,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call 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,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 309 transitions. [2022-02-20 18:52:31,322 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 309 transitions. Word has length 62 [2022-02-20 18:52:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:31,323 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 309 transitions. [2022-02-20 18:52:31,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 309 transitions. [2022-02-20 18:52:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:31,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:31,324 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:31,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:52:31,325 INFO L402 AbstractCegarLoop]: === Iteration 6 === 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:31,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -201639857, now seen corresponding path program 1 times [2022-02-20 18:52:31,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:31,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611836534] [2022-02-20 18:52:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:31,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {8306#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {8308#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:31,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {8308#(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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {8309#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {8310#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {8310#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {8310#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {8310#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {8311#(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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {8311#(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; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {8311#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:31,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {8311#(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; {8312#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:31,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {8312#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8312#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:31,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {8312#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {8312#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:31,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {8312#(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; {8312#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:31,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {8312#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {8312#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:31,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {8312#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {8312#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:31,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {8312#(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; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {8313#(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; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {8313#(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; {8313#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:31,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {8313#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8314#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:52:31,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {8314#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {8307#false} is VALID [2022-02-20 18:52:31,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {8307#false} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {8307#false} is VALID [2022-02-20 18:52:31,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {8307#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8307#false} is VALID [2022-02-20 18:52:31,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {8307#false} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {8307#false} is VALID [2022-02-20 18:52:31,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {8307#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; {8307#false} is VALID [2022-02-20 18:52:31,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {8307#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~14#1 := 0;~__return_4066~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_4066~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; {8307#false} is VALID [2022-02-20 18:52:31,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {8307#false} assume 0 == main_~assert__arg~12#1 % 256; {8307#false} is VALID [2022-02-20 18:52:31,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {8307#false} assume !false; {8307#false} is VALID [2022-02-20 18:52:31,524 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,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:31,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611836534] [2022-02-20 18:52:31,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611836534] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:31,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:31,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:31,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71747521] [2022-02-20 18:52:31,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:31,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:31,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:31,580 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:31,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:31,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:31,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:31,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:31,581 INFO L87 Difference]: Start difference. First operand 246 states and 309 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:34,828 INFO L93 Difference]: Finished difference Result 554 states and 738 transitions. [2022-02-20 18:52:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 738 transitions. [2022-02-20 18:52:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 738 transitions. [2022-02-20 18:52:34,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 738 transitions. [2022-02-20 18:52:35,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 738 edges. 738 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:35,456 INFO L225 Difference]: With dead ends: 554 [2022-02-20 18:52:35,456 INFO L226 Difference]: Without dead ends: 488 [2022-02-20 18:52:35,457 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:35,457 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 1847 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:35,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1847 Valid, 1005 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:52:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-02-20 18:52:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 246. [2022-02-20 18:52:35,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:35,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 245 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call 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,882 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 245 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call 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,883 INFO L87 Difference]: Start difference. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 245 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call 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,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:35,896 INFO L93 Difference]: Finished difference Result 488 states and 643 transitions. [2022-02-20 18:52:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 643 transitions. [2022-02-20 18:52:35,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:35,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:35,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 245 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 488 states. [2022-02-20 18:52:35,898 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 245 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 488 states. [2022-02-20 18:52:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:35,912 INFO L93 Difference]: Finished difference Result 488 states and 643 transitions. [2022-02-20 18:52:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 643 transitions. [2022-02-20 18:52:35,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:35,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:35,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:35,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 245 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call 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,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 308 transitions. [2022-02-20 18:52:35,921 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 308 transitions. Word has length 62 [2022-02-20 18:52:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:35,921 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 308 transitions. [2022-02-20 18:52:35,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 308 transitions. [2022-02-20 18:52:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:35,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:35,922 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:35,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:35,923 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1938423665, now seen corresponding path program 1 times [2022-02-20 18:52:35,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:35,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151156459] [2022-02-20 18:52:35,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:36,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {10336#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {10338#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:36,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {10338#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {10339#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {10339#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {10339#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {10339#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {10340#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {10340#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {10340#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:36,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {10340#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:36,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {10341#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send2~0 != ~nomsg~0; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~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; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send3~0 != ~nomsg~0; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~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; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send4~0 != ~nomsg~0; {10342#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:36,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {10342#(<= (+ ~nomsg~0 1) ~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; {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(~r1~0 % 256 >= 4); {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256); {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == ~mode1~0 % 256); {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:36,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {10343#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10344#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} is VALID [2022-02-20 18:52:36,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {10344#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {10345#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:36,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {10345#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10345#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:36,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {10345#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10346#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:52:36,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {10346#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {10337#false} is VALID [2022-02-20 18:52:36,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {10337#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {10337#false} is VALID [2022-02-20 18:52:36,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {10337#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10337#false} is VALID [2022-02-20 18:52:36,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {10337#false} assume main_~node3__m3~1#1 != ~nomsg~0; {10337#false} is VALID [2022-02-20 18:52:36,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {10337#false} assume !(main_~node3__m3~1#1 > ~id3~0); {10337#false} is VALID [2022-02-20 18:52:36,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {10337#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; {10337#false} is VALID [2022-02-20 18:52:36,133 INFO L290 TraceCheckUtils]: 55: Hoare triple {10337#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~3#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10337#false} is VALID [2022-02-20 18:52:36,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {10337#false} assume main_~node4__m4~3#1 != ~nomsg~0; {10337#false} is VALID [2022-02-20 18:52:36,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {10337#false} assume !(main_~node4__m4~3#1 > ~id4~0); {10337#false} is VALID [2022-02-20 18:52:36,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {10337#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; {10337#false} is VALID [2022-02-20 18:52:36,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {10337#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~5#1 := 0;~__return_3767~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_3767~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; {10337#false} is VALID [2022-02-20 18:52:36,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {10337#false} assume 0 == main_~assert__arg~5#1 % 256; {10337#false} is VALID [2022-02-20 18:52:36,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {10337#false} assume !false; {10337#false} is VALID [2022-02-20 18:52:36,135 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,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:36,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151156459] [2022-02-20 18:52:36,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151156459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:36,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:36,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:52:36,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321863536] [2022-02-20 18:52:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:36,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:36,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:36,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:36,186 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:36,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:36,186 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:36,187 INFO L87 Difference]: Start difference. First operand 246 states and 308 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:39,323 INFO L93 Difference]: Finished difference Result 582 states and 771 transitions. [2022-02-20 18:52:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:52:39,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 771 transitions. [2022-02-20 18:52:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 771 transitions. [2022-02-20 18:52:39,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 771 transitions. [2022-02-20 18:52:39,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:39,971 INFO L225 Difference]: With dead ends: 582 [2022-02-20 18:52:39,971 INFO L226 Difference]: Without dead ends: 488 [2022-02-20 18:52:39,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:52:39,972 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 2195 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:39,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2195 Valid, 1101 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-02-20 18:52:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 246. [2022-02-20 18:52:40,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:40,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 245 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:40,478 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 245 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:40,479 INFO L87 Difference]: Start difference. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 245 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:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:40,491 INFO L93 Difference]: Finished difference Result 488 states and 642 transitions. [2022-02-20 18:52:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 642 transitions. [2022-02-20 18:52:40,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:40,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:40,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 245 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 488 states. [2022-02-20 18:52:40,494 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 245 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 488 states. [2022-02-20 18:52:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:40,510 INFO L93 Difference]: Finished difference Result 488 states and 642 transitions. [2022-02-20 18:52:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 642 transitions. [2022-02-20 18:52:40,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:40,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:40,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:40,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 245 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:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 307 transitions. [2022-02-20 18:52:40,516 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 307 transitions. Word has length 62 [2022-02-20 18:52:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:40,517 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 307 transitions. [2022-02-20 18:52:40,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 307 transitions. [2022-02-20 18:52:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:40,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:40,518 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:40,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:40,519 INFO L402 AbstractCegarLoop]: === Iteration 8 === 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:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1233191565, now seen corresponding path program 1 times [2022-02-20 18:52:40,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:40,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984211421] [2022-02-20 18:52:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:40,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {12388#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {12390#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {12390#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {12391#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {12392#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {12392#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {12392#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:40,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {12392#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {12393#(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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {12393#(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; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {12393#(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; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {12393#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:40,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {12393#(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; {12394#(<= (+ ~nomsg~0 1) ~p3_new~0)} is VALID [2022-02-20 18:52:40,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {12394#(<= (+ ~nomsg~0 1) ~p3_new~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {12394#(<= (+ ~nomsg~0 1) ~p3_new~0)} is VALID [2022-02-20 18:52:40,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {12394#(<= (+ ~nomsg~0 1) ~p3_new~0)} assume ~send4~0 != ~nomsg~0; {12394#(<= (+ ~nomsg~0 1) ~p3_new~0)} is VALID [2022-02-20 18:52:40,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {12394#(<= (+ ~nomsg~0 1) ~p3_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; {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:40,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:40,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume !(~r1~0 % 256 >= 4); {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:40,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:40,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:40,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256); {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:40,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:40,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume !(0 == ~mode1~0 % 256); {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:40,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {12395#(or (not (= ~nomsg~0 ~p4_old~0)) (not (= ~p3_old~0 ~p4_old~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12396#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p3_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} is VALID [2022-02-20 18:52:40,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {12396#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p3_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {12397#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {12397#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {12397#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {12397#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {12397#(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; {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {12397#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {12397#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~3#1 != ~nomsg~0; {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {12397#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~3#1 > ~id3~0); {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,706 INFO L290 TraceCheckUtils]: 55: Hoare triple {12397#(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; {12397#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:40,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {12397#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12398#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~5#1|))} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {12398#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~5#1|))} assume !(main_~node4__m4~5#1 != ~nomsg~0);~mode4~0 := 0; {12389#false} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {12389#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; {12389#false} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 59: Hoare triple {12389#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~8#1 := 0;~__return_4324~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_4324~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; {12389#false} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {12389#false} assume 0 == main_~assert__arg~8#1 % 256; {12389#false} is VALID [2022-02-20 18:52:40,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {12389#false} assume !false; {12389#false} is VALID [2022-02-20 18:52:40,708 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,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:40,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984211421] [2022-02-20 18:52:40,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984211421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:40,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:40,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:52:40,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569870077] [2022-02-20 18:52:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:40,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:40,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:40,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:40,755 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:40,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:40,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:40,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:40,758 INFO L87 Difference]: Start difference. First operand 246 states and 307 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:43,746 INFO L93 Difference]: Finished difference Result 481 states and 626 transitions. [2022-02-20 18:52:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:52:43,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 626 transitions. [2022-02-20 18:52:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 626 transitions. [2022-02-20 18:52:43,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 626 transitions. [2022-02-20 18:52:44,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:44,245 INFO L225 Difference]: With dead ends: 481 [2022-02-20 18:52:44,245 INFO L226 Difference]: Without dead ends: 476 [2022-02-20 18:52:44,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:52:44,246 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 1129 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:44,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 1148 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-02-20 18:52:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 246. [2022-02-20 18:52:44,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:44,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 476 states. Second operand has 246 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 245 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:44,783 INFO L74 IsIncluded]: Start isIncluded. First operand 476 states. Second operand has 246 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 245 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:44,783 INFO L87 Difference]: Start difference. First operand 476 states. Second operand has 246 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 245 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:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,798 INFO L93 Difference]: Finished difference Result 476 states and 621 transitions. [2022-02-20 18:52:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 621 transitions. [2022-02-20 18:52:44,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:44,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:44,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 245 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 476 states. [2022-02-20 18:52:44,800 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 245 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 476 states. [2022-02-20 18:52:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:44,815 INFO L93 Difference]: Finished difference Result 476 states and 621 transitions. [2022-02-20 18:52:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 621 transitions. [2022-02-20 18:52:44,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:44,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:44,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:44,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 245 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:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 306 transitions. [2022-02-20 18:52:44,821 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 306 transitions. Word has length 62 [2022-02-20 18:52:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:44,822 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 306 transitions. [2022-02-20 18:52:44,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 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:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 306 transitions. [2022-02-20 18:52:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:52:44,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:44,823 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:44,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:44,823 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:44,824 INFO L85 PathProgramCache]: Analyzing trace with hash 679005537, now seen corresponding path program 1 times [2022-02-20 18:52:44,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:44,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206343546] [2022-02-20 18:52:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:44,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {14287#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {14289#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:44,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {14289#(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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {14290#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {14291#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {14291#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {14291#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {14291#(and (<= ~id4~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~id4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~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; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~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; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send3~0 != ~nomsg~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} 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; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} assume ~send4~0 != ~nomsg~0; {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:44,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {14292#(and (<= (+ ~nomsg~0 1) ~send4~0) (<= ~send4~0 (+ ~nomsg~0 128)))} 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; {14293#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:44,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {14293#(not (= ~nomsg~0 ~p4_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {14293#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:44,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {14293#(not (= ~nomsg~0 ~p4_old~0))} assume !(~r1~0 % 256 >= 4); {14293#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:44,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {14293#(not (= ~nomsg~0 ~p4_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {14293#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:44,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {14293#(not (= ~nomsg~0 ~p4_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {14293#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:44,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {14293#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {14293#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:44,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {14293#(not (= ~nomsg~0 ~p4_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14293#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:44,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {14293#(not (= ~nomsg~0 ~p4_old~0))} assume !(0 == ~mode1~0 % 256); {14293#(not (= ~nomsg~0 ~p4_old~0))} is VALID [2022-02-20 18:52:44,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {14293#(not (= ~nomsg~0 ~p4_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {14294#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:52:44,968 INFO L290 TraceCheckUtils]: 46: Hoare triple {14294#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {14288#false} is VALID [2022-02-20 18:52:44,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {14288#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14288#false} is VALID [2022-02-20 18:52:44,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {14288#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14288#false} is VALID [2022-02-20 18:52:44,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {14288#false} assume main_~node2__m2~1#1 != ~nomsg~0; {14288#false} is VALID [2022-02-20 18:52:44,969 INFO L290 TraceCheckUtils]: 50: Hoare triple {14288#false} assume !(main_~node2__m2~1#1 > ~id2~0); {14288#false} is VALID [2022-02-20 18:52:44,969 INFO L290 TraceCheckUtils]: 51: Hoare triple {14288#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {14288#false} is VALID [2022-02-20 18:52:44,969 INFO L290 TraceCheckUtils]: 52: Hoare triple {14288#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14288#false} is VALID [2022-02-20 18:52:44,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {14288#false} assume !(main_~node3__m3~3#1 != ~nomsg~0);~mode3~0 := 0; {14288#false} is VALID [2022-02-20 18:52:44,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {14288#false} havoc main_~node4__m4~4#1;main_~node4__m4~4#1 := ~nomsg~0; {14288#false} is VALID [2022-02-20 18:52:44,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {14288#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~4#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14288#false} is VALID [2022-02-20 18:52:44,970 INFO L290 TraceCheckUtils]: 56: Hoare triple {14288#false} assume main_~node4__m4~4#1 != ~nomsg~0; {14288#false} is VALID [2022-02-20 18:52:44,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {14288#false} assume !(main_~node4__m4~4#1 > ~id4~0); {14288#false} is VALID [2022-02-20 18:52:44,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {14288#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; {14288#false} is VALID [2022-02-20 18:52:44,970 INFO L290 TraceCheckUtils]: 59: Hoare triple {14288#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_4150~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_4150~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; {14288#false} is VALID [2022-02-20 18:52:44,971 INFO L290 TraceCheckUtils]: 60: Hoare triple {14288#false} assume 0 == main_~assert__arg~7#1 % 256; {14288#false} is VALID [2022-02-20 18:52:44,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {14288#false} assume !false; {14288#false} is VALID [2022-02-20 18:52:44,971 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:44,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:44,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206343546] [2022-02-20 18:52:44,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206343546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:44,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:44,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:52:44,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284676233] [2022-02-20 18:52:44,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:44,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:44,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:44,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:45,021 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:45,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:52:45,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:45,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:52:45,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:52:45,022 INFO L87 Difference]: Start difference. First operand 246 states and 306 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:47,299 INFO L93 Difference]: Finished difference Result 485 states and 606 transitions. [2022-02-20 18:52:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:52:47,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 606 transitions. [2022-02-20 18:52:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 606 transitions. [2022-02-20 18:52:47,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 606 transitions. [2022-02-20 18:52:47,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 606 edges. 606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:47,783 INFO L225 Difference]: With dead ends: 485 [2022-02-20 18:52:47,783 INFO L226 Difference]: Without dead ends: 352 [2022-02-20 18:52:47,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:52:47,785 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 1611 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:47,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1611 Valid, 632 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-02-20 18:52:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 246. [2022-02-20 18:52:48,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:48,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 246 states, 235 states have (on average 1.297872340425532) internal successors, (305), 245 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:48,289 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 246 states, 235 states have (on average 1.297872340425532) internal successors, (305), 245 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:48,290 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 246 states, 235 states have (on average 1.297872340425532) internal successors, (305), 245 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:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,296 INFO L93 Difference]: Finished difference Result 352 states and 432 transitions. [2022-02-20 18:52:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 432 transitions. [2022-02-20 18:52:48,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:48,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:48,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.297872340425532) internal successors, (305), 245 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 352 states. [2022-02-20 18:52:48,298 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.297872340425532) internal successors, (305), 245 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 352 states. [2022-02-20 18:52:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:48,304 INFO L93 Difference]: Finished difference Result 352 states and 432 transitions. [2022-02-20 18:52:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 432 transitions. [2022-02-20 18:52:48,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:48,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:48,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:48,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.297872340425532) internal successors, (305), 245 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:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 305 transitions. [2022-02-20 18:52:48,310 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 305 transitions. Word has length 62 [2022-02-20 18:52:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:48,310 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 305 transitions. [2022-02-20 18:52:48,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 305 transitions. [2022-02-20 18:52:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:48,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:48,311 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] [2022-02-20 18:52:48,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:48,312 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:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2031197374, now seen corresponding path program 1 times [2022-02-20 18:52:48,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:48,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976324131] [2022-02-20 18:52:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:48,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {15925#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {15927#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:48,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {15927#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {15928#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {15929#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {15929#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {15929#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:48,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {15929#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {15930#(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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {15930#(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; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {15930#(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; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {15930#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:48,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {15930#(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; {15931#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {15931#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {15931#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {15931#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {15931#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {15931#(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; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256); {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {15932#(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; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} ~mode2~0 := 0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {15932#(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; {15932#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:48,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {15932#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~7#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15933#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} is VALID [2022-02-20 18:52:48,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {15933#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~7#1|))} assume !(main_~node4__m4~7#1 != ~nomsg~0);~mode4~0 := 0; {15926#false} is VALID [2022-02-20 18:52:48,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {15926#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; {15926#false} is VALID [2022-02-20 18:52:48,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {15926#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~12#1 := 0;~__return_3681~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_3681~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; {15926#false} is VALID [2022-02-20 18:52:48,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {15926#false} assume 0 == main_~assert__arg~11#1 % 256; {15926#false} is VALID [2022-02-20 18:52:48,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {15926#false} assume !false; {15926#false} is VALID [2022-02-20 18:52:48,451 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:48,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:48,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976324131] [2022-02-20 18:52:48,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976324131] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:48,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:48,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:48,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304410091] [2022-02-20 18:52:48,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:48,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:48,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:48,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:48,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:48,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:48,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:48,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:48,504 INFO L87 Difference]: Start difference. First operand 246 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:51,479 INFO L93 Difference]: Finished difference Result 539 states and 709 transitions. [2022-02-20 18:52:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:51,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 709 transitions. [2022-02-20 18:52:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 709 transitions. [2022-02-20 18:52:51,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 709 transitions. [2022-02-20 18:52:51,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:51,965 INFO L225 Difference]: With dead ends: 539 [2022-02-20 18:52:51,965 INFO L226 Difference]: Without dead ends: 480 [2022-02-20 18:52:51,966 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:51,966 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 1356 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:51,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1356 Valid, 962 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:52:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-02-20 18:52:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 246. [2022-02-20 18:52:52,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:52,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 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:52,511 INFO L74 IsIncluded]: Start isIncluded. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 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:52,512 INFO L87 Difference]: Start difference. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 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:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,523 INFO L93 Difference]: Finished difference Result 480 states and 623 transitions. [2022-02-20 18:52:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 623 transitions. [2022-02-20 18:52:52,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:52,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:52,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 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 480 states. [2022-02-20 18:52:52,525 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 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 480 states. [2022-02-20 18:52:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:52,537 INFO L93 Difference]: Finished difference Result 480 states and 623 transitions. [2022-02-20 18:52:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 623 transitions. [2022-02-20 18:52:52,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:52,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:52,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:52,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 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:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 304 transitions. [2022-02-20 18:52:52,543 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 304 transitions. Word has length 64 [2022-02-20 18:52:52,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:52,543 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 304 transitions. [2022-02-20 18:52:52,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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,543 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2022-02-20 18:52:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:52,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:52,544 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] [2022-02-20 18:52:52,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:52,545 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:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:52,545 INFO L85 PathProgramCache]: Analyzing trace with hash -119000272, now seen corresponding path program 1 times [2022-02-20 18:52:52,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:52,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099972733] [2022-02-20 18:52:52,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:52,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:52,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {17920#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {17922#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:52,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {17922#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:52,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:52,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:52,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:52,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:52,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:52,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {17923#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {17924#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:52,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {17924#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st2~0; {17924#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:52:52,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {17924#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id4~0 >= 0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st4~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send4~0 == ~id4~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode4~0 % 256; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id4~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id4~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {17925#(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_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {17925#(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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {17925#(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; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {17925#(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; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {17925#(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; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {17925#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:52,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {17925#(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; {17926#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:52,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {17926#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17926#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:52,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {17926#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {17926#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:52,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {17926#(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; {17926#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:52,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {17926#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {17926#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:52,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {17926#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {17926#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:52,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {17926#(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; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {17927#(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; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {17927#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:52,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {17927#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17928#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:52:52,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {17928#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {17921#false} is VALID [2022-02-20 18:52:52,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {17921#false} havoc main_~node4__m4~6#1;main_~node4__m4~6#1 := ~nomsg~0; {17921#false} is VALID [2022-02-20 18:52:52,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {17921#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~6#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {17921#false} is VALID [2022-02-20 18:52:52,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {17921#false} assume main_~node4__m4~6#1 != ~nomsg~0; {17921#false} is VALID [2022-02-20 18:52:52,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {17921#false} assume !(main_~node4__m4~6#1 > ~id4~0); {17921#false} is VALID [2022-02-20 18:52:52,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {17921#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; {17921#false} is VALID [2022-02-20 18:52:52,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {17921#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~11#1 := 0;~__return_3484~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_3484~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; {17921#false} is VALID [2022-02-20 18:52:52,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {17921#false} assume 0 == main_~assert__arg~10#1 % 256; {17921#false} is VALID [2022-02-20 18:52:52,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {17921#false} assume !false; {17921#false} is VALID [2022-02-20 18:52:52,720 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:52,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:52,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099972733] [2022-02-20 18:52:52,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099972733] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:52,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:52,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:52,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596166722] [2022-02-20 18:52:52,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:52,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:52,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:52,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:52,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:52,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:52,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:52,770 INFO L87 Difference]: Start difference. First operand 246 states and 304 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:56,080 INFO L93 Difference]: Finished difference Result 559 states and 737 transitions. [2022-02-20 18:52:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:52:56,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 737 transitions. [2022-02-20 18:52:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 737 transitions. [2022-02-20 18:52:56,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 737 transitions. [2022-02-20 18:52:56,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 737 edges. 737 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:56,608 INFO L225 Difference]: With dead ends: 559 [2022-02-20 18:52:56,608 INFO L226 Difference]: Without dead ends: 488 [2022-02-20 18:52:56,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:52:56,610 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 856 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:56,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [856 Valid, 1251 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:52:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-02-20 18:52:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 246. [2022-02-20 18:52:57,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:57,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 245 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:57,172 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 245 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:57,172 INFO L87 Difference]: Start difference. First operand 488 states. Second operand has 246 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 245 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:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:57,181 INFO L93 Difference]: Finished difference Result 488 states and 636 transitions. [2022-02-20 18:52:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 636 transitions. [2022-02-20 18:52:57,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:57,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:57,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 245 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 488 states. [2022-02-20 18:52:57,182 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 245 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 488 states. [2022-02-20 18:52:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:57,192 INFO L93 Difference]: Finished difference Result 488 states and 636 transitions. [2022-02-20 18:52:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 636 transitions. [2022-02-20 18:52:57,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:57,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:57,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:57,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 245 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:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 303 transitions. [2022-02-20 18:52:57,197 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 303 transitions. Word has length 64 [2022-02-20 18:52:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:57,198 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 303 transitions. [2022-02-20 18:52:57,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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,198 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 303 transitions. [2022-02-20 18:52:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:57,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:57,199 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] [2022-02-20 18:52:57,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:57,199 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:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1520301075, now seen corresponding path program 1 times [2022-02-20 18:52:57,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:57,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872156961] [2022-02-20 18:52:57,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:57,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {19953#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {19955#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:57,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {19955#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {19956#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {19957#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {19957#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {19957#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:52:57,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {19957#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {19958#(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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {19958#(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; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {19958#(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; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {19958#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:52:57,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {19958#(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; {19959#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {19959#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {19959#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {19959#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {19959#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,332 INFO L290 TraceCheckUtils]: 37: Hoare triple {19959#(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; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256); {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {19960#(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; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {19960#(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; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 != ~nomsg~0; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node3__m3~5#1 > ~id3~0); {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {19960#(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; {19960#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:52:57,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {19960#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~9#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19961#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~9#1|))} is VALID [2022-02-20 18:52:57,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {19961#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~9#1|))} assume !(main_~node4__m4~9#1 != ~nomsg~0);~mode4~0 := 0; {19954#false} is VALID [2022-02-20 18:52:57,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {19954#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; {19954#false} is VALID [2022-02-20 18:52:57,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {19954#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~16#1 := 0;~__return_4406~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_4406~0; {19954#false} is VALID [2022-02-20 18:52:57,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {19954#false} 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; {19954#false} is VALID [2022-02-20 18:52:57,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {19954#false} assume 0 == main_~assert__arg~2#1 % 256; {19954#false} is VALID [2022-02-20 18:52:57,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {19954#false} assume !false; {19954#false} is VALID [2022-02-20 18:52:57,340 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:57,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:57,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872156961] [2022-02-20 18:52:57,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872156961] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:57,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:57,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:57,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333871453] [2022-02-20 18:52:57,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:57,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:57,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:57,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:57,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:57,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:57,387 INFO L87 Difference]: Start difference. First operand 246 states and 303 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:00,612 INFO L93 Difference]: Finished difference Result 536 states and 704 transitions. [2022-02-20 18:53:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:00,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:53:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 704 transitions. [2022-02-20 18:53:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 704 transitions. [2022-02-20 18:53:00,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 704 transitions. [2022-02-20 18:53:01,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 704 edges. 704 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:01,105 INFO L225 Difference]: With dead ends: 536 [2022-02-20 18:53:01,105 INFO L226 Difference]: Without dead ends: 480 [2022-02-20 18:53:01,105 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:53:01,106 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 1192 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:01,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1192 Valid, 1116 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:53:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-02-20 18:53:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 246. [2022-02-20 18:53:01,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:01,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 245 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:53:01,694 INFO L74 IsIncluded]: Start isIncluded. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 245 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:53:01,695 INFO L87 Difference]: Start difference. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 245 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:53:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:01,704 INFO L93 Difference]: Finished difference Result 480 states and 621 transitions. [2022-02-20 18:53:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 621 transitions. [2022-02-20 18:53:01,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:01,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:01,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 245 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 480 states. [2022-02-20 18:53:01,705 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 245 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 480 states. [2022-02-20 18:53:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:01,712 INFO L93 Difference]: Finished difference Result 480 states and 621 transitions. [2022-02-20 18:53:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 621 transitions. [2022-02-20 18:53:01,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:01,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:01,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:01,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 245 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:53:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 302 transitions. [2022-02-20 18:53:01,718 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 302 transitions. Word has length 64 [2022-02-20 18:53:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:01,718 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 302 transitions. [2022-02-20 18:53:01,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 302 transitions. [2022-02-20 18:53:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:53:01,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:01,718 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] [2022-02-20 18:53:01,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:53:01,719 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:53:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1508633347, now seen corresponding path program 1 times [2022-02-20 18:53:01,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:01,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625316733] [2022-02-20 18:53:01,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:01,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {21945#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {21947#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:01,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {21947#(<= (+ ~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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {21948#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {21949#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {21949#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {21949#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:53:01,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {21949#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id4~0 >= 0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~st4~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send4~0 == ~id4~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode4~0 % 256; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id4~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id4~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {21950#(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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {21950#(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; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {21950#(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; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {21950#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:53:01,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {21950#(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; {21951#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {21951#(not (= ~p3_new~0 ~nomsg~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {21951#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {21951#(not (= ~p3_new~0 ~nomsg~0))} assume ~send4~0 != ~nomsg~0; {21951#(not (= ~p3_new~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {21951#(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; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 4); {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256); {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {21952#(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; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {21952#(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; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 != ~nomsg~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume main_~node3__m3~5#1 > ~id3~0;~send3~0 := main_~node3__m3~5#1; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} ~mode3~0 := 0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node4__m4~8#1;main_~node4__m4~8#1 := ~nomsg~0; {21952#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:53:01,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {21952#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~8#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21953#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~8#1|))} is VALID [2022-02-20 18:53:01,867 INFO L290 TraceCheckUtils]: 59: Hoare triple {21953#(not (= ~nomsg~0 |ULTIMATE.start_main_~node4__m4~8#1|))} assume !(main_~node4__m4~8#1 != ~nomsg~0);~mode4~0 := 0; {21946#false} is VALID [2022-02-20 18:53:01,867 INFO L290 TraceCheckUtils]: 60: Hoare triple {21946#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; {21946#false} is VALID [2022-02-20 18:53:01,867 INFO L290 TraceCheckUtils]: 61: Hoare triple {21946#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~14#1 := 0;~__return_4066~0 := main_~check__tmp~14#1;main_~main__c1~0#1 := ~__return_4066~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; {21946#false} is VALID [2022-02-20 18:53:01,867 INFO L290 TraceCheckUtils]: 62: Hoare triple {21946#false} assume 0 == main_~assert__arg~12#1 % 256; {21946#false} is VALID [2022-02-20 18:53:01,868 INFO L290 TraceCheckUtils]: 63: Hoare triple {21946#false} assume !false; {21946#false} is VALID [2022-02-20 18:53:01,868 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:53:01,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:01,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625316733] [2022-02-20 18:53:01,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625316733] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:01,869 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:01,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:53:01,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294522207] [2022-02-20 18:53:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:01,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:53:01,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:01,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:01,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:01,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:53:01,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:01,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:53:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:53:01,915 INFO L87 Difference]: Start difference. First operand 246 states and 302 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:05,360 INFO L93 Difference]: Finished difference Result 485 states and 625 transitions. [2022-02-20 18:53:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:05,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:53:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 625 transitions. [2022-02-20 18:53:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 625 transitions. [2022-02-20 18:53:05,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 625 transitions. [2022-02-20 18:53:05,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:05,795 INFO L225 Difference]: With dead ends: 485 [2022-02-20 18:53:05,795 INFO L226 Difference]: Without dead ends: 480 [2022-02-20 18:53:05,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:53:05,796 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 1111 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:05,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1111 Valid, 1252 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:53:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-02-20 18:53:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 246. [2022-02-20 18:53:06,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:06,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 245 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:53:06,359 INFO L74 IsIncluded]: Start isIncluded. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 245 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:53:06,360 INFO L87 Difference]: Start difference. First operand 480 states. Second operand has 246 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 245 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:53:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:06,371 INFO L93 Difference]: Finished difference Result 480 states and 619 transitions. [2022-02-20 18:53:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 619 transitions. [2022-02-20 18:53:06,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:06,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:06,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 245 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 480 states. [2022-02-20 18:53:06,372 INFO L87 Difference]: Start difference. First operand has 246 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 245 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 480 states. [2022-02-20 18:53:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:06,384 INFO L93 Difference]: Finished difference Result 480 states and 619 transitions. [2022-02-20 18:53:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 619 transitions. [2022-02-20 18:53:06,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:06,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:06,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:06,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 245 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:53:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 301 transitions. [2022-02-20 18:53:06,389 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 301 transitions. Word has length 64 [2022-02-20 18:53:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:06,389 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 301 transitions. [2022-02-20 18:53:06,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 301 transitions. [2022-02-20 18:53:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:53:06,390 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:06,391 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] [2022-02-20 18:53:06,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:53:06,391 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 18:53:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1008042549, now seen corresponding path program 1 times [2022-02-20 18:53:06,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:06,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979332407] [2022-02-20 18:53:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:06,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {23864#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_2895~0 := 0;~__return_4513~0 := 0;~__return_3065~0 := 0;~__return_3148~0 := 0;~__return_3414~0 := 0;~__return_3599~0 := 0;~__return_3767~0 := 0;~__return_3972~0 := 0;~__return_4150~0 := 0;~__return_4324~0 := 0;~__return_4484~0 := 0;~__return_3327~0 := 0;~__return_3484~0 := 0;~__return_3681~0 := 0;~__return_3839~0 := 0;~__return_4066~0 := 0;~__return_4220~0 := 0;~__return_4406~0 := 0;~__return_4449~0 := 0;~__return_4359~0 := 0;~__return_4277~0 := 0;~__return_4185~0 := 0;~__return_4115~0 := 0;~__return_4007~0 := 0;~__return_3910~0 := 0;~__return_3804~0 := 0;~__return_3732~0 := 0;~__return_3634~0 := 0;~__return_3549~0 := 0;~__return_3449~0 := 0;~__return_3376~0 := 0;~__return_3253~0 := 0;~__return_2986~0 := 0; {23866#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:53:06,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {23866#(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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#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_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#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_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#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_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#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_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#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_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#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_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#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;~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; {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {23867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {23868#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {23868#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {23868#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {23868#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id4~0 >= 0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st4~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send4~0 == ~id4~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode4~0 % 256; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id4~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id4~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2895~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2895~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {23869#(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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {23869#(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; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {23869#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:53:06,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {23869#(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; {23870#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:06,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {23870#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23870#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:06,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {23870#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {23870#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:06,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {23870#(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; {23870#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:06,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {23870#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {23870#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:06,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {23870#(not (= ~nomsg~0 ~p2_new~0))} assume ~send4~0 != ~nomsg~0; {23870#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:53:06,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {23870#(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; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 4); {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_4513~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_4513~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; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,543 INFO L290 TraceCheckUtils]: 51: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,543 INFO L290 TraceCheckUtils]: 52: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {23871#(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; {23871#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:53:06,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {23871#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23872#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} is VALID [2022-02-20 18:53:06,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {23872#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~3#1|))} assume !(main_~node3__m3~3#1 != ~nomsg~0);~mode3~0 := 0; {23865#false} is VALID [2022-02-20 18:53:06,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {23865#false} havoc main_~node4__m4~4#1;main_~node4__m4~4#1 := ~nomsg~0; {23865#false} is VALID [2022-02-20 18:53:06,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {23865#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~4#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23865#false} is VALID [2022-02-20 18:53:06,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {23865#false} assume main_~node4__m4~4#1 != ~nomsg~0; {23865#false} is VALID [2022-02-20 18:53:06,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {23865#false} assume !(main_~node4__m4~4#1 > ~id4~0); {23865#false} is VALID [2022-02-20 18:53:06,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {23865#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; {23865#false} is VALID [2022-02-20 18:53:06,546 INFO L290 TraceCheckUtils]: 61: Hoare triple {23865#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~7#1 := 0;~__return_4150~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_4150~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; {23865#false} is VALID [2022-02-20 18:53:06,546 INFO L290 TraceCheckUtils]: 62: Hoare triple {23865#false} assume 0 == main_~assert__arg~7#1 % 256; {23865#false} is VALID [2022-02-20 18:53:06,546 INFO L290 TraceCheckUtils]: 63: Hoare triple {23865#false} assume !false; {23865#false} is VALID [2022-02-20 18:53:06,546 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:53:06,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:06,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979332407] [2022-02-20 18:53:06,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979332407] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:06,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:06,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:53:06,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894406786] [2022-02-20 18:53:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:53:06,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:06,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:06,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:06,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:53:06,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:53:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:53:06,605 INFO L87 Difference]: Start difference. First operand 246 states and 301 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:10,286 INFO L93 Difference]: Finished difference Result 505 states and 652 transitions. [2022-02-20 18:53:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:53:10,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:53:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 652 transitions. [2022-02-20 18:53:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 652 transitions. [2022-02-20 18:53:10,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 652 transitions. [2022-02-20 18:53:10,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 652 edges. 652 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:10,791 INFO L225 Difference]: With dead ends: 505 [2022-02-20 18:53:10,791 INFO L226 Difference]: Without dead ends: 488 [2022-02-20 18:53:10,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:53:10,792 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 1413 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:10,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1413 Valid, 1308 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:53:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states.